Cod sursa(job #170720)
Utilizator | Data | 3 aprilie 2008 08:31:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
#define M 2000004
char ciur[M];
int main()
{int n,i,k,j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
k=0;
for(i=2;i<=n;i++)
ciur[i]=1;
for(i=2;i<=n;i++)
if(ciur[i]) {for(j=2;j<=n/i;j++)
ciur[i*j]=0;
}
for(i=2;i<=n;i++)
if(ciur[i]) k++;
g<<k;
f.close();
g.close();
return 0;
}