Cod sursa(job #1123588)
Utilizator | Muresan Gabi mg06091999 | Data | 26 februarie 2014 09:13:30 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std ;
int N, cnt;
char prim[2000005];
int main()
{
int i, j;
ifstream fin ("ciur.in" );
ofstream fout ("ciur.out");
fin >> N ;
for (i = 2; i <= N; ++i)
prim[i] = 1;
for (i = 2; i <= N; ++i)
if (prim[i])
{
++cnt;
for (j = i+i; j <= N; j += i)
prim[j] = 0;
}
fout<<cnt<<'\n';
fin.close();
fout.close();
return 0;
}