Project Euler_Problem 164_Three Consecutive Digital Sum Limit

原题目：

解题思路：动态规划，没什么好说的

代码：

void solve() {
    ll i, j,k,x,y,z,p,q,u,v;
    ll N = 100000000,NN=50000000;
    u = 0;
    
    R[0][0][0] = 1;
    for (i = 1; i <= 20; i++) {
        if (i == 3) {
            printf("\n");
        }
        for (j = 0; j <= 20; j++) {
            if (i == 1 && j == 0)continue;
            for (k = 0; k <= 9; k++) {
                for (x = 0; x <= 9; x++) {
                    if (j + x + k > 9)continue;
                    R[i][x][j] += R[i-1][k][x];
                }
            }
        }
    }

    for (i = 0; i <= 9; i++) {
        for (j = 0; j <= 9; j++) {
            ans1 = ans1 + R[20][i][j];
        }
    }

    printf("%lld\n", ans1);
}