URAL1009——DP——K-based Numbers

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    long long dp[200];
    int n,k;
    while(~scanf("%d%d",&n,&k)){
        dp[1] = k - 1;
        dp[2] = k*(k-1);
        for(int i = 3; i <= n ; i ++)
            dp[i] = (k-1)*(dp[i-1] + dp[i-2]);
        printf("%lld\n",dp[n]);
    }
    return 0;
}