Cod sursa(job #645099)
Utilizator | Data | 8 decembrie 2011 14:51:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
char a[2000001];
int main ()
{
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int N, j, i,cnt=0;
i=2;
f>>N;
f.close();
for (i = 2; i <= N; ++i)
if (a[i]==0)
{++cnt;
for (j = i+i; j <= N; j += i)
a[j] = 1;
}
g<<cnt;
return 0;
}