Cod sursa(job #3224067)
Utilizator | Data | 14 aprilie 2024 14:10:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream F("ciur.in");
ofstream G("ciur.out");
int n,i,j;
bitset<2000001> b;
int main()
{
for(F>>n,i=3;i*i<=n;i+=2)
if(!b[i])
for(j=i*i;j<=n;b[j]=1,j+=2*i);
return G<<(n+1)/2-b.count(),0;
}