Cod sursa(job #2766650)
| Utilizator | Data | 2 august 2021 17:12:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main() {
bool prim;
int n, i, nr = 2, raspuns = 0;
fin >> n;
while(nr <= n) {
prim = true;
if(nr == 0 || nr == 1)
prim = false;
else if(n != 2 && n % 2 == 0)
prim = false;
else {
for(i = 3; i * i <= nr; i += 2) {
if(nr % i == 0)
prim = false;
}
}
++nr;
if(prim)
++raspuns;
}
fout << raspuns;
return 0;
}
