Cod sursa(job #1771965)
Utilizator | Data | 6 octombrie 2016 12:38:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int NMAX = 2000005;
bool divide[NMAX];
int main(int argc, char** argv) {
int N, count;
fin >> N;
for(int i = 2 ; i <= N ; i++) {
if(!divide[i]) {
count++;
for(int j = i * i ; j <= N ; j += i) {
divide[j] = true;
}
}
}
fout << count;
return 0;
}