Cod sursa(job #994726)
Utilizator | Data | 6 septembrie 2013 10:07:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
# include <iostream>
# include <fstream>
# include <bitset>
using namespace std;
# define MAXN 2000003
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<MAXN> prim;
int main()
{
int n, s = 0;
fin >> n;
prim.set();
for (int i = 2; i <= n; i++)
{
if (prim[i] == true)
{
s++;
for (int j = i + i; j <= n; j += i)
{
prim[j] = false;
}
}
}
fout << s;
}