面试题 43 n 个骰子的点数

int g_maxValue = ;
void printfProbability(int number)
{    

    if(number < ) return;

    int * p[];
    p[] = new int[number * g_maxValue + ];
    p[] = new int[number * g_maxValue + ];

    memset(p[], , sizeof(int) *(number * g_maxValue + ));
    memset(p[], , sizeof(int) *(number * g_maxValue + ));

    int flag = ;

    for(int i = ; i<= g_maxValue ; ++i)
        p[flag][i] = ;

    for(int k = ; k <= g_maxValue; ++k){

        for(int j = ; j< k; ++j)
            p[-falg][j] = ;

        for(int i = k; i <= g_maxValue * k ;++i){
            p[-flag][i] =
            for(int j = ; j <= i && j <= g_maxValue ;++j)
                {
                    p[-flag][i] += p[flag][i-j];
                }

        }
        flag = -flag;
    }

    double total = pow((double)g_maxValue, number);
    for(int i = number; i<= number *g_maxValue ;++i)
    {
        double ratio = (double)p[k][i]/total;
        printf("%d : %e\n", i, ratio);
    }

    delete [] p[];
    delete [] p[];
}

类似青蛙跳台阶的问题