hdu1297 Children’s Queue

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

java.math包中的BigInteger类可以提供任意精度的整数运算。此题为大数加法运算，用java进行大数运算刚刚好~
解题思路：
一、若第n位为男生，则有children[n-1]种方法
二、若第n位为女生，则第n-1为也必须为女生：
1，若前children[n-2]合法，则最后再加两个女生也合法，则有children[n-2]种方法；
2，若前children[n-2]不合法，只有children[n-4]+男+女+女女 是合法队列，则有children[n-4]种方法.

import java.math.*;
import java.util.*;
 public class Main {
	 public static void main(String args[]) {
		 BigInteger children[]=new BigInteger[1005];
		 children[0]=new BigInteger("1");
		 children[1]=new BigInteger("1");
		 children[2]=new BigInteger("2");
		 children[3]=new BigInteger("4");
		 for(int i=4;i<=1000;i++)
		 {
			 children[i]=children[i-1].add(children[i-2]).add(children[i-4]);
		 }
		 Scanner cin=new Scanner(System.in);
		 while(cin.hasNext())
		 {
			 int m=cin.nextInt();
			 System.out.println(children[m]);
		 }
	 }
}