Cod sursa(job #2498673)
Utilizator | Manolachi George zeffar | Data | 24 noiembrie 2019 10:39:43 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <math.h>
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n, r;
bool v[2000005];
int main()
{ cin >> n;
for (int i = 2; i <= n; i++) {
if (v[i] == 0) {
for (int d = i + i; d <= n; d += i)
v[d] = 1;
r++;}
}
cout << r;
return 0;
}