Cod sursa(job #711170)
Utilizator | Data | 11 martie 2012 15:30:30 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <stdio.h>
int a[1000000];
long long functi(int n,int a[1000000])
{
int i,j;
long long k=0;
for (i=1;i<=n;i++)
a[i]=i-1;
for (i=2;i<=n;i++)
{
for (j=2*i;j<=n;j=j+i){
a[j]=a[j]-a[i];
}
k=k+a[i];
}
k=2*k;
return k+1;
}
int main()
{
int n;
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
printf("%lld",functi(n,a));
return 0;
}