Cod sursa(job #2498642)
Utilizator | Data | 24 noiembrie 2019 09:59:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int main()
{
int n, s,ok=1;
cin >> n;
for (int i = 2; i <= n; i++)
for (int z = 2; z <= i / 2; z++) if (i % z == 0) ok=0;
if (ok == 1) s++;
cout << s;
}