URAL 1009 K-based Numbers

题目：Click here

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int M = 3e5+3;

int n, k;
int dp[11][20][2];  // dp[i][j][k]表示i进制下j位数以k结尾的个数(k=0表示以0结尾；k=1表示不以0结尾)
int main()  {
    for( int i=2; i<=10; i++ )  {   
        dp[i][1][0] = 0;
        dp[i][1][1] = i-1;
        for( int j=2; j<=18-i; j++ )    {
            dp[i][j][0] = dp[i][j-1][1];
            dp[i][j][1] = (dp[i][j-1][0]+dp[i][j-1][1])*(i-1);   
        }
    }
    while( ~scanf("%d%d", &n, &k ) )   {
        printf("%d\n", dp[k][n][0]+dp[k][n][1] );
    }
    return 0;
}