桶球问题

N个鸡蛋分到M个篮子里(N>M),不能有空篮子，对于任意不大于于N的数，保证有几个篮子的鸡蛋数和等于此数，编程实现输入N，M两个数，输出所有分鸡蛋的方法

void combine(int rem, int curr, vector<int> &vec, int m) {
    if (rem ==0 && m ==0) {
        for(int i  = 0; i < vec.size(); ++i)
            cout<< vec[i]<<" ";
        cout<<endl;
        return;
    }

    if (rem <= 0 || m <= 0)
        return;

    if (rem >= m*curr) {
        vec.push_back(curr);
        combine(rem - curr, curr, vec, m-1);
        vec.pop_back();
    }

    if (rem >= (curr + 1)*m)
        combine(rem, curr +1 ,vec, m);
}



int main()
{
    vector<int> vec;
    combine(10,1,vec,4);
    return 0;

}