poj 1953 World Cup Noise
来源:互联网 发布:桂树焉知泰山之高的焉 编辑:程序博客网 时间:2024/04/30 12:21
World Cup Noise
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16529 Accepted: 8168
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).
"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.
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
231
Sample Output
Scenario #1:5Scenario #2:2
Source
TUD Programming Contest 2002, Darmstadt, Germany
递推式为ans[i]=ans[i-1]+ans[i-2];
#include<iostream>#include<string>#include<cstring>#include<algorithm>#include<cstdio>using namespace std;int main(){ int T; int icase=0; long long int ans[46]; ans[1]=2; ans[2]=3; for(int i=3;i<=45;++i) ans[i]=ans[i-1]+ans[i-2]; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); printf("Scenario #%d:\n",++icase); printf("%lld\n\n",ans[n]); } return 0;}
0 0
- poj 1953 World Cup Noise
- POJ 1953 World Cup Noise
- poj 1953 World Cup Noise
- POJ 1953 World Cup Noise
- poj 1953 World Cup Noise
- poj 1953 World Cup Noise
- POJ-1953-World Cup Noise
- poj 1953 World Cup Noise
- POJ 1953 World Cup Noise
- poj 1953:World Cup Noise
- POJ 1953World Cup Noise
- POJ 1953 World Cup Noise
- POJ 1953 World Cup Noise
- POJ 1953 World Cup Noise
- poj 1953 World Cup Noise
- POJ-1953-World Cup Noise
- poj 1953 World Cup Noise
- poj 1953 World Cup Noise DP
- 在线暴力破解工具Hydra
- Hibernate对象状态转化
- LaTeX 简介与安装
- TCP拥塞控制图解(不包括RTO,因为它太简单了)
- 又一次周赛题解
- poj 1953 World Cup Noise
- CSAPP第二次实验 bomb二进制炸弹的破解
- 1031. 查验身份证(15)
- poj1179(区间dp)
- 树的最大独立集(1初步)
- 1032. 挖掘机技术哪家强(20)
- Linux系统分类
- java位运算符
- Java注解(三) 自定义注解与提取注解