网上都说是DP结果写了个递归,其实就是个简单的DFS,要解一个最优解才可能用上DP。不喜欢递归可以用栈模拟递归。
#pragma warning(disable:4996)
#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define N 1005
int Solve(int cur,int max,int num)
{
if (num == 0) return 1;
if (num < 0) return 0;
if (cur > max) return 0;
return Solve(cur + 1, max, num) + Solve(cur + 1, max, num - cur);
}
int main()
{
#ifdef local
freopen("data.txt", "r", stdin);
#endif
int n, m;
scanf("%d%d", &n, &m);
cout << Solve(1, n, m) << endl;
}