Cod sursa(job #1241290)
| Utilizator | Data | 13 octombrie 2014 10:06:36 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, i, j, cont;
bool v[2000001];
int main() {
fin >> n;
if(n>=2) {
cont++;
v[2]=1;
}
for(i = 3; i <= n; i += 2) {
if(!v[i]) {
cont++;
for(j = 3 * i; j <= n; j += 2 * i) {
v[j] = 1;
}
}
}
/*for(i = 0; i <= n; i++) {
cout << i << ' ';
}
cout << '\n';
for(i = 0; i <= n; i++) {
cout << v[i] << ' ';
}*/
fout << cont;
return 0;
}
