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
1 1
11 2
111 3
1111 5
11111 8
111111 13
......................
本题的规律不难发现,关键在于输出采用大数方法输出
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; int a[201][101]={0}; int main () { int n,i,j,k; a[1][100]=1; a[2][100]=2; for (i=3; i<=200; i++) { for (j=100; j>=0; j--) { a[i][j]+=a[i-1][j]+a[i-2][j]; if (a[i][j]>=10) { a[i][j-1]+=a[i][j]/10; a[i][j]=a[i][j]%10; } } } cin>>n; while(n--) { char str[210]; cin>>str; int len=strlen(str); int k; for (j=0; j<=100; j++) if (a[len][j]!=0) break; k=j; for (j=k; j<=100; j++) cout<<a[len][j]; cout<<endl; } return 0; }