Cod sursa(job #2512997)
| Utilizator | Data | 22 decembrie 2019 10:49:29 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n, nr = 1;
bitset <2000005> p;
int main()
{
cin >> n;
p[1] = 1;
for(int i = 2; i * i <= n; i++)
if(p[i] == 0)
for(int j = i * i; 1LL * j <= 1LL * n; j += i)
{
if(p[j] == 0)
nr++;
p[j] = 1;
}
// for(int i = 1; i <= n; i++)
// cout << i << " " << p[i] << endl;
cout << n - nr;
return 0;
}
