Cod sursa(job #1242241)
Utilizator | Data | 14 octombrie 2014 09:43:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int nr,i,j,n,p[1000005];
int main()
{
f>>n;
nr=0;
for(i=1;(i*i)<<1+(i<<1)<=n;++i)
if(p[i]==0)
for(j=(i*i)<<1+(i<<1);(j<<1)+1<=n;j+=(i<<1)+1)
p[i]=1;
for(i=1;(i<<1)+1<=n;++i)
if(p[i]==0)
++nr;
g<<nr;
return 0;
}