Cod sursa(job #3306752)
| Utilizator | Data | 13 august 2025 14:51:55 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
bitset <2000555> f;
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n=2000005;
cin>>n;
f[0]=1;
f[1]=1;
for(int i=4;i<=n;i+=2)
{
f[i]=1;
}
for(int i=3;i*i<=n;i+=2)
{
if(f[i]==0)
{
for(int j=i;j*i<=n;j+=2)
{
f[i*j]=1;
}
}
}
int cnt=0;
for(int i=1;i<=n;++i)
{
if(f[i]==0)
{
++cnt;
}
}
cout<<cnt;
return 0;
}
