POJ1953 World Cup Noise

时间：2015-02-24 20:59:34 阅读：220 评论：0 收藏：0 [点我收藏+]

标签：

这题纯暴力会超时，只需简单推一下递推公式即可，其实就是一个斐波拉契数列。

World Cup Noise

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 15937		Accepted: 7861

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

Source

TUD Programming Contest 2002, Darmstadt, Germany

 1 //oimonster
 2 #include<cstdio>
 3 #include<cstdlib>
 4 #include<iostream>
 5 using namespace std;
 6 int a[101];
 7 int main(){
 8     int i,j,n,k;
 9     scanf("%d",&n);
10     a[0]=0;
11     a[1]=2;
12     a[2]=3;
13     for(i=3;i<=45;i++){
14         a[i]=a[i-1]+a[i-2];
15     }
16     for(i=1;i<=n;i++){
17         scanf("%d",&k);
18         printf("Scenario #%d:\n",i);
19         printf("%d\n",a[k]);
20         printf("\n");
21     }
22     return 0;
23 }

View Code

POJ1953 World Cup Noise

标签：

原文地址：http://www.cnblogs.com/oimonster/p/4298913.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行