#include <unordered_map>
#include <iostream>
#include <vector>
#include <bitset>
#include <algorithm>
int res = 0;
int f(int apple, int plate){
if(plate > apple) return f(apple, apple);
if(apple == 0) return 1;
if(plate == 0) return 0;
return f(apple, plate - 1) + f(apple - plate, plate); //全部为空+至少一个盘子为空
}
using namespace std;
int main(){
int m, n;
scanf("%d,%d", &m, &n);
cout<<f(m, n)<<endl;
return 0;
}
分糖果
最新推荐文章于 2024-05-20 11:49:08 发布