K-based Numbers

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()
{
	long n,m,k,num,i,j,a[10000];
	while(scanf("%ld%ld",&n,&k)!=EOF)
	{
	a[0]=k-1;;
	a[1]=(k-1)*k;
	for(i=2;i<=n-1;i++)
		a[i]=(a[i-1]+a[i-2])*(k-1);
	printf("%ld\n",a[n-1]);
	}
	return 0;
}