Cod sursa(job #2205937)
Utilizator | Data | 20 mai 2018 17:18:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool b[50000001];
int main(){
int n, k = 1;
cin>>n;
for(int i = 1;2*i*i + 2*i <= n; ++i)
if(!b[i])
for(int j = 2*i*i + 2*i;2*j + 1 <= n; j += 2*i + 1)
b[j] = 1;
for(int i = 1;2*i + 1<= n; ++i)
if(!b[i])
++k;
cout<<k;
return 0;
}