/*作为一个软件专业的学生，zcy总是对二进制特别感兴趣，有一天他发现了一个有趣的序列：一个长度为N的序列，该序列只含有0或1两个数字，并且该序列不包含连续3个1, 例如N=3时有7种不同序列，分别是000, 001, 010, 011, 100, 101, 110。111包含3个连续的1所以不是。 现在zcy想知道，对于长为n的一个二进制串，有多少满足条件的01串。 Input 第一行是整数t，表示多少个case， 每行有一个数n，表示串的长度(n<=40） Output 对于每组测试数据，先输出"Case x :", x为测试数据的组号。 再输出一个整数, 表示满足条件的串个个数。注意每个case结束后有一个换行.*/

新建 文本文档.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．