1,2,5,10元零钱组合成n元方案数

int nums_change_combine(int n) {
    int changes[] = {1, 2, 5, 10};
    int dp[4][n + 1];

    for (int i = 0; i < 4; ++i) {
        for (int j = 0; j <= n; ++j) {
            if (i == 0)dp[i][j] = 1;
            else {
                dp[i][j] = dp[i - 1][j];
                if (j - changes[i] >= 0)dp[i][j] += dp[i][j - changes[i]];
            }
        }
    }
    return dp[3][n];
}