HDU5226 Tom and matrix题解

题目链接

题目意思

求${\sum }_{i=x1}^{x2}{\sum }_{j=y1}^{y2}{C}_i^j$

推导过程

${\sum }_{i=a}^b{C}_k^i=C_{k+1}^{b+1}-C_{k+1}^a$
证明如图

$\therefore 只需要枚举j，加上预处理阶乘O(n)，即可用O(logn)的时间求出答案$

代码

#include <cctype>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define pk putchar(' ')
#define ph puts("")
typedef long long ll;
template <class T>
void rd(T &x)
{
    x = 0;
    int f = 1;
    char C = getchar();
    while (!isdigit(C)) {if (C == '-') f = -1; C = getchar();}
    while (isdigit(C)) x = (x << 3) + (x << 1) + (C ^ 48), C = getchar();
    x *= f;
}
template <class T>
void pt(T x)
{
    if (x < 0)
        putchar('-'), x = (~x) + 1;
    if (x > 9)
        pt(x / 10);
    putchar(x % 10 ^ 48);
}
const int N = 1e5 + 5;
ll fac[N], inv[N];
ll qkpow(ll a, ll b, ll mod)
{
	ll ans = 1;
	while (b)
	{
		if (b & 1)
			ans = ans * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return ans;
}
void init(ll p)
{
	fac[0] = inv[0] = 1;
	for (int i = 1; i < min(p, 1ll * N); i++)
		fac[i] = fac[i - 1] * i % p;
}
ll C(ll n, ll m, ll p)
{
    if (n < m)
        return 0;
    return fac[n] * qkpow(fac[m], p - 2, p) % p * qkpow(fac[n - m], p - 2, p) % p;
}
ll lucas(ll n, ll m, ll p)
{
    if (m == 0)    
    	return 1;
    return C(n % p, m % p, p) * lucas(n / p, m / p, p) % p;
}
ll x, x2, y, y2, p;
int main()
{
    while (~scanf ("%lld %lld %lld %lld %lld", &x, &y, &x2, &y2, &p))
    {
    	init(p);
    	ll ans = 0;
    	for (ll i = y + 1; i <= y2 + 1; i++)
    		ans = (ans + lucas(x2 + 1, i, p) - lucas(x, i, p) + p) % p;
    	pt(ans), ph;
    }
    return 0;
}

Thanks!