hdu1865 1 sting(大数)

1sting

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

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

2008杭电集训队选拔赛——热身赛  

#include<stdio.h>
#include<string.h>
#define N 211
#define M 33
int ans[N][M],len[N];
void init()
{
	int i,l;
	memset(len,0,sizeof(len));
	memset(ans,0,sizeof(ans));
	len[1]=len[2]=1;
	ans[1][0]=1;
	ans[2][0]=2;
	for(i=3;i<=200;i++)
	{
		for(l=0;l<len[i-1];l++)
		{
			ans[i][l]+=ans[i-1][l]+ans[i-2][l];
			ans[i][l+1]+=ans[i][l]/1000000;
			ans[i][l]%=1000000;
		}
		len[i]=len[i-1];
		if(ans[i][len[i]]) len[i]++;
	}
}
int main()
{
	init();
	int T,L,l;
	char str[211];
	scanf("%d",&T);
	while(T--)
	{
		scanf("%s",str);
		L=strlen(str);
		printf("%d",ans[L][len[L]-1]);
		for(l=len[L]-2;l>=0;l--) printf("%06d",ans[L][l]);
		printf("\n");
	}
	return 0;
}