Cod sursa(job #2300194)
| Utilizator | Data | 10 decembrie 2018 22:29:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N, np;
bitset<2000010> b;
void ciur()
{
if(N<2)
return;
for(int i=2; i*i<=N; i++)
{
if(!b[i])
{
for(int j=i*i; j<=N; j=j+i)
b[j] = 1;
}
}
np=1;
for(int i=3; i<=N; i+=2)
if(b[i] == 0)
{
np++;
}
}
int main()
{
fin >> N;
ciur();
fout<<np;
return 0;
}
