Cod sursa(job #2720805)
Utilizator | Data | 11 martie 2021 12:04:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <bitset>
#define DIM 2000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, nr;
bitset <DIM+10> ciur;
void sieve()
{ for(int i=2; i<=n; i++)
if(!ciur[i])
{ nr++;
for(int j=2*i; j<=n; j+=i)
ciur[j] = 1;
}
}
int main()
{
fin >> n;
sieve();
fout << nr << '\n';
return 0;
}