Cod sursa(job #583707)
Utilizator | Data | 21 aprilie 2011 23:13:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int prim(int a)
{
int d;
for(d = 2; d * d <= a; d++)
if(a % d == 0)
return 0;
return 1;
}
int main()
{
int n, nrpr = 0;
fin >> n;
for(int i = 2; i <= n ; i++)
if(prim(i))
nrpr++;
fout << nrpr;
fin.close();
fout.close();
return 0;
}