Cod sursa(job #905462)
Utilizator | Data | 5 martie 2013 20:57:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
bool f[2000005];
int n, p;
int main ()
{
ifstream fin ("ciur.in");
fin >> n;
fin.close();
for (int i = 2; i <= n; ++i)
if (!f[i])
{
p++;
for (int j = i * 2; j <= n; j += i)
f[j] = 1;
}
ofstream fout ("ciur.out");
fout << p;
fout.close();
return 0;
}