Cod sursa(job #662307)
Utilizator | Data | 16 ianuarie 2012 15:13:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
# include <fstream>
using namespace std;
char ciur[20000001] ;
int main ()
{
int i,j, nr=0,n;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (i=2;i<=n;i++)
{if(ciur[i]==0)
nr++;
for (j=i+i;j<=n;j+=i)
ciur[j]=1;
}
g<<nr;
f.close();
g.close();
return 0;
}