Cod sursa(job #862022)
Utilizator | Data | 22 ianuarie 2013 09:17:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.24 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
int N,nr,x,i,j;
char a[2000001];
int main()
{
f>>N;
for(i=2;i<=N;i++)
if(a[i]==0)
{
nr++;
for(j=2*i;j<=N;j=j+i)
a[j]=1;
}
g<<nr;
return 0;
}