K-based Numbers(DP)

最新推荐文章于 2024-08-19 11:24:31 发布

NOTTME

最新推荐文章于 2024-08-19 11:24:31 发布

阅读量598

点赞数

分类专栏：动态规划DP

本文链接：https://blog.csdn.net/immiao/article/details/18791563

版权

动态规划DP 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

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	output
2 10	90

dp[i]表示k进制i位数没有连续两个0的数的个数。

当第i位为0时，有dp[i-2]*(k-1)个，当第i位不为0时，有dp[i-1]*(k-1)个。

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;

int main()
{
	int n,k;
	scanf("%d%d",&n,&k);
	int dp[100];
	dp[1]=k-1;
	dp[2]=(k-1)*k;
	int i;
	for (i=3;i<=n;i++)
		dp[i]=dp[i-2]*(k-1)+dp[i-1]*(k-1);
	printf("%d\n",dp[n]);
}