题意:
求满足下面公式的数的个数
n i-1
∑ ∑ [gcd(i + j, i - j) = 1]
i=1 j=1
思路:
公式可以化为
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 j=1
对于每个i,求有多少个小于它的a满足gcd(i,a)且a是奇数
当i是奇数时,答案为phi(i)/2
当i是偶数时,答案为phi(i)
i = 0,答案为0 附上打表思路和比赛时队友的oeis思路【oeis思路就很骚】
好像他是搜的每组差值 反正很神奇= =
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e7+5;
int phi[maxn];
ll sum[maxn];
void phi_table() {
memset(phi,0,sizeof(phi));
phi[1]=1;
for(int i=2; i<maxn; i++)if(!phi[i])
for(int j=i; j<maxn; j+=i) {
if(!phi[j]) phi[j]=j;
phi[j]=phi[j]/i*(i-1);
}
}
int main() {
int t;
scanf("%d",&t);
phi_table();
sum[1] = 0;
for(int i = 2; i < maxn; i++) {
if(i & 1) sum[i] = sum[i-1] + phi[i]/2;
else sum[i] = sum[i-1] + phi[i];
}
while(t--) {
int n;
scanf("%d",&n);
printf("%lld\n",sum[n]);
}
}
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <stack>
#include <cmath>
#include <deque>
#include <queue>
#include <list>
#include <set>
#include <map>
#define mem(a, b) memset(a, b, sizeof(a))
#define pi acos(-1)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b){
return b == 0 ? a : gcd(b, a%b);
}
const ll maxn = 40000010;
int phi[maxn], pri[maxn], top;
ll ans[maxn/2];
bool vis[maxn];
void phi_table(){
phi[1]=1;
mem(vis, 0);
top = 0;
for(int i=2;i<maxn;++i){
if(!vis[i])pri[++top]=i,phi[i]=i-1;
for(int j=1;j<=top&&i*pri[j]<maxn;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0){
phi[i*pri[j]]=phi[i]*pri[j];
break;
}
else phi[i*pri[j]]=phi[i]*(pri[j]-1);
}
}
}
int main(){
int t;
scanf("%d", &t);
phi_table();
for(int i = 2; i <= maxn/2; i++){
ans[i] = ans[i-1]+phi[2*i]/2.0;
}
while(t--){
ll n;
scanf("%lld", &n);
printf("%lld\n", ans[n]);
}
}