hdoj--1865 1sting

1sting

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

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
  
  
  
  

   
   同样是大数斐波那契数列
  
  
  
  

   
   代码如下：

  
  
  
  

   
   
#include<stdio.h>
#include<string.h>
int a[210][110];
void fib()
{
	int i,j,s,c;
	a[1][0]=1;a[2][0]=2;
	for(i=3;i<=200;i++)
	{
		c=0;
		for(j=0;j<=101;j++)
		{
			s=a[i-1][j]+a[i-2][j]+c;
			a[i][j]=s%10;
			c=s/10;
		}
	}
}
int main()
{
	fib();
	int n,len,i;
	char str[210];
	scanf("%d",&n);
	while(n--)
	{
		getchar();
		scanf("%s",str);
		len=strlen(str);
		for(i=100;i>=0;i--)
		{
			if(a[len][i])
			   break;
		}
		for(;i>=0;i--)
		{
			printf("%d",a[len][i]);
		}
		printf("\n");
	}
	return 0;
}