Cod sursa(job #2782639)
Utilizator | Data | 12 octombrie 2021 19:47:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int N=2000000;
bitset<N+1>c;
int main()
{
int n, i, j, k=0;
in>>n;
for (i=2; i*i<=n; i++)
{
if (c[i]==0)
{
for (j=i*i; j<=n; j+=i)
c[j]=1;
}
}
for (i=2; i<=n; i++)
if (c[i]==0)
k++;
out<<k;
return 0;
}