c语言代码实现对于大于1的自然数N，可以拆分成若干个大于等于1的自然数之和。 Input 一个大于1的自然数N 1 Output 所有的拆分情况.按由大到小的顺序排列。 Sample Input 6 Sample Output 6=6 6=5+1 6=4+2 6=4+1+1 6=3+3 6=3+2+1 6=3+1+1+1 6=2+2+2 6=2+2+1+1 6=2+1+1+1+1 6=1+1+1+1+1+1

好的，以下是C语言的实现：

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

// 分割n的所有情况
void split_num(int n, int** res, int* returnSize, int** returnColumnSizes) {
    if (n == 1) {
        *returnSize = 1;
        *res = (int*)malloc(sizeof(int));
        (*res)[0] = 1;
        *returnColumnSizes = (int*)malloc(sizeof(int));
        (*returnColumnSizes)[0] = 1;
    } else {
        int max_size = n * n;  // 最多可能有n个n相加
        *res = (int*)malloc(sizeof(int) * max_size);
        *returnColumnSizes = (int*)malloc(sizeof(int) * max_size);
        int idx = 0;
        for (int i = 1; i < n; i++) {
            int* sub_res;
            int sub_size;
            int* sub_column_sizes;
            split_num(i, &sub_res, &sub_size, &sub_column_sizes);
            for (int j = 0; j < sub_size; j++) {
                int sub_length = sub_column_sizes[j];
                int* sub_split = (int*)malloc(sizeof(int) * sub_length);
                for (int k = 0; k < sub_length; k++) {
                    sub_split[k] = sub_res[j * sub_length + k];
                }
                sub_split[sub_length] = n - i;
                int col_size = sub_length + 1;
                (*res)[idx] = sub_length + 1;
                (*returnColumnSizes)[idx] = col_size;
                idx++;
                for (int k = 0; k < sub_length + 1; k++) {
                    (*res)[idx] = sub_split[k];
                    idx++;
                }
                free(sub_split);
            }
            free(sub_res);
            free(sub_column_sizes);
        }
        // 最后加上n本身
        (*res)[idx] = 1;
        (*returnColumnSizes)[idx] = 1;
        idx++;
        (*res)[idx] = n;
        idx++;
        *returnSize = idx;
    }
}

void print_split(int n, int* res, int size, int* column_sizes) {
    for (int i = 0; i < size; i++) {
        printf("%d=", n);
        for (int j = 0; j < column_sizes[i] - 1; j++) {
            printf("%d+", res[i * (n + 1) + j]);
        }
        printf("%d\n", res[i * (n + 1) + column_sizes[i] - 1]);
    }
}

int main() {
    int n;
    scanf("%d", &n);
    int* res;
    int size;
    int* column_sizes;
    split_num(n, &res, &size, &column_sizes);
    // 按照由大到小的顺序排列
    for (int i = 0; i < size - 1; i++) {
        for (int j = i + 1; j < size; j++) {
            int idx_i = i * (n + 1);
            int idx_j = j * (n + 1);
            int sum_i = 0;
            int sum_j = 0;
            for (int k = 0; k < column_sizes[i]; k++) {
                sum_i += res[idx_i + k];
            }
            for (int k = 0; k < column_sizes[j]; k++) {
                sum_j += res[idx_j + k];
            }
            if (sum_i < sum_j) {
                int tmp_size = column_sizes[i];
                column_sizes[i] = column_sizes[j];
                column_sizes[j] = tmp_size;
                for (int k = 0; k < tmp_size; k++) {
                    int tmp = res[idx_i + k];
                    res[idx_i + k] = res[idx_j + k];
                    res[idx_j + k] = tmp;
                }
            }
        }
    }
    print_split(n, res, size, column_sizes);
    free(res);
    free(column_sizes);
    return 0;
}

希望这个代码可以解决你的问题。如果你有其他问题，欢迎随时提出。