C经典算法之数字拆解

#include <stdio.h> 
#include <stdlib.h> 
#define NUM 10    //  要拆解的数字 
#define DEBUG 0 

int main(void) { 
    int table[NUM][NUM/2+1] = {0}; // 动态规画表格 
    int count = 0; 
    int result = 0; 
    int i, j, k; 

    printf("数字拆解\n"); 
    printf("3 = 2+1 = 1+1+1 所以3有三种拆法\n"); 
    printf("4 = 3 + 1 = 2 + 2 = 2 + 1 + 1 = 1 + 1 + 1 + 1");   
    printf("共五种\n"); 
    printf("5 = 4 + 1 = 3 + 2 = 3 + 1 + 1");
    printf(" = 2 + 2 + 1 = 2 + 1 + 1 + 1 = 1 + 1 +1 +1 +1");
    printf("共七种\n"); 
    printf("依此类推，求 %d 有几种拆法？", NUM); 

    // 初始化 
    for(i = 0; i < NUM; i++){ 
        table[i][0] = 1;  // 任何数以0以下的数拆解必只有1种 
        table[i][1] = 1;  // 任何数以1以下的数拆解必只有1种 
    }        

    // 动态规划 
    for(i = 2; i <= NUM; i++){ 
       for(j = 2; j <= i; j++){ 
            if(i + j > NUM) // 大于 NUM