代码过不了一点,总是 Wrong_answer,怎么改代码过不了一点,总是 Wrong_answer,怎么写(C++代码)
注意时间限制和空间限制
HANOI07 - Building the Tower
题面翻译
题目描述
在一个玩具盒中有N个立方体,它有1个单位高度,宽度是高度的两倍。老师组织了一个塔楼游戏。这座塔是由立方体建造的。塔的高度为H(H水平)。塔的底部包含M立方体;对于所有以上的水平,每个都必须包含多个立方体,这些立方体正好小于或大于其正下方的立方体的数量。你的任务是确定那里有多少个不同的塔。如果至少有一个数字i(1<i=h),则两个塔被认为是不同的,因此一个塔的第i个水平包含不同数量的立方体到另一个塔的第i个水平。
输入格式:
输入文件的第一行是整数T(0<T<1002),T为测试用例的个数。在一行中的每个测试用例中,该行包含三个正数N、H和M(N<=32767,H<=60,M<=10)。
输出格式:
在每个测试用例中,用一条线写下可以建立的不同塔的总数。
输入输出样例
输入样例#1:
2
7 3 2
22 5 4
输出样例#1:
2
10
PS:在第一个测试样例中,所有的塔都是2-1-2,2-3-2。
感谢@silenceabu 提供的翻译
题目描述
There are N cubes in a toy box which has 1-unit height, the width is double the height. The teacher organizes a tower-building game. The tower is built by the cubes. The height of the tower is H (h levels). The bottom of the tower contains M cubes; and for all above level, each must contains a number of cubes which is exactly 1 less than or greater than the number of cubes of the level right below it. Your task is to determine how many different towers can be there. Two towers are considered different if there is at least one number i (1< i <=H) so that the i'th level of one tower contains a different number of cubes to the i'th level of the other tower.
输入格式
The first line of input file is the integer number t ( 0 < t < 1002 ) , the number of test cases . Each test case in one line , the line contains three positive number N, H and M (N <= 32767, H<=60, M<=10).
输出格式
With each test case , write in one line , the total of different towers that can be founded.
样例 #1
样例输入 #1
2
7 3 2
22 5 4
样例输出 #1
2
10
(* In the first test case , all the towers are : 2-1-2 , 2-3-2 . *)
时间限制
349ms
内存限制
1.46GB