Cod sursa(job #1808465)
Utilizator | Data | 17 noiembrie 2016 18:46:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bitset<1000010> p;
int n,i,m,j,sol=1;
int main()
{
f>>n;
if(n%2)n--;
m=n/2;
for(i=3;i*i<=n;i+=2)
if(!p[(i-1)/2])
{
sol++;
for(j=(i*i-1)/2;j<=m;j+=i)
p[j]=1;
}
for(i=(i-1)/2;i<=m;i++)
if(!p[i])
sol++;
g<<sol;
return 0;
}