Cod sursa(job #876407)
Utilizator | Data | 11 februarie 2013 19:59:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
void citire()
{
fin>>n;
}
int prim(int a)
{
int d;
for(d=2; d<=a/2; d++)
if(a%d==0)
return 0;
return 1;
}
int main()
{
int k=0;
int i;
citire();
for(i=2; i<=n; i++)
if(prim(i))
k++;
fout<<k;
fin.close();
fout.close();
return 0;
}