Cod sursa(job #209409)
Utilizator | Data | 22 septembrie 2008 10:11:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <stdio.h>
int main()
{freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,s,j,t;
s=0;
scanf("%d",&n);
for (int i=1; i<=n; ++i)
{ t=0;
for (j=2; j<i/2; ++j)
if (i%j==0) t=t+1;}
if (t==0) s=s+1;
printf("%d",s);
return 0;
}