Cod sursa(job #1449877)
Utilizator | Data | 10 iunie 2015 20:42:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000001];
int main()
{
int n, s = 0;
f >> n;
for (int i = 2; i < n; i++) {
if (v[i] != 1) {
for (int j = 2 * i; j <= n; j += i) {
v[j] = 1;
}
}
}
for (int i = 2; i <= n; i++) {
if (v[i] == 0) s++;
}
g << s;
return 0;
}