HDU - 4790 Just Random 容斥

题目链接：https://cn.vjudge.net/problem/HDU-4790

题意：x属于[a, b]，y属于[c, d]，任取x，y，求满足(x + y) mod p = m的概率

题解：大致就应该想到容斥来求，像这样 get(b, d) - get(a - 1, d) - get(c- 1, b) + get(a - 1, c - 1)，比如求[0, x]和[0, y]，先对两个区间取模，ll x1 = x / p, x2 = x % p; x1就是[0,p-1]对应整体的那些数目，每个有x1个，x2就是多出来那些[0, x2]各有一个，对[0, y]一样进行，然后ans = x1 * y1 * p + (x2 + 1) * y1 + x1 * (y2 + 1) + max(0LL, min(m, y2) - max(m - x2, 0LL) + 1) + max(0LL, min(p + m, y2) - max(p + m - x2, 0LL) + 1) ;前3项应该好理解吧，我就简单说一下后面两项，对于[0, x2]和[0, y2] x2+y2只能为m或p+m,所以通过第一个区间限制一下，和第二个区间取一下交集即可

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a, b, c, d, p, m;
ll get(ll x, ll y) {
	if(x < 0 || y < 0) return 0;
	ll x1 = x / p, x2 = x % p;
	ll y1 = y / p, y2 = y % p;
	ll ans = 0;
	ans = x1 * y1 * p + (x2 + 1) * y1 + x1 * (y2 + 1) + max(0LL, min(m, y2) - max(m - x2, 0LL) + 1) + max(0LL, min(p + m, y2) - max(p + m - x2, 0LL) + 1) ;
	return ans;
}
int main() {
	int T, ca = 1;
	ll ans, cnt, d;
	scanf("%d", &T);
	while(T--) {
		scanf("%lld%lld%lld%lld%lld%lld", &a, &b, &c, &d, &p, &m);
		ans = get(b, d) - get(a - 1, d) - get(c- 1, b) + get(a - 1, c - 1);
		cnt = (b - a + 1) * (d - c + 1);
		d = __gcd(ans, cnt);
		ans /= d;
		cnt /= d;
		printf("Case #%d: %lld/%lld\n", ca++, ans, cnt);
	}
	return 0;
}