1009. K-based Numbers
Time limit: 1.0 second
Memory limit: 64 MB
Memory limit: 64 MB
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
Ndigits.
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 | output |
---|---|
2 10 | 90 |
Accepted:
/****
DP
对与k进制,每一位上的数字为:0,1,...k-1.
对于n位的k进制数字,第一位不能是0,因此,第一位有k-1种选择,
题目要求的是,不能出现连续的0,
对于n位数字,一种可能是n-1位的数字是满足他条件的,那n位数字
一定也满足条件;
另一种可能是,n-1位数字是0,那n-2位的数字一定满足条件时,n位的
数字才会满足条件.
所以,设dp[j][k]是j进制下,k位数字满足有效条件的数字个数。
dp[j][k]=(i-1)*(dp[j][k-1]+dp[j][k-2]);
初始化,对于只有一位和两位的数字,需要对其初始化,作为初始值。
****/
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAX = 20;
long long dp[MAX][MAX];
int n,k;
void DP()
{
for(int i=2; i<=18; i++)
{
dp[i][1] = i-1;
dp[i][2] = (i-1)*i;
}
for(int i=2; i<=10; i++)
for(int k=3; k<=18; k++)
dp[i][k] = (i-1)*(dp[i][k-1] + dp[i][k-2]);
}
int main()
{
DP();
while(scanf("%d%d",&n,&k)!=EOF)
{
printf("%lld\n",dp[k][n]);
}
return 0;
}