组合数（隔板法）+ 高精度

解题思路:
组合数（隔板法）+ 高精度

参考代码:

#include <iostream>

#include <cstring>

#include <algorithm>

#include <queue>

using namespace std;

typedef long long LL;

const int N = 1005, M = 110, K = 150;

int n, m;

int c[N][M][K];

void add(int c[], int a[], int b[])

{

static int tmp[K];

memset(tmp, 0, sizeof tmp);

int t = 0;

for(int i = 0; i < K; i ++ )

{

t += a[i] + b[i];

tmp[i] = t % 10;

t /= 10;

}

memcpy(c, tmp, sizeof tmp);

}

void init()

{

for(int i = 0; i < N; i ++ )

for(int j = 0; j <= min(i, m - 1); j ++ )

if(!j) c[i][j][0] = 1;

else add(c[i][j], c[i - 1][j - 1], c[i - 1][j]);

}

int qmi(int k, int a)

{

int res = 1;

while(k)

{

if(k & 1) res = res * (LL)a % 1000;

a = a * (LL)a % 1000;

k >>= 1;

}

return res;

}

int main(){

cin >> m >> n;

init();

int x = qmi(n, n);

int idx = K;

while(!c[x - 1][m - 1][idx]) idx --;

for(int i = idx; i >= 0; i -- ) cout << c[x - 1][m - 1][i];

return 0;

}