公式

1. C(m,n)=C(m,m-n)

2.C(m,n)=C(m-1,n)+C(m-1,n-1)

derangement D(n)= n!(1 - 1/1! + 1/2! - 1/3! + ... + (-1)^n/n!)

= (n-1)(D(n-2) - D(n-1)) Q(n) = D(n) + D(n-1)

求和公式,k =1..n

1.sum( k ) = n(n+1)/2 2. sum( 2k-1 ) = n^2

3. sum( k^2 ) =n(n+1)(2n+1)/6

4. sum((2k-1)^2 ) = n(4n^2-1)/3

5. sum( k^3 ) =(n(n+1)/2)^2

6. sum((2k-1)^3 ) = n^2(2n^2-1)

7. sum( k^4 ) =n(n+1)(2n+1)(3n^2+3n-1)/30

8. sum( k^5 ) =n^2(n+1)^2(2n^2+2n-1)/12

9. sum( k(k+1)) = n(n+1)(n+2)/3

10. sum(k(k+1)(k+2) ) = n(n+1)(n+2)(n+3)/4

12. sum(k(k+1)(k+2)(k+3) ) = n(n+1)(n+2)(n+3)(n+4)/5

(a/b)%mod=a*b^(mod-2)%mod

(a/b)%mod=a%(b*mod)/b%mod

hdu 5894

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <stack>
#include <cctype>
#include <queue>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <climits>
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define fi first
#define se second
#define ping(x,y) ((x-y)*(x-y))
#define mst(x,y) memset(x,y,sizeof(x))
#define mcp(x,y) memcpy(x,y,sizeof(y))
using namespace std;
#define gamma 0.5772156649015328606065120
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define N 1000050
#define maxn 3001
typedef pair<int,int> PII;
typedef long long LL;

int n,m,k,x,y,v;
LL fac[N];
LL ksm(LL a,LL b){
    LL res=1;
    while(b){
        if(b&1)res=res*a%MOD;
        b>>=1;
        a=a*a%MOD;
    }
    return res;
}
LL C(LL n,LL m){
    if(m>n||m<0)return 0;
    LL s1=fac[n],s2=fac[n-m]*fac[m]%MOD;
    return s1*ksm(s2,MOD-2)%MOD;
}
int main(){
    int i,j,group;
    fac[0]=1ll;for(i=1;i<N;++i)fac[i]=fac[i-1]*i%MOD;
    scanf("%d",&group);
    while(group--){
        scanf("%d%d%d",&n,&m,&k);
        if(m==1){printf("%d\n",n);continue;}
        if(n<m*(k+1)){printf("0\n");continue;}
        printf("%lld\n",1ll*C(n-m*k-1,m-1)*n%MOD*ksm(m,MOD-2)%MOD);
    }
    return 0;
}