1sting

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.
InputThe 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.
      OutputThe 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
自己找规律可得为Fibonacci数列，但递归到已为大位数运算，long long __int64皆不可以，最好的办法为开数组

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=;
int a[][maxn];
int main()
{
  int n,i,j,count,T;
  for(i=;i<=;i++)
  {
    for(j=;j<=;j++)
    {
      a[i][j]=;
    }
  }
  a[][]=;
  a[][]=;
  for(i=;i<=;i++)
  {
    for(j=;j<=;j++)
    {
      a[i][j]=a[i][j]+a[i-][j]+a[i-][j];
      if(a[i][j]>=)
      {
        a[i][j]=a[i][j]-;
        a[i][j+]=a[i][j+]+;
      }
    }
  }
  cin>>T;
  while(T--)
  {
    char b[];
    cin>>b;
    n=strlen(b);
    for(i=;i>=;i--)
    {
      if(a[n][i]!=)
      {
        count=i;
        break;
      }
    }
    for(i=count;i>=;i--)
    {
      cout<<a[n][i];
    }
    cout<<endl;
  }
  return ;
}