Cod sursa(job #2331671)
| Utilizator | Data | 29 ianuarie 2019 19:46:01 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("ciur.in");
ofstream cout ("ciur.out");
int cnt, n;
int low[2000005];
vector <int> primes;
int main() {
cin >> n;
for(int i = 2; i <= n; i++) {
if(low[i] == 0) {
low[i] = i;
primes.push_back(i);
}
for(int j = 0; j < primes.size() && primes[j] <= low[i] && i * primes[j] <= n; j++)
low[i * primes[j]] = primes[i];
}
cout << primes.size();
return 0;
}
