HDU 5226 Tom and matrix

Problem Description

Tom was on the way home from school. He saw a matrix in the sky. He found that if we numbered rows and columns of the matrix from 0, then,
ai,j=Cji

if i < j,  ai,j=0

Tom suddenly had an idea. He wanted to know the sum of the numbers in some rectangles. Tom needed to go home quickly, so he wouldn't solve this problem by himself. Now he wants you to help him.
Because the number may be very large, output the answer to the problem modulo a prime p.

 

Input

Multi test cases(about 8). Each case occupies only one line, contains five integers,  x1、y1、x2、y2、p.x1≤x2≤105,y1≤y2≤105,2≤p≤109 .

You should calculate  ∑x2i=x1∑y2j=y1ai,j  mod p

 

Output

For each case, print one line, the answer to the problem modulo p.

 

Sample Input

  
  

   
   0 0 1 1 7
1 1 2 2 13
1 0 2 1 2
  
  

 

Sample Output

  
  

   
   3
4

   
   
1
   
   
卢卡斯定理和乘法逆元。
   
   


   
   

   
   
#include<cstdio>
#include<cmath>
#include<queue>
#include<map>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 100005;
long long a[maxn], b[maxn], X1, X2, Y1, Y2, P, ans;
int n;

long long inv(long long x, long long m)
{
	if (x == 1) return x;
	return inv(m % x, m)*(m - m / x) % m;
}

long long C(int x, int y)
{
	if (x > y) return 0;
	return (a[y] * b[x]) % P * b[y - x] % P;
}

long long c(int x, int y)
{
	if (x > y) return 0;
	if (y >= P) return C(x % P, y % P)*c(x / P, y / P) % P;
	else return C(x, y);
}

int main()
{
	while (cin >> X1 >> Y1 >> X2 >> Y2 >> P)
	{
		a[0] = b[0] = 1;
		for (int i = 1; i <= min(X2 + 1, P - 1); i++)
		{
			a[i] = (a[i - 1] * i) % P;
			b[i] = inv(a[i], P);
		}
		ans = 0;
		for (int i = Y1; i <= Y2; i++)
		{
			(ans += c(i + 1, X2 + 1) - c(i + 1, X1)) %= P;
		}
		(ans += P) %= P;
		cout << ans << endl;
	}
	return 0;
}