Cod sursa(job #1580316)
Utilizator | Data | 25 ianuarie 2016 19:27:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int v[2000005];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main ()
{
int n, p;
fin >> n;
p = 0;
for (int i = 2; i <= n; i++)
{
if (v[i] == 0)
{
for (int j = 2*i; j <= n; j = j + i)
v[j] = 1;
p++;
}
}
fout << p << '\n';
fin.close();
fout.close();
return 0;
}