Ural 1081. Binary Lexicographic Sequence

最新推荐文章于 2018-03-28 14:59:01 发布

your_own_name

最新推荐文章于 2018-03-28 14:59:01 发布

阅读量333

点赞数

分类专栏：动态规划文章标签：动态规划

本文链接：https://blog.csdn.net/your_own_name/article/details/52136252

版权

动态规划专栏收录该内容

37 篇文章 0 订阅

订阅专栏

1081. Binary Lexicographic Sequence

Time limit: 0.5 second
Memory limit: 64 MB

Consider all the sequences with length (0 < N < 44), containing only the elements 0 and 1, and no two ones are adjacent (110 is not a valid sequence of length 3, 0101 is a valid sequence of length 4). Write a program which finds the sequence, which is on K-th place (0 < K < 109) in the lexicographically sorted in ascending order collection of the described sequences.

Input

The first line of input contains two positive integers N and K.

Output

Write the found sequence or −1 if the number K is larger then the number of valid sequences.

Sample

input	output
3 1	000

Problem Author: Emil Kelevedzhiev
Problem Source: Winter Mathematical Festival Varna '2001 Informatics Tournament

Difficulty: 256 Printable version Submit solution Discussion (24)

My submissions All submissions (11277) All accepted submissions (4885) Solutions rating (4175)

求字典序下，第k个长度为n的合法字符串(合法字符串满足：只有0和1，且不能有两个1相邻)

打表会发现，长度为n的合法序列一共有Fibonacci[n]个。其中有Fibonacci[n - 1]个是由0开头的(也就是长度为n-1前面的补0)，剩下的是以1开头的。

#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 (101000 + 50) #define mol 1000000009 #define inf 0x3f3f3f3f #define Lowbit(x) (x & (-x)) using namespace std; typedef long long int LLI; LLI fib[maxn]; int main() { // freopen("in.txt","r",stdin); // freopen("out.txt","w",stdout); fib[0] = 1; fib[1] = 2; for(int i = 2; i <= 44; i ++) fib[i] = fib[i - 1] + fib[i - 2]; LLI n,k; scanf("%lld%lld",&n,&k); if(k > fib[n]) printf("-1\n"); else { for(int i = n; i >= 1; i --) { if(k > fib[i - 1]) { printf("1"); k -= fib[i - 1]; } else printf("0"); } printf("\n"); } return 0; } //000 //001 //010 //100 //101