求出2~n-1内所有数的欧拉函数,求和之后*2再加上3((1,1),(0,1),(1,0)三个点),输出即可code:
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int n;
long long sum;
long long phi(int n)
{
long long ans;
int m,i;
m=floor(sqrt(n));
ans=n;
for (i=2;i<=m;++i)
{
if (n%i==0)
{
ans=ans/i*(i-1);
while (n%i==0) n/=i;
}
}
if (n>1) ans=ans/n*(n-1);
return ans;
}
int main()
{
int i;
scanf("%d",&n);
sum=2;
for (i=2;i<=n-1;++i)
sum+=phi(i);
sum=sum*2-1;
printf("%lld\n",sum);
}