Cod sursa(job #1968820)
| Utilizator | Data | 17 aprilie 2017 21:34:31 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ciur.in"); ofstream g("ciur.out");
int n, nr; bool c[2000003];
int main() {
int i,j;
f>>n;
for(i = 3; i <= n; ++i) {
c[i] = 1;
}
for(i = 3; i * i <= n; i += 2) {
if (c[i]) {
for(j = i*i; j <= n; j += i) {
c[j] = 0;
}
}
}
for(i = 3; i <= n; i +=2) {
if(c[i]) {
++nr;
}
}
g<<nr;
return 0;
}
