Cod sursa(job #1345389)
| Utilizator | Data | 17 februarie 2015 16:20:05 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[2000000];
int main()
{
int n, i, j, cate = 0;
fin >> n;
ciur[0] = 1;
ciur[1] = 1;
for(i = 2; i < n; i++){
if(ciur[i] == 0){
cate++;
for(j = i + i; j < n; j = j + i){
ciur[j] = 1;
}
}
}
fout << cate;
fin.close();
fout.close();
return 0;
}
