HDOJ 1297 Children’s Queue

版权声明：来自: 码代码的猿猿的AC之路 http://blog.csdn.net/ck_boss https://blog.csdn.net/u012797220/article/details/35860567

JAVA大数....

Children’s Queue

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10390    Accepted Submission(s): 3333

Problem Description

There are many students in PHT School. One day, the headmaster whose name is PigHeader wanted all students stand in a line. He prescribed that girl can not be in single. In other words, either no girl in the queue or more than one girl stands side by side.
The case n=4 (n is the number of children) is like
FFFF, FFFM, MFFF, FFMM, MFFM, MMFF, MMMM
Here F stands for a girl and M stands for a boy. The total number of queue satisfied the headmaster’s needs is 7. Can you make a program to find the total number of queue with n children?

 

Input

There are multiple cases in this problem and ended by the EOF. In each case, there is only one integer n means the number of children (1<=n<=1000)

 

Output

For each test case, there is only one integer means the number of queue satisfied the headmaster’s needs.

 

Sample Input

1
2
3

 

Sample Output

1
2
4

 

Author

SmallBeer (CML)

 

Source

field=problem&key=%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VIII%A3%A9&source=1&searchmode=source" rel="nofollow" style="color:rgb(26,92,200);text-decoration:none;">杭电ACM集训队训练赛（VIII）

 

import java.util.*;
import java.math.*;

public class Main
{
	public static void main(String[] args)
	{
		Scanner cin=new Scanner(System.in);

		BigInteger[] a=new BigInteger[1100];
		a[1]=BigInteger.valueOf(1);
		a[2]=BigInteger.valueOf(2);
		a[3]=BigInteger.valueOf(4);
		a[4]=BigInteger.valueOf(7);
		for(int i=5;i<=1000;i++)
		{
			a[i]=a[i-4].add(a[i-2].add(a[i-1]));
		}

		while(cin.hasNextInt())
		{
			int n=cin.nextInt();
			System.out.println(a[n]);
		}
	}
}