Cod sursa(job #3376062)
| Utilizator | Data | 15 noiembrie 2026 17:43:54 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
#include<bitset>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bitset<2000001> a;
int main()
{
int n;
cin>>n;
for(int i=3;i*i<=n;i+=2)
if(!a[i])
for(int j=i*i;j<=n;a[j]=1,j+=i<<1);
return cout<<((n+1)>>1)-a.count(),0;
}