hdu6143-（排列组合）

题解:假设放了x个字符在n个位置上的方案数位f[x]那么，f[x] = i^n-c[x][1]f[1]-c[x][2]*f[2]-…..c[x][x-1]*f[x-1]求出所有放满f[1~min(n,m-1)]的方案数，然后答案就是f[1]*c[m][1](m-1)^n+f[2]c[m][2](m-2)^n+……f[min(n,m-1)]c[m][min(n,m-1)](m-min(n,m-1))^n

#include<iostream>
#include<cstring>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const int mx = 2e3+5;
ll c[mx][mx];
ll f[mx];
ll calc(ll x,int n){
    ll ans = 1;
    while(n){
        if(n&1) ans = ans*x%mod;
        x = x*x%mod;
        n/=2;
    }
    return ans;
}
int main(){
    memset(c,0,sizeof(c));
    for(int i = 1; i < mx; i++)
        for(int j = 0; j <= i; j++)
            if(!j||j==i)
                c[i][j] = 1;
            else
                c[i][j] = (c[i-1][j-1]+c[i-1][j])%mod;
    int t,n,m;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&m);
        ll ans = 0;
        for(int i = 1; i <= min(n,m-1); i++){
            f[i] = calc(i,n);
            ll tmp = 0;
            for(int j = 1; j < i; j++)
                tmp = (tmp+c[i][j]*f[j]%mod)%mod;
            f[i] = (f[i]-tmp+mod)%mod;
        }
        for(int i = 1; i <= min(n,m-1); i++)
            ans = (ans+c[m][i]*f[i]%mod*calc(m-i,n))%mod;
        printf("%I64d\n",ans);
    }
    return 0;
}