Cod sursa(job #1068600)
Utilizator | Data | 28 decembrie 2013 15:30:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool prim(int x)
{
bool prim = 1;
for(int d = 2; d<=x/2; d++)
{
if(x%d == 0)
prim = 0;
}
return prim;
}
int main()
{
int n, nr = 0;
fin>>n;
for(int i = 2; i<= n; i++)
{
if(prim(i))
{
++nr;
}
}
fout<<nr;
}