题目地址:http://poj.org/problem?id=1664
思路:大神地址:http://www.cnblogs.com/dongsheng/archive/2012/08/15/2640468.html
AC代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long LL;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
int dp[15][15];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int m,n;
scanf("%d%d",&m,&n);
for(int i=1; i<=m; i++)
dp[i][1] = dp[1][i] = 1;
for(int i=2; i<=m; i++)
{
for(int j=1; j<=n; j++)
{
if(i < j)
dp[i][j] = dp[i][i];
else if(i == j)
dp[i][j] = dp[i][j-1] + 1;
else if(i > j)
dp[i][j] = dp[i][j-1] + dp[i-j][j];
}
}
printf("%d\n",dp[m][n]);
}
return 0;
}