例如：n = 3;
dp[3] =
1, 2, 3 + (1, 2, 3 + 0, 1, 2, 3); k*dp[2];
+
10, 20, 30 + 1, 2, 3; k*dp[1];
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[15];
int main(){
int n, k;
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("%d\n",dp[n]);
return 0;
}
