Children’s Queue

作者: dqvpnrlww 分类: 算法与数据结构 发布时间: 2014-10-25 11:35 阅读: 2,142

Children’s Queue

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



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
 


Sample Output

This article is automatically posted by WP-AutoPost : WordPress自动采集发布插件
如何获取并设置Cookie采集需要登录才能浏览的内容?,WP-AutoPost

如果觉得我的文章对您有用,请随意打赏。您的支持将鼓励我继续创作!

发表评论

电子邮件地址不会被公开。 必填项已用*标注

更多阅读
标签云