Cod sursa(job #2272764)
Utilizator | Data | 30 octombrie 2018 17:17:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int x[20000004];
int main()
{
int n, cont = 0;
cin >> n;
for(int i = 2; i <= n / 2; i++)
{
if(x[i] == 0){
cont++;
for(int j = i + i; j <= n; j += i)
x[j] = 1;
}
}
cout << cont;
return 0;
}