Ural 1009 K-based Numbers

1009. K-based Numbers

Time limit: 0.5 second
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   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 output
2
10
90
Problem Source: USU Championship 1997

代码:

#include 
   
   
    
    
#include 
    
    
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         #include 
        
          #include 
         
           #include 
          
            #include 
           
             #include 
            
              #include 
             
               #include 
              
                #include 
               
                 #include 
                
                  #include 
                 
                   #include 
                  
                    #include 
                   
                     #include 
                    
                      #define pi acos(-1.0) #define maxn (10000 + 5) #define mod 1000000007 #define INF 1e20 #define Lowbit(x) (x & (-x)) using namespace std; typedef long long int LLI; LLI re[maxn][maxn]; //re[i][j]表示i进制中以非0结尾的长度为j的符合条件的数字都多少, //则re[i][j] = re[i][j - 1] * (i - 1) + re[i][j - 2] * (i - 1); //re[i][0] = 0,re[i][1] = i - 1 int main() { // freopen("in.txt","r",stdin); // freopen("out.txt","w",stdout); for(int i = 0; i <= 20; i ++) { re[i][0] = 0; re[i][1] = i - 1; } for(int i = 2; i <= 10; i ++) { for(int j = 2; j <= 20; j ++) { re[i][j] = (re[i][j - 1] + re[i][j - 2]) * (i - 1); } } int n,k; scanf("%d%d",&n,&k); printf("%lld\n",re[k][n] + re[k][n - 1]); return 0; } 
                     
                    
                   
                  
                 
                
               
              
             
            
           
          
         
       
      
      
     
     
   
   

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值