T次询问,求∑n−1i=1∑nj=i+1gcd(i,j)
T有2W,反正反演是T了,虽然感觉O(Tsqrt(n))能过
如果固定j,那么就是求T(j)=∑j−1i=1gcd(i,j)
T(j)=∑d|jd∗phi(jd),但是d不能等于j,因为上面的式子i不能取到j
于是把T(j)筛出来就行,最后求和,原本想的要O(nlogn)筛,虽然应该不会T,但是感觉不是很好的方法
看了cxlove神犇的博客,发现他的筛法貌似是O(sqrt(n)∗logn)的
枚举小的因子,然后枚举大的因子,一次给T(i∗j)+=i∗phi(j)+j∗phi(i)
i=1的时候单独讨论就行,不加因子是n的就行
代码
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")
using namespace std;
#define MAX 1000005
#define MAXN 1000005
#define maxnode 205
#define sigma_size 2
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define middle int m=(r+l)>>1
#define LL long long
#define ull unsigned long long
#define mem(x,v) memset(x,v,sizeof(x))
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define bits(a) __builtin_popcount(a)
#define mk make_pair
#define limit 10000
//const int prime = 999983;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f;
//const double pi = acos(-1.0);
const double inf = 1e18;
const double eps = 1e-9;
const LL mod = 1e9+7;
const ull mx = 133333331;
/*****************************************************/
inline void RI(int &x) {
char c;
while((c=getchar())<'0' || c>'9');
x=c-'0';
while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
}
/*****************************************************/
bool prime[MAX];
int pr[MAX];
int eluer[MAX];
int tot;
LL g[MAX];
void init(){
mem(prime,0);tot=0;
eluer[1]=1;
for(int i=2;i<MAX;i++){
if(!prime[i]){
pr[tot++]=i;
eluer[i]=i-1;
}
for(int j=0;j<tot&&pr[j]*i<MAX;j++){
prime[pr[j]*i]=1;
if(i%pr[j]==0){
eluer[pr[j]*i]=eluer[i]*pr[j];
break;
}
eluer[pr[j]*i]=eluer[i]*eluer[pr[j]];
}
}
mem(g,0);
for(int i=2;i<MAX;i++) g[i]+=eluer[i];
for(int i=2;i*i<MAX;i++){
g[i*i]+=(LL)i*eluer[i];
for(int j=i+1;j*i<MAX;j++){
g[j*i]+=(LL)j*eluer[i]+(LL)i*eluer[j];
}
}
for(int i=2;i<MAX;i++) g[i]+=g[i-1];
}
int main(){
//freopen("in.txt","r",stdin);
int n;
init();
while(cin>>n&&n){
printf("%lld\n",g[n]);
}
return 0;
}