Cod sursa(job #155257)
Utilizator | Data | 11 martie 2008 20:28:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
char a[2000002];
long cont=0,i,j,n;
int main()
{
f>>n;
i=2;
while(i<=n)
{
while(a[i]!=0)
i++;
for(j=i+i;j<=n;j+=i)
a[j]=1;
i++;
}
for(i=n;i>=2;i--)
if(a[i]==0)
cont++;
g<<cont;
f.close();
g.close();
return 0;
}