Cod sursa(job #2380775)
Utilizator | Data | 15 martie 2019 14:57:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int n, i, j, prime;
int main()
{
in >> n;
prime = n - n/2;
for(i = 3; i * i <= n; i += 2)
if(v[i] == 0)
for(j = i * i; j <= n; j += i)
if(j % 2 != 0)
{
v[j] = 1;
prime--;
}
out << prime;
return 0;
}