BNU 13024 . Fi Binary Number 数位dp/fibonacci数列

B. Fi Binary Number

 

 

A Fi-binary number is a number that contains only 0 and 1. It does not contain any leading 0. And also it does not contain 2 consecutive 1. The first few such number are 1, 10, 100, 101, 1000, 1001, 1010, 10000, 10001, 10010, 10100, 10101 and so on. You are given n. You have to calculate the nth Fi-Binary number.

 

Input

Input starts with an integer T (≤ 10000), denoting the number of test cases.

Each case contains an integer n (1 ≤ n ≤ 109).

 

Output

For each case, print the case number and the nth Fi-Binary number

 

Sample Input

Sample Input	Output for Sample Input
4 10 20 30 40	Case 1: 10010 Case 2: 101010 Case 3: 1010001 Case 4: 10001001

题意：给你一个01串满足：没有前置0，任意两个1不能相邻，问你第n个这样的数是多少

题解：这是一种dp思想，  假设最高位是1，那么次高位必须是0，那么有  f[i]=f[i-1]+f[i-2]；

得出来是一个fibonacci数列 打表暴力可求解

///
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll;
#define mem(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,127,sizeof(a))
#define TS printf("111111\n")
#define FOR(i,a,b) for( int i=a;i<=b;i++)
#define FORJ(i,a,b) for(int i=a;i>=b;i--)
#define READ(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define inf 100000
inline ll read()
{
    ll x=,f=;
    char ch=getchar();
    while(ch<''||ch>'')
    {
        if(ch=='-')f=-;
        ch=getchar();
    }
    while(ch>=''&&ch<='')
    {
        x=x*+ch-'';
        ch=getchar();
    }
    return x*f;
}
//****************************************

#define maxn 1111
ll f[maxn],sum[maxn];
void init()
{
    f[]=;
    f[]=;;sum[]=;sum[]=;
    for(int i=;i<=;i++)
        f[i]=f[i-]+f[i-],sum[i]=sum[i-]+f[i-];

}
int main()
{
    init();
    int T=read();
    int oo=;
    while(T--)
    {
         ll n=read();printf ("Case %d: ",oo++);
             bool flag=;
       for(int i=;i>=;i--)
       {
           if(n>sum[i])
           {
               n-=sum[i]+;
               cout<<;
               flag=;
           }
           else if(flag){

             cout<<;
           }
       }cout<<endl;

    }
    return ;
}

fibonacci

还可以这样想：  定义dp[i][p]表示长度i 第i+1为p的方案数，那么这题就是一个数位dp了

///
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll;
#define mem(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,127,sizeof(a))
#define TS printf("111111\n")
#define FOR(i,a,b) for( int i=a;i<=b;i++)
#define FORJ(i,a,b) for(int i=a;i>=b;i--)
#define READ(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define inf 1000000001
inline ll read()
{
    ll x=,f=;
    char ch=getchar();
    while(ch<''||ch>'')
    {
        if(ch=='-')f=-;
        ch=getchar();
    }
    while(ch>=''&&ch<='')
    {
        x=x*+ch-'';
        ch=getchar();
    }
    return x*f;
}
//****************************************

#define maxn 50
ll dp[maxn][];
ll num[maxn];
int dfs(int i,int p)
{
    if(dp[i][p])return dp[i][p];
    if(i<)return ;
    int ret=;
    if(p) ret=dfs(i-,);
    else ret=dfs(i-,)+dfs(i-,);
    dp[i][p]=ret;
    return ret;
}
void get(int n)
{
    bool flag=;
    for(int i=;i>;i--)
    {
        if(n>=num[i])
        {
            n-=num[i];
            cout<<;
            flag=;
        }
        else if(flag)cout<<;
    }
}
int main()
{
    mem(dp);
     for(int i=;i<=;i++)num[i]=dfs(i-,);
     cout<<num[]<<endl;
     //  cout<<dp[1][0]<<endl;
    int T=read();
    int oo=;
    while(T--)
    {
      int   n=read();
        printf("Case %d: ",oo++);
       get(n);cout<<endl;
    }
    return ;
}

数位dp