Cod sursa(job #2376298)
| Utilizator | Data | 8 martie 2019 14:46:09 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <cmath>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset < 2000005 > p;
int main()
{
int cate = 1, n;
fin >> n;
for(int i = 3; i <= n; i += 2)
{
if(!p[i])
{
cate++;
for(int j = i * i; j <= n; j += 2 * i)
{
p[j] = 1;
}
}
}
fout << cate;
fin.close();
fout.close();
return 0;
}
