Cod sursa(job #1148005)
Utilizator | Data | 20 martie 2014 12:45:07 | |
---|---|---|---|
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,nr,i,k,ok;
int main()
{
fin>>n;
nr=0;
for(i=2;i<=n;i++)
{
ok=1;
for(k=2;k<=i/2;k++)
{
if(i%k==0)
ok=0;
}
if(ok==1)
nr++;
}
fout<<nr;
return 0;
}