Cod sursa(job #2097297)
Utilizator | Data | 30 decembrie 2017 21:34:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int N;
bool c[2000005];
int main(){
in >> N;
for (int i = 2; i <= N; ++i){
for (int j = 2; j <= N; ++j)
if (i * j <= N) c[i*j] = 1;
else break;
}
int suma = 0;
for (int i = 2; i <= N; ++i)
if (c[i] == 0)
suma++;
out << suma << '\n';
return 0;
}