Cod sursa(job #154947)
Utilizator | Data | 11 martie 2008 16:51:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream.h>
#define nmax 2000010
ifstream f("ciur.in");
ofstream g("ciur.out");
char a[nmax];
int n, i, nrp, j;
int main()
{
f>>n;
f.close();
for(i=2; i<=n; i++)
if(!a[i]){
nrp++;
for(j=i+i; j<=n; j+=i) a[j]=1;
}
g<<nrp<<'\n';
g.close();
return 0;
}