Cod sursa(job #1768505)
Utilizator | Data | 30 septembrie 2016 23:29:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int NMAX = 2e6 + 6;
int n;
bool ciur[NMAX];
int primes;
int main() {
fin >> n;
for(int i = 2; i <= n ; ++i) {
if(ciur[i] == 0) {
primes++;
for(int j = i + i ; j <= n; j += i)
ciur[j] = 1;
}
}
fout << primes << '\n';
return 0;
}