K-based Numbers (SDUT 2062)

K-based Numbers

Time Limit: 1000MS Memory limit: 65536K

题目描述

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:
(1)1010230 is a valid 7-digit number;
(2)1000198 is not a valid number;
(3)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.

输入

The numbers N and K in decimal notation separated by the line break.

输出

The result in decimal notation.

示例输入

2 10

示例输出

90

提示

来源

示例程序

#include <stdio.h>
int main()
{
    int f[31];
    int n,k,i;
    while(~scanf("%d %d",&n,&k))
    {
        if(n==1)
        {
            printf("%d\n",k);
            break;
        }
        f[1]=k-1;
        f[2]=(k-1)*k;
        for(i=3;i<=n;i++)
            {
                f[i]=(k-1)*(f[i-1]+f[i-2]);
            }
        printf("%d\n",f[n]);
    }
    return 0;
}