Cod sursa(job #2911593)
Utilizator | Data | 30 iunie 2022 17:09:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j;
bitset<2000001> p;
int main()
{
for(f>>n,i=3;i*i<=n;i+=2)
if(!p[i])
for(j=i*i;j<=n;j+=2*i)
p[j]=1;
return g<<(n+1)/2-p.count(),0;
}