【组合数+思维】HDU6143 Killer Names

Killer Names  HDU6143

> Galen Marek, codenamed Starkiller, was a male Human apprentice of the Sith Lord Darth Vader. A powerful Force-user who lived during the era of the Galactic Empire, Marek originated from the Wookiee home planet of Kashyyyk as the sole offspring of two Jedi Knights—Mallie and Kento Marek—who deserted the Jedi Order during the Clone Wars. Following the death of his mother, the young Marek's father was killed in battle by Darth Vader. Though only a child, Marek possessed an exceptionally strong connection to the Force that the Dark Lord of the Sith sought to exploit.
> 
> When Marek died in 2 BBY, shortly after the formation of the Alliance, Vader endeavored to recreate his disciple by utilizing the cloning technologies of the planet Kamino. The accelerated cloning process—an enhanced version of the Kaminoan method which allowed for a rapid growth rate within its subjects—was initially imperfect and many clones were too unstable to take Marek's place as the Dark Lord's new apprentice. After months of failure, one particular clone impressed Vader enough for him to hope that this version might become the first success. But as with the others, he inherited Marek's power and skills at the cost of receiving his emotions as well, a side effect of memory flashes used in the training process. 
> 
> — Wookieepedia 

Darth Vader is finally able to stably clone the most powerful soilder in the galaxy: the Starkiller. It is the time of the final strike to destroy the Jedi remnants hidden in every corner of the galaxy. 

However, as the clone army is growing, giving them names becomes a trouble. A clone of Starkiller will be given a two-word name, a first name and a last name. Both the first name and the last name have exactly nn characters, while each character is chosen from an alphabet of size mm. It appears that there are m2nm2n possible names to be used. 

Though the clone process succeeded, the moods of Starkiller clones seem not quite stable. Once an unsatisfactory name is given, a clone will become unstable and will try to fight against his own master. A name is safe if and only if no character appears in both the first name and the last name. 

Since no two clones can share a name, Darth Vader would like to know the maximum number of clones he is able to create. 

Input

The First line of the input contains an integer TT (T≤10T≤10), denoting the number of test cases. 

Each test case contains two integers nn and mm (1≤n,m≤20001≤n,m≤2000).

Output

For each test case, output one line containing the maximum number of clones Vader can create. 

Output the answer  mod 109+7 mod 109+7 

Sample Input

2
3 2
2 3

Sample Output

2 
18

给你n,m(1<=n,m<=2000)
长度为2n的方格涂m种颜色，问你有多少种涂法
要求前n个格子用过的颜色不能用在后面的格子中
所以前n个格子只能有1-(m-1)种颜色可以涂
前n个格子用i种颜色涂的方案数是C(m,i)
用这确定的i种颜色涂前n个格子的方案数是data[i]=i^n-[j从1到i-1 求和]C(i,j)*data[j]
那么用剩下的m-i种颜色涂后面的n个格子的方案数是(m-i)^n
所以总方案数就是ans=求和(i从1到m-1)C(m,i)*data[i]*(m-i)^n

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
ll C[2005][2005];
ll data[2005];
void init()
{
    C[0][0]=1;
    for(int i=1;i<=2000;i++)
    {
        C[i][0]=C[i][i]=1;
        for(int j=1;j<i;j++)
        {
            C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
        }
    }
}

ll quickpow(ll a,ll b)
{
    ll ret=1;
    while(b)
    {
        if(b%2)
            ret=ret*a%mod;
        a=a*a%mod;
        b/=2;
    }
    return ret%mod;
}


int main()
{
    init();
    int T;
    scanf("%d",&T);
    while(T--)
    {
        ll n,m;
        scanf("%lld%lld",&n,&m);
        ll ans=0;
        memset(data,0,sizeof(data));
        for(ll i=1;i<=m-1;i++)
        {
            data[i]=quickpow(i,n);
            for(int j=1;j<=i-1;j++)
            {
                data[i]=((data[i]-C[i][j]*data[j]%mod)+mod)%mod; //因为有减，小心变负数
            }
            ll k=C[m][i]*data[i]%mod*quickpow(m-i,n)%mod;
            k%=mod;
            ans=(ans+k)%mod;
        }
        printf("%lld\n",ans%mod);
    }

    return 0;
}


/*
10
67 6
837539088
234 3
943927946
42 234
624484632
200 200
127323342
2000 2000
138625375

*/