Cod sursa(job #526355)
Utilizator | Data | 28 ianuarie 2011 09:51:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
#include<math.h>
int n,d,i,nr,e;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
nr=0;
for(i=2;i<=n;i++)
{
e=1;
for(d=2;d<=sqrt(i);d++)
{
if(i%d==0)
{
e=0;
break;
}
}
if(e==1)
{
nr=nr+1;
}
}
printf("%d",nr);
return 0;
}