Cod sursa(job #583146)
Utilizator | Data | 18 aprilie 2011 11:16:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.22 kb |
#include<fstream.h>
char a[2000001];
int main()
{int N,i,j,nr=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>N;
for(i=2;i<=N;i++)
if(!a[i])
{nr++;
for(j=2*i;j<=N;j+=i)
a[j]=1;
}
g<<nr;
return 0;
}