Cod sursa(job #392831)
Utilizator | Nadolu Bogdan NadoluBogdan | Data | 8 februarie 2010 14:21:51 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream.h>
#include<math.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
int x,n,nr,i,j,ok;
int main(){
f>>n;
for (i=2;i<=n;i++){
ok=1;
for(j=2;j<=sqrt(i);j++)
if (i%j==0)
{ok=0;break;}
if (ok==1)
nr++;
}
g<<nr;
return 0;
}