Cod sursa(job #2380742)
Utilizator | Data | 15 martie 2019 14:41:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool oneTime;
int n, i, j, prime;
int main()
{
in >> n;
prime = n;
for(i = 2; i <= n; i++)
if(i % 2 != 0
|| !oneTime)
for(j = i * i; j <= n; j += i)
prime--;
out << --prime;
return 0;
}