Cod sursa(job #220046)
Utilizator | Data | 9 noiembrie 2008 12:31:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
int a[100],n,i,j,nr;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
{
j=i+1;
while(j<=n)
{
if(j%i==0)
a[j]=1;
j++;
}
}
for(i=2;i<=n;i++)
if(a[i]==0)nr++;
printf("%d",nr);
return 0;
}