UVa 10450 - World Cup Noise

【UVa 10450 - World Cup Noise】的更多相关文章

UVa 10450 - World Cup Noise

题目:构造一个01串,使得当中的1不相邻,问长度为n的串有多少中. 分析:数学,递推数列. 设长度为n的串有n个.则有递推关系:f(n)= f(n-1)+ f(n-2): 长度为n的结束可能是0或者1: 假设结束是0.则前面是0或者是1都能够所以是f(n-1). 假设结束是1,则前面的必定是0,则更前面的任意,所以是f(n-2): 这显然是Fib的递推公式,f(n)= Fib(n+1). 说明:用long long防止溢出. #include <iostream> #include <c…

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 t…

POJ-1953 World Cup Noise（线性动规）

World Cup Noise Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 16374 Accepted: 8097 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…

POJ 1953 World Cup Noise

World Cup Noise Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 14397 Accepted: 7129 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 t…

poj 1953 World Cup Noise (dp)

World Cup Noise Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 16774 Accepted: 8243 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 t…

POJ 1953 World Cup Noise（递推）

https://vjudge.net/problem/POJ-1953 题意:输入一个n,这n位数只由0和1组成,并且不能两个1相邻.计算共有多少种排列方法. 思路:递推题. 首先a[1]=2,a[2]=3是显而易见的,接下来计算分析到第n位时的排列方法数,如果第n-1位数为1,那么第n位只能为0,那么此时有g[n-1]种方法(g[n-1]表示第n-1位为1的数量).如果第n-1位为0,那么此时有2*f[n-1]种方法(f[n-1]表示第n-1位为0的数量). 所以,两者相加=g[n-1]+2*…

poj1953 World Cup Noise

http://poj.org/problem?id=1953 题目大意:给定一个正整数n,确定该长度的不同吟唱模式的数量,即确定不包含相邻1的n位序列的数目.例如,对于n = 3,答案是5 (序列000,001,010,100,101是可以接受的,而011,110,111不是).输入第一行包含场景的数量.对于每个场景,在一行中,您将得到一个小于45的正整数.每个场景的输出从包含“Scenario #i:”的一行开始,其中i是从1开始的场景的数量.然后打印一行包含没有相邻1的n位序列的序列.用空行…