题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1865

1sting

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 4795 Accepted Submission(s): 1800

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杭电集训队选拔赛——热身赛

Recommend

lcy

思路：很明显的斐波那契数列。数据太大，用java实现。

附上AC代码：

import java.util.Scanner;
import java.math.BigInteger;
public class Main {final static int MAXN = 205;public static void main(String[] args) {// TODO Auto-generated method stubBigInteger fib[] = new BigInteger[MAXN];fib[0] = fib[1] = BigInteger.ONE;for (int i=2; i<fib.length; ++i)fib[i] = fib[i-1].add(fib[i-2]);Scanner in = new Scanner(System.in);int T = in.nextInt();while (T-- > 0){String str = in.next();System.out.println(fib[str.length()]);}in.close();}}

HDU 1865 1sting相关推荐

[恢]hdu 1865
2011-12-24 20:04:44 地址:http://acm.hdu.edu.cn/showproblem.php?pid=1865 题意:若干个1,可以选择相邻两个合并成2.问有多少种可能的结 ...
HDU 1865 1string
You will be given a string which only contains '1'; You can merge two adjacent '1' to be '2', or lea ...
[转] HDU 题目分类
转载来自:http://www.cppblog.com/acronix/archive/2010/09/24/127536.aspx 分类一: 基础题:1000.1001.1004.1005.1008 ...
HDU题目分类啊！！！
分类一(详细): 分类二: 基础题:1000.1001.1004.1005.1008.1012.1013.1014.1017.1019.1021.1028.1029.1032.1037.1040.10 ...
HDU题目分类大全【大集合】
基础题: 1000.1001.1004.1005.1008.1012.1013.1014.1017.1019.1021.1028.1029. 1032.1037.1040.1048.1056.105 ...
HDU 5643 King's Game 打表
King's Game 题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=5643 Description In order to remember hi ...
转载：Hdu 题目分类
原址点击基础题:1000.1001.1004.1005.1008.1012.1013.1014.1017.1019.1021.1028.1029. 1032.1037.1040.1048.1056. ...
HDU——1106排序（istringstream的使用、STLvector练习）
排序 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submiss ...
hdu 5438 Ponds 拓扑排序
Ponds Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/contests/contest_showproblem ...

HDU 1865 1sting