题解 | #放苹果# 一楼牛逼，C++实现

#include<bits/stdc++.h>
using namespace std;
int f(int m,int n)
{
    if(m==0||m==1||n==1)
        return 1;
    if(n>m)
    return f(m,m);
    return f(m,n-1)+f(m-n,n);
}
int main()
{
    int m,n,count;
    while(cin>>m>>n)
    {
        count=f(m,n);
        cout<<count<<endl;
    }
}