Cod sursa(job #1340054)
Utilizator | Data | 11 februarie 2015 14:56:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | 9neplace | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <string>
#define LIM 2000005
using namespace std;
bool viz[LIM];
int main() {
int n, cnt = 0;
cin >> n;
for(int i = 2; i <= n; i++) {
if(!viz[i]) {
cnt++;
if(i <= n / i) {
for(int j = i * i; j <= n; j += i) {
viz[j] = true;
}
}
}
}
cout << cnt << "\n";
return 0;
}