题解:类似于分苹果,m个苹果n个盘子,分为三种情况,苹果==0||盘子==1,苹果大于等于盘子,苹果小于盘子
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int n,k;
int tmp[5];
int s(int m,int n){
if(m==0||n==1)return 1;
if(m>=n){
return s(m-n, n)+s(m,n-1);
}else{
return s(m,m);
}
}
int main(){
cin>>n>>k;
while(n>=k)n-=k;
n+=k;
cout<<s(n,k)<<endl;
return 0;
}