Pagini recente » chipciulacfr | Cod sursa (job #1504205) | Cod sursa (job #1377472) | Cod sursa (job #1187222) | Cod sursa (job #264467)
Cod sursa(job #264467)
#include <stdio.h>
int a[1000000];
int phi(int m)
{
int s;
for (s=2;s*s<=m;s++)
{
if (m%s==0)
{
if ((m/s)%s==0)
a[m]=a[m/s]*s;
else
a[m]=a[m/s]*(s-1);
return a[m];
}
}
a[m]=m-1;return a[m];
}
int main()
{
long long int nr;
int n;
nr=0;
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
for (int i=2;i<=n;i++)
nr=nr+phi(i);
nr=nr*2+1;
printf("%lld",nr);
return 0;
}