URAL1009 K-based Numbers

Description
Let’s consider K-based numbers, containing exactly N digits. We define a number to be valid if its K-based notation doesn’t contain two successive zeros. For example:
1010230 is a valid 7-digit number;
1000198 is not a valid number;
0001235 is not a 7-digit number, it is a 4-digit number.
Given two numbers N and K, you are to calculate an amount of valid K based numbers, containing N digits.
You may assume that 2 ≤ K ≤ 10; N ≥ 2; N + K ≤ 18.
Input
The numbers N and K in decimal notation separated by the line break.
Output
The result in decimal notation.
Sample Input
input
2 10
output
90

简单动态规划题，用a，b 数组分别记录结尾不为0以及为0的种数即可。

#include <iostream>
#include <cstdio>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long LL;
int a[20],b[20];
int solve(int n,int k)
{
    a[1]=k-1;
    b[1]=0;
    for(int i=2;i<=n;i++){
        a[i]=(a[i-1]+b[i-1])*(k-1);
        b[i]=a[i-1];
    }
    return a[n]+b[n];
}

int main()
{
    int n,k;
    while(~scanf("%d%d",&n,&k)){
        printf("%d\n",solve(n,k));
    }
    return 0;
}