【2018多校HDU - 6390 GuGuFishtion】（莫比乌斯反演+欧拉函数+推公式）

http://acm.hdu.edu.cn/showproblem.php?pid=6390

题意：

其中:

1≤m,n≤1,000,0001≤m,n≤1,000,000

max(m,n)<p≤1,000,000,007max⁡(m,n)<p≤1,000,000,007

并保证p为质数

分析:

#pragma warning(disable:4996)
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<double, int>pdi;
typedef long long ll;
#define CLR(a,b) memset(a,b,sizeof(a))
#define _for(i, a, b) for (int i = a; i < b; ++i)
//const int mod = (int)1e9 + 7;
const long double eps = 1e-10;
const int maxn = 1000005;
const int INF = 0x3f3f3f3f;

ll a[maxn];
ll inv[maxn];
ll mu[maxn];
ll v[maxn];
ll eular[maxn];
ll  mod;
int n, m;

void EULAR() {
	CLR(eular, 0);
	eular[1] = 1;
	for (int i = 2; i < maxn; i++) {
		if (!eular[i]) {
			for (int j = i; j < maxn; j += i) {
				if (!eular[j]) {
					eular[j] = j;
				}
				eular[j] = eular[j] / i * (i - 1);
			}
		}
	}
	mu[1] = 1;
	for (int i = 1; i<maxn; i++)
		for (int j = 2 * i; j<maxn; j += i)
		{
			mu[j] -= mu[i];
		}
}

ll get(int n, int m) {
	ll ans = 0;
	for (int i = 1; i <= min(n, m); i++) {
		ans += mu[i] *(n / i) *( m / i);
		ans %= mod;
	}
	return ans;
}

void init() {
	inv[1] = 1;
	for (int i = 2; i <= min(n,m); i++) {
		inv[i] = (mod - mod / i)*inv[mod%i] % mod;
	}
	for (int i = 1; i <= min(n,m); i++) {
		a[i] = (i*inv[eular[i]]) % mod;
	}
}

int main() {
	EULAR();
	int t;
	scanf("%d", &t);
	while (t--) {
		scanf("%d%d%lld", &m, &n, &mod);
		init();
		ll ans = 0;
		for (int i = 1; i <= min(n, m); i++) {
			ans +=(ll) a[i] * get(n / i, m / i);
			ans %= mod;
		}
		printf("%lld\n", ans);
	}
}