Cod sursa(job #797248)
Utilizator | Data | 13 octombrie 2012 17:31:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int main()
{ ifstream f("ciur.in");
ofstream g("ciur.out");
int n,cnt = 0,prim[2000002],i,j;
f >> n;
for(i = 2;i <= n;i++)prim[i] = 1;
for(i = 2;i <= n;i++){
if(prim[i] == 1){cnt++;
for(j = i+i;j<= n;j=j+i)prim[j] = 0;
}
}
g << cnt;
f.close();
g.close();
return 0;
}