Cod sursa(job #3286626)
| Utilizator | Data | 14 martie 2025 14:29:41 | |
|---|---|---|---|
| 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");
const int N=2000000;
bitset<N+1>ciur;
void Ciur()
{
ciur[0]=ciur[1]=1;
for(int i=4; i<=N; i+=2)
ciur[i]=1;
for(int i=3; i*i<=N; i+=2)
if(ciur[i]==0)
for(int j=i*i; j<=N; j+=2*i)
ciur[j]=1;
}
int main()
{
Ciur();
int n, cnt=0;
fin >> n;
for(int i=2; i<=n; i++)
if(ciur[i]==0)
cnt++;
fout << cnt;
return 0;
}
