Cod sursa(job #2223928)
Utilizator | Data | 22 iulie 2018 12:11:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout("ciur.out");
char ciur[2000001];
int main(){
int i, j, n, nr = 0;
fin >> n;
for (i = 2;i <= n;i++)
if (ciur[i] == 0){
nr++;
for (j = i*i;j <= n;j += i)
ciur[j] = 1;
}
fout << nr;
return 0;
}