hdoj1865 1string(大数,打表,大数斐波那契数列)

来源：互联网发布：燕十八php 编辑：程序博客网时间：2024/05/10 17:56

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

311111111

Sample Output

128
代码：
#include<stdio.h>#include<string.h>int a[202][102];void fun(){    int i,j,k;    memset(a,0,sizeof(a));    a[1][0]=1;    a[2][0]=2;    for(i=3;i<=200;i++)    {         k=0;        for(j=0;j<=100;j++)        {            a[i][j]=a[i-1][j]+a[i-2][j]+k;            k=a[i][j]/10;            a[i][j]=a[i][j]%10;        }    }}int main(){    fun();    int n,i,j;    scanf("%d",&n);    while(n--)    {    char b[202];    getchar();    scanf("%s",b);    int p=strlen(b);    for(i=100;i>=0;i--)    {        if(a[p][i]!=0)        break;    }    for( j=i;j>=0;j--)    printf("%d",a[p][j]);    printf("\n");    }    return 0;}

思路：
用二维数组保存数据打表，第一位代表第n个，第二位表示该数的各个位数。最后找到共有多少位，输出结果。

0 0