Cod sursa(job #2428694)
Utilizator | Data | 6 iunie 2019 02:36:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int t[2000005], n, i, j, x = 1;
int main()
{
in >> n;
t[0] = t[1] = 1;
for (i = 2; i <= int(sqrt(n)); i ++)
if (t[i] == 0)
for (j = 2; j <= n/i; j ++)
if (!t[i*j]){
t[i*j] = 1;
x ++;
}
out << n-x;
return 0;
}