Cod sursa(job #1396352)
Utilizator | Data | 22 martie 2015 14:12:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,nr;
bool p[2000001];
int main()
{
fin >> n;
for(i = 3; i <= n; ++i)
if(!p[i])
{for(j = i + i; j <= n; j+=i)
p[j] = 1;
if(i%2)
++nr;
}
fout << nr + 1;
return 0;
}