【小米oj】 分糖果

#define mm(a) memset(a,0,sizeof(a));
#define max(x,y) (x)>(y)?(x):(y)
#define min(x,y) (x)<(y)?(x):(y)
#define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,b,a) for(int i=(b);i>=(a);i--)
#include<bits/stdc++.h>
typedef long long ll;
#define PII pair<ll,ll>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAXN=(int)2e5 + 5;
const ll mod=1e9+7;

ll dp[200][200];
int countapples(int m,int n) {
    if(m<0)return 0;
    if(m==0||n==1)return 1;
    if(~dp[m][n])return dp[m][n];
    return dp[m][n]=countapples(m-n,n)+countapples(m,n-1);
}

int main() {
    memset(dp,-1,sizeof(dp));
    int m,n,t;
    long long temp;
    while(~scanf("%d,%d",&m,&n)) {
        temp=countapples(m,n);
        printf("%lld
",temp);
    }
    return 0;
}