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