Cod sursa(job #2499174)
Utilizator | Data | 25 noiembrie 2019 16:40:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,nr;
bool v[2000005];
int main()
{
fin >> N;
for(int i=3;i*i<=N;i+=2)
if(!v[i])
for(int j=i*i;j<=N;j+=2*i)
v[j]=true, nr++;
fout << (N+1)/2-nr;
return 0;
}