Cod sursa(job #39012)
| Utilizator | Data | 26 martie 2007 12:50:50 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<stdio.h>
#include<string.h>
int n,i,j,k;
long long nr;
int main()
{freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
char prim[(const)(n+1)];
nr=n;
for(i=2;i<=n;i++)
{memset(prim,1,sizeof(prim));
for(j=2;j<=i;j++)
if(prim[j]&&i%j==0)
for(k=j;k<=n;k=k+j)
prim[k]=0;
for(j=1;j<=n;j++)
nr=nr+prim[j];}
printf("%lld",nr);
fclose(stdout);
return 0;}
