Cod sursa(job #301145)
Utilizator | Data | 7 aprilie 2009 22:54:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
char p[2000010];
ofstream g("ciur.out");
int main()
{long n,contor,i,j;
ifstream f("ciur.in");
f>>n;
p[1]=0;
for(i=2; i<=n; i++)
p[i]=1;
for(i=2; i<=n; i++)
if(p[i])
for(j=i+i; j<=n; j+=i)
p[j]=0;
for(i=1;i<=n;i++)
if(p[i]) contor++;
g<<contor;
return 0;
}