Cod sursa(job #2574122)
Utilizator | Data | 5 martie 2020 20:29:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, nr = 0;
char c[2000001];
int main() {
fin>>n;
for(int i = 2; i*i <= n; i++) {
if(c[i] == 0) {
for(int j = 2; j <= n/i; j++)
c[i*j] = i*j;
}
}
for(int i = 2; i <= n; i++)
if(c[i] == 0)
nr++;
fout<<nr;
return 0;
}