寒假集训.K-based Numbers

最新推荐文章于 2020-07-14 15:31:01 发布

骚然勿外

最新推荐文章于 2020-07-14 15:31:01 发布

阅读量552

点赞数 1

分类专栏：刷题人生文章标签： C++ acm 64bit numbers

本文链接：https://blog.csdn.net/a576699534/article/details/43270167

版权

刷题人生专栏收录该内容

49 篇文章 0 订阅

订阅专栏

D - K-based Numbers

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status

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

#include
      
      
       
       
#include 
       
       
        
        
#include 
        
        
         
         
long long dp[20][2];
int main(){
    int n,j;
    while(scanf("%d%d",&n,&j)!=EOF){
        dp[1][0]=0; dp[1][1]=j-1;
        for(int i=2; i<=n; i++){
            dp[i][1]+=(j-1)*(dp[i-1][1]+dp[i-1][0]);
            dp[i][0]=dp[i-1][1];
        }
        printf("%lld\n",dp[n][1]+dp[n][0]);
    }
    return 0;
}