1sting

E - 1sting

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

Submit Status

Description

You will be given a string which only contains ‘1’; You can merge two adjacent ‘1’ to be ‘2’, or leave the ‘1’ there. Surly, you may get many different results. For example, given 1111 , you can get 1111, 121, 112,211,22. Now, your work is to find the total number of result you can get.

 

Input

The first line is a number n refers to the number of test cases. Then n lines follows, each line has a string made up of ‘1’ . The maximum length of the sequence is 200.

 

Output

The output contain n lines, each line output the number of result you can get .

 

Sample Input

     
     

      
       3
1
11
11111 
     
     

 

Sample Output

     
     

      
       1
2
8 
     
     

 



斐波那契数列，已超过longlong最大存储，改用字符串存储。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;

int main()
{
    char s[2000];
    int T,n;
    cin>>T;
    char a[204][1000];
    strcpy(a[1],"1");strcpy(a[2],"2");
    for(int i=3;i<=200;i++)
    {
        int j,p,m,n;
        m=strlen(a[i-1])-1,n=strlen(a[i-2])-1;
        for( j=0,p=0;m>=0||n>=0;m--,n--)
        {
            if(m>=0&&n>=0) a[i][j++]=a[i-1][m]+a[i-2][n]-'0'+p;
            else if(m>=0&&n<0) a[i][j++]=a[i-1][m]+p;
            else if(m<0&&n>=0) a[i][j++]=a[i-2][n]+p;
            if(a[i][j-1]>'9') a[i][j-1]-=10,p=1;
            else p=0;
        }
        if(p) a[i][j]='1',a[i][j+1]='\0';
        else a[i][j]='\0';

        for(int k=0;k<strlen(a[i])/2;k++)
        {
            int m;
            m=a[i][k],a[i][k]=a[i][strlen(a[i])-1-k],a[i][strlen(a[i])-1-k]=m;
        }
    }
    getchar();
    while(T--)
    {
        int m,n;
        cin>>s;
        n=strlen(s);
        puts(a[n]);
    }
}

---