M个鸡蛋放到N个篮子里，列出所有的组合(Solved in C)

#include <stdio.h>
#include <stdlib.h>

void func(int eggs, int *global_baskets, int start_basket, int baskets, int max_eggs_per_basket)
{
  int i;
  int max_eggs_first_basket;
  int min_eggs_first_basket;

  if (eggs == 0) {
    for (i = 0; i < (start_basket-1); i++) {
      printf("%d ", global_baskets[i]);
    }
    printf("%d\n", global_baskets[start_basket-1]);
  }
  else if (eggs == 1) {
    for (i = 0; i < start_basket; i++) {
      printf("%d ", global_baskets[i]);
    }
    printf("1\n");
  }
  else if (baskets == 1) {
    for (i = 0; i < start_basket; i++) {
      printf("%d ", global_baskets[i]);
    }
    printf("%d\n", eggs);
  }
  else {
    max_eggs_first_basket = (eggs > max_eggs_per_basket)?max_eggs_per_basket:eggs;
    min_eggs_first_basket = (eggs+baskets-1)/baskets;

    for (i = max_eggs_first_basket;i >= min_eggs_first_basket; i--) {
      global_baskets[start_basket] = i;
      func(eggs-i, global_baskets, start_basket+1, baskets-1, i);
    }
  }
}

int main(int argc, char *argv[])
{
  int M = 0;
  int N = 0;
  int *global_baskets = NULL;

  if (argc != 3) {
    printf("Usage: eggs EGGS BASKETS\n");
    return -1;
  }

  M = atoi(argv[1]);
  N = atoi(argv[2]);

  global_baskets = malloc(sizeof(int) * N);

  func(M, global_baskets, 0, N, M);

  free(global_baskets);

  return 0;
}