题意:
求
n i-1
∑ ∑ [gcd(i + j, i - j) = 1]
i=1 j=1
思路:
令a=i-j,
n i-1
∑ ∑ [gcd(i + j, i - j) = 1]
i=1 j=1
n i-1
=∑ ∑ [gcd(2i - a, a) = 1]
i=1 a=1
n i-1
=∑ ∑ [gcd(2i, a) = 1]
i=1 a=1
所以i是奇数的时候,答案有phi(i)/2个,i是偶数的时候,答案是phi(i)个。
代码:
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cstdio>
#include <string>
#include <bitset>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#define X first
#define Y second
#define lch (o<<1)
#define rch (o<<1|1)
#define pb push_back
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define sd(n) scanf("%d",&n)
#define sf(n) scanf("%lf",&n)
#define cout1(x) cout<<x<<endl
#define pdd pair<double,double>
#define ALL(x) x.begin(),x.end()
#define sdd(n,m) scanf("%d%d",&n,&m)
#define INS(x) inserter(x,x.begin())
#define mst(a,b) memset(a,b,sizeof(a))
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define cout2(x,y) cout<<x<<" "<<y<<endl
#define qclear(a) while(!a.empty())a.pop()
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define IOS std::ios::sync_with_stdio(false)
#define SRAND srand((unsigned int)(time(0)))
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define cout3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
const double PI=acos(-1.0);
const int INF=0x3f3f3f3f;
const double eps=1e-3;
const ll mod=1e9;
const int maxn=2e7+5;
const int maxm=50005;
int euler[maxn];
void geteuler(){
mst(euler,0);
euler[1]=1;
for(int i=2;i<=2e7;i++){
if(!euler[i]){
for(int j=i;j<=2e7;j+=i){
if(!euler[j])euler[j]=j;
euler[j]=euler[j]/i*(i-1);
}
}
}
}
ll fac[maxn];
void init(){
fac[0]=0;
fac[1]=0;
for(int i=2;i<=maxn;i++){
if(i&1){
fac[i]=fac[i-1]+euler[i]/2;
}else{
fac[i]=fac[i-1]+euler[i];
}
}
}
ll cal(int n) {
ll res=0;
for(int i=1; i<=n; i++) {
for(int j=1; j<i; j++) {
if(__gcd(i+j,i-j)==1) {
res++;
}
}
}
return res;
}
void solve() {
geteuler();
init();
int t;
sd(t);
while(t--){
int n;
sd(n);
printf("%lld\n",fac[n]);
}
return ;
}
int main() {
#ifdef LOCAL
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
#else
// freopen("","r",stdin);
// freopen("","w",stdout);
#endif
solve();
return 0;
}