[BZOJ2820]YY的GCD

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;

const int BufferSize = 1 << 16;
char buffer[BufferSize], *Head, *Tail;
inline char Getchar() {
    if(Head == Tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        Tail = (Head = buffer) + l;
    }
    return *Head++;
}
int read() {
    int x = 0, f = 1; char c = Getchar();
    while(!isdigit(c)){ if(c == ‘-‘) f = -1; c = Getchar(); }
    while(isdigit(c)){ x = x * 10 + c - ‘0‘; c = Getchar(); }
    return x * f;
}

#define maxn 10000010
#define LL long long
int T, n, m;

int prime[maxn], cnt, u[maxn], g[maxn];
LL sum[maxn];
bool vis[maxn];
void u_table() {
	int N = maxn - 10;
	u[1] = 1; g[1] = 0;
	for(int i = 2; i <= N; i++) {
		if(!vis[i]) prime[++cnt] = i, u[i] = -1, g[i] = 1;
		for(int j = 1; j <= cnt && (LL)prime[j] * (LL)i <= (LL)N; j++)
			if(i % prime[j]) vis[i*prime[j]] = 1, u[i*prime[j]] = -u[i], g[i*prime[j]] = u[i] - g[i];
			else{ vis[i*prime[j]] = 1, u[i*prime[j]] = 0, g[i*prime[j]] = u[i]; break; }
	}
	for(int i = 1; i <= N; i++) sum[i] = sum[i-1] + (LL)g[i];
	return ;
}

int main() {
	u_table();
	T = read();
	
	while(T--) {
		n = read(); m = read();
		if(n > m) swap(n, m);
		int p = 1;
		LL ans = 0;
		for(; p <= n;) {
			int np = p;
			p = min(n / (n / np), m / (m / np));
			ans += (sum[p] - sum[np-1]) * (LL)(n / np) * (LL)(m / np);
			p++;
		}
		printf("%lld\n", ans);
	}
	
	return 0;
}