zoukankan      html  css  js  c++  java
  • Poj 1953 World Cup Noise之解题报告

                                                                                                                        World Cup Noise

    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 16369   Accepted: 8095

    Description

    Background
    "KO-RE-A, KO-RE-A" shout 54.000 happy football fans after their team has reached the semifinals of the FIFA World Cup in their home country. But although their excitement is real, the Korean people are still very organized by nature. For example, they have organized huge trumpets (that sound like blowing a ship's horn) to support their team playing on the field. The fans want to keep the level of noise constant throughout the match.
    The trumpets are operated by compressed gas. However, if you blow the trumpet for 2 seconds without stopping it will break. So when the trumpet makes noise, everything is okay, but in a pause of the trumpet,the fans must chant "KO-RE-A"!
    Before the match, a group of fans gathers and decides on a chanting pattern. The pattern is a sequence of 0's and 1's which is interpreted in the following way: If the pattern shows a 1, the trumpet is blown. If it shows a 0, the fans chant "KO-RE-A". To ensure that the trumpet will not break, the pattern is not allowed to have two consecutive 1's in it.
    Problem
    Given a positive integer n, determine the number of different chanting patterns of this length, i.e., determine the number of n-bit sequences that contain no adjacent 1's. For example, for n = 3 the answer is 5 (sequences 000, 001, 010, 100, 101 are acceptable while 011, 110, 111 are not).

    Input

    The first line contains the number of scenarios.
    For each scenario, you are given a single positive integer less than 45 on a line by itself.

    Output

    The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the number of n-bit sequences which have no adjacent 1's. Terminate the output for the scenario with a blank line.

    Sample Input

    2
    3
    1

    Sample Output

    Scenario #1:
    5
    
    Scenario #2:
    2

       

    看到这题马上想到的就是斐波那契数列;

    但是在做这题的时候一定要记得输出格式;

    代码:

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<algorithm>
     4 
     5 using namespace std;
     6 
     7 const int maxn = 50;
     8 int choice[maxn];
     9 
    10 int main(void)
    11 {
    12     int T,n;
    13     choice[1] = 2;
    14     choice[2] = 3;
    15     for(int i=3;i<=45;++i)
    16        choice[i] = choice[i-1]+choice[i-2];
    17     scanf("%d",&T);
    18     int cas = 1;
    19     while(T--)
    20     {
    21         scanf("%d",&n);
    22         printf("Scenario #%d:
    ",cas++);
    23         cout<<choice[n]<<endl;
    24         cout<<endl;
    25     }
    26     
    27     return 0;
    28 }
  • 相关阅读:
    AD用户移除所属组
    Mysql中文乱码问题完美解决方案
    将sqllite3数据库迁移到mysql
    检查远端服务器端口是否打开
    远程桌面卡
    不同平台的线程并发接口对比
    stm32之中断配置
    stm32之CMSIS标准、库目录、GPIO
    stm32 中断几个库函数实现过程分析
    Tree命令使用
  • 原文地址:https://www.cnblogs.com/Bincoder/p/5072051.html
Copyright © 2011-2022 走看看