暴力DFS！

#include <iostream>
using namespace std;
int m, n;
int res;
void dfs(int t, int start, int state){  //state  已经完成的分身   start下一个分身的值   t剩余的能量
    if(state == n && t == 0)    res ++;
    if(state >= n)   return ;
    for(int i = start; i <= t; i ++ ){
        dfs(t-i, i, state+1);
    }
}
int main(){
    int T;  cin >> T;
    while(T -- ){
        cin >> m >> n;
        res = 0;
        dfs(m, 0, 0);
        cout << res << endl;
    }
    return 0;
}

Dp

#include <iostream>
#include <cstring>
using namespace std;
const int N = 11;
int f[N][N];
int main(){
    int T;  cin >> T;
    while(T -- ){
        int m, n;   cin >> m >> n;
        memset(f, 0, sizeof f);
        f[0][0] = 1;
        for(int i = 0; i <= m; i ++ ){
            for(int j = 1; j <= n; j ++ ){
                f[i][j] = f[i][j-1];
                if(i >= j)  f[i][j] = f[i][j-1] + f[i-j][j];
            }
        }
        cout << f[m][n] << endl;
    }
    return 0;
}