Cod sursa(job #1355676)
Utilizator | Data | 22 februarie 2015 22:02:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, nr;
bool p[2000001];
int main()
{
fin >> n;
fin.close();
int i, j;
i = 2;
nr = 0;
do
{
if (p[i] == 0)
{
nr++;
for (j = i * i; j <= n; j += i)
p[j] = 1;
}
i ++;
}
while ( i <= n);
fout << nr << '\n';
fout.close();
return 0;
}