hdu 5201 容斥原理+组合数取模

The Monkey King

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 207    Accepted Submission(s): 64

Problem Description

As everyone known, The Monkey King is Son Goku. He and his offspring live in Mountain of Flowers and Fruits. One day, his sons get n peaches. And there are m monkeys (including GoKu), they are numbered from 1 to m , GoKu’s number is 1. GoKu wants to distribute these peaches to themselves. Since GoKu is the King, so he must get the most peach. GoKu wants to know how many different ways he can distribute these peaches. For example n=2, m=3, there is only one way to distribute these peach: 2 0 0.

When given n and m , you are expected to calculate how many different ways GoKu can distribute these peaches. Answer may be very large, output the answer modular 1000000007 instead.

 

Input

There are multiple test cases. In the first line of the input file there is an integer T indicates the number of test cases.

In the next T lines, each line contains n and m which is mentioned above.

[Technical Specification]

All input items are integers.

1≤T≤25

1≤n,m≤100000

 

Output

For each case，the output should occupies exactly one line.

See the sample for more details.

 

Sample Input

  
  

   
   2
2 2
3 5
  
  

 

Sample Output

 
 

  
  1
5


  
  

   
   

    
    Hint
   
   
For the second case, there are five ways. They are
2 1 0 0 0
2 0 1 0 0
2 0 0 1 0
2 0 0 0 1
3 0 0 0 0
   
   
#include <iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int mxn=200020;
const int mod=1000000007;
#define LL long long
LL fac[mxn], nfac[mxn];

LL qpow(LL x, int k) {
    LL ret = 1;
    while(k) {
        if(k & 1) ret = ret * x % mod;
        x = x * x % mod;
        k >>= 1;
    }
    return ret;
}
void init() {
    fac[0] = fac[1] = nfac[0] = nfac[1] = 1;
    for(int i = 2; i < mxn; ++i) {
        fac[i] = fac[i-1] * i % mod;
        nfac[i] = qpow(fac[i], mod - 2);
    }
}
int n, m;

LL C(int x, int y) {
    return fac[x] * nfac[y] % mod * nfac[x-y] % mod;
}
LL f(int r, int k) {
    return C(r + k - 1, r);
}
LL calc(LL x) {
    LL ret = 0;
    for(int k = 0; k<=m-1&&(k + 1) * x <= n; ++k) {
        LL t = C(m - 1, k) * f(n - (k + 1) * x, m - 1) % mod;
        if(k & 1)
            ret = ((ret - t) % mod + mod) % mod;
        else
            ret = (ret + t) % mod;
    }
    return ret;
}
int main() {
    init();
    int cas;
    scanf("%d", &cas);
    while(cas--) {
        scanf("%d%d", &n, &m);
        if(m == 1) {
            printf("%d\n", 1);
            continue;
        }
        int t = n / m;
        if(n % m == 0) ++t;
        else if(n % m != 1) t += 2;
        LL ans = 0;
        for(int i = max(1, t); i <= n; ++i) {
            ans = (ans + calc(i)) % mod;
        }
        printf("%I64d\n", ans);
    }
    return 0;
}