Cod sursa(job #2573097)
| Utilizator | Data | 5 martie 2020 15:48:40 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
#define nMax 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
bitset<nMax> v;
void ciur()
{
v[0]=v[1]=1;
for(int i=4; i<=n; i+=2)
v[i]=1;
for(int i=3; i*i<=n; i+=2)
if(!v[i])
for(int j=i*i; j<=n; j+=2*i)
v[j]=1;
}
int main()
{
fin >> n;
ciur();
int sol=0;
for(int i=2; i<=n; i++)
if(!v[i])
sol++;
fout << sol;
return 0;
}
