Cod sursa(job #1697213)
Utilizator | Data | 1 mai 2016 00:42:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main(void)
{
int n, prim[2000005] = { 0 }, cnt = 0, i, j;
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 << endl;
return 0;
}