HDUOJ--1865 1string

1sting

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2372    Accepted Submission(s): 947

Problem 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

 

 

Author

z.jt

 

 

Source

http://acm.hdu.edu.cn/showproblem.php?pid=1865

 

Recommend

lcy

 简单大数题....

代码：

#include<iostream>
#include<string>
#define maxn 50
#define  len 200
using namespace std;
int arr[len][maxn+1]={{1},{1}};
int main()
{
    int i,j,s,c,t;
    string n ;
    for(i=2;i<=len;i++)
    {
        for(c=j=0;j<=maxn;j++)
        {
          s=arr[i-1][j]+arr[i-2][j]+c;
          arr[i][j]=s%10;
          c=(s-arr[i][j])/10;
        }
    }
    cin>>t;
    while(t--)
    {
        cin>>n;
        for(i=maxn;arr[n.size()][i]==0;i--);
        for(j=i;j>=0;j--)
        {
            printf("%d",arr[n.size()][j]);
        }
        puts("");
    }
return 0;
}