Cod sursa(job #2000246)
Utilizator | Data | 13 iulie 2017 10:57:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n, r = 0, i, i2;
bool prim;
fin >> n;
for(i = 2; i<=n; i++)
{
prim = true;
for(i2 = 2; i2<=i/2; i2++)
{
if(i % i2 == 0)
{
prim = false;
break;
}
}
if(prim == true)r++;
}
fout << r;
return 0;
}