Pagini recente » Cod sursa (job #2433075) | Cod sursa (job #2590353) | Cod sursa (job #402631) | Cod sursa (job #1383073) | Cod sursa (job #711163)
Cod sursa(job #711163)
#include <stdio.h>
int a[1000000];
long functie(int n,int a[1000000])
{
int i,j;
long long k;
k=2;
for (i=2;i<=n;i++)
a[i]=i;
for (i=2;i<=n;i++)
{
if(a[i]==i){
for(j=i;j<=n;j+=i){
a[j]/=i;
a[j]*=(i-1);
}
k=k+2*a[i];
}
}
return k-1;
}
int main()
{
int n;
scanf("%d",&n);
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
printf("%lld",functie(n,a));
return 0;
}