pku 1953 -- World Cup Noise (DP)

 

 

http://poj.org/problem?id=1953

 

World Cup NoiseTime Limit: 1000MS Memory Limit: 30000K
Total Submissions: 10772 Accepted: 5331


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

 

 

题意 : 简而言之,一个N位的二进制数,求不出现连续2个1的序列个数

 

 

 

 

// // DP: // ans[i][0] 表示i位最后一位是 0 的解数. // ans[i][1] 表示i位最后一位是 1 的解数. // 若最后一位是 0 ,则解数与ans[i](ans[i][0]+ans[i][1])的解数相同 // 因为添加0不会对前面的序列造成影响 // 若最后一位是1，则前面一位必须是 0 // 所以有 // ans[i][0]=ans[i-1][1]+ans[i-1][0]; // ans[i][1]=ans[i-1][0]; // #include<iostream> using namespace std; int main() { int t,counter=0,ans[50][2],i,n; ans[1][0]=1; ans[1][1]=1; for(i=2;i<=45;i++) { ans[i][0]=ans[i-1][1]+ans[i-1][0]; ans[i][1]=ans[i-1][0]; } scanf("%d",&t); while(t--) { counter++; scanf("%d",&n); printf("Scenario #%d:/n%d/n/n",counter,ans[n][0]+ans[n][1]); } return 0; }

 

 

 

其实这个就是斐波那契数列

 

 

#include <iostream> using namespace std; int ans[50]; int main() { int i,counter=0,t; ans[0]=0;ans[1]=2;ans[2]=3; for(i=3;i<=45;i++) ans[i]=ans[i-1]+ans[i-2]; scanf("%d",&t); while(t--) { counter++; int n; scanf("%d",&n); printf("Scenario #%d:/n%d/n/n",counter,ans[n]); } }