Cod sursa(job #2358393)
Utilizator | Data | 28 februarie 2019 08:24:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
char ciur[2000001];
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int N, i, j, nr = 1;
fin >> N;
for (i = 3; i*i <= N; i += 2){
if (!(ciur[i])){
nr++;
for (j = i*i; j <= N; j += i){
ciur[j] = 1;
}
}
}
fout << nr;
return 0;
}