UVA10934 Dropping water balloons【DP】

It’s frosh week, and this year your friends have decided that they would initiate the new computer science students by dropping water balloons on them. They’ve filled up a large crate of identical water balloons, ready for the event. But as fate would have it, the balloons turned out to be rather tough, and can be dropped from a height of several stories without bursting!
So your friends have sought you out for help. They plan to drop the balloons from a tall building on campus, but would like to spend as little effort as possible hauling their balloons up the stairs, so they would like to know the lowest floor from which they can drop the balloons so that they do burst.
You know the building has n floors, and your friends have given you k identical balloons which you may use (and break) during your trials to find their answer. Since you are also lazy, you would like to determine the minimum number of trials you must conduct in order to determine with absolute certainty the lowest floor from which you can drop a balloon so that it bursts (or in the worst case, that the balloons will not burst even when dropped from the top floor). A trial consists of dropping a balloon from a certain floor. If a balloon fails to burst for a trial, you can fetch it and use it again for another trial.
Input
The input consists of a number of test cases, one case per line. The data for one test case consists of two numbers k and n, 1 ≤ k ≤ 100 and a positive n that fits into a 64 bit integer (yes, it’s a very tall building). The last case has k = 0 and should not be processed.
Output
For each case of the input, print one line of output giving the minimum number of trials needed to solve the problem. If more than 63 trials are needed then print ‘More than 63 trials needed.’ instead of the number.
Sample Input
2 100
10 786599
4 786599
60 1844674407370955161
63 9223372036854775807
0 0
Sample Output
14
21
More than 63 trials needed.
61
63

问题链接：UVA10934 Dropping water balloons
问题简述：给定n个气球和大楼的高度，求最少试验几次能测出气球最高在哪一层掉下来不破。
问题分析：经典的DP问题。
dp[i][j]表示用i个气球，测试出j高的楼。
状态转换方程如下：
dp[i][j] = 1
dp[i][j] = dp[i - 1][j - 1] + dp[i][j - 1] + 1
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* UVA10934 Dropping water balloons */#include <bits/stdc++.h>using namespace std;typedef unsigned long long ULL;
const int K = 100, B = 64;
ULL dp[K + 1][B];void init()
{for (int i = 1; i <= K; i++)for (int j = 1; j < B; j++)if (j == 1) dp[i][j] = 1;else dp[i][j] = dp[i - 1][j - 1] + dp[i][j - 1] + 1;
}int main()
{init();int k, i;ULL n;while (~scanf("%d%llu", &k, &n) && k) {for (i = 1; i < B; i++)if (dp[k][i] >= n) break;if (i >= B) puts("More than 63 trials needed.");else printf("%d\n", i);}return 0;
}

UVA10934 Dropping water balloons【DP】相关推荐

UVa 10934 Dropping water balloons：dp（递推）
题目链接:https://vjudge.net/problem/27377/origin 题意: 有一栋n层高的楼,并给你k个水球.在一定高度及以上将水球扔下,水球会摔破:在这个高度以下扔,水球不会摔 ...
【DP】【期望】$P1850$换教室
[DP][期望]$P1850$换教室链接题目描述有 $2n$ 节课程安排在$ n$ 个时间段上.在第 $i$($1 \leq i \leq n$)个时间段上,两节内容相同的课程同 ...
Bailian2760 数字三角形【DP】
2760:数字三角形描述 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (图1) 图1给出了一个数字三角形.从三角形的顶部到底部有很多条不同的路径.对于每条路径,把路径上面的数加起来可 ...
NUC1131 Triangle【DP】
Triangle 时间限制: 1000ms 内存限制: 65536KB 通过次数: 1总提交次数: 1 问题描述图1表示一个数字三角形. 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 ...
LeetCode：完全平方数【279】【DP】
LeetCode:完全平方数[279][DP] 题目描述给定正整数 n,找到若干个完全平方数(比如 1, 4, 9, 16, ...)使得它们的和等于 n.你需要让组成和的完全平方数的个数最少. 示 ...
【DP】序列题解
[DP]序列题解序列题目一个长度为kkk的整数序列bbb 1,bbb 2,-,bkbkbk(1≤bbb 1≤bbb 2≤-≤bkbkbk≤NNN)称为"好序列"当且仅当后一 ...
【Uva 10934】Dropping water balloons
[Link]: [Description] 等价题意: 某人在1..n内选一个数x; 然后让你去猜; 你可以问他是不是在哪个范围里; 每次会告诉你YES或者NO; 问你在最坏的情况下猜出答案需要猜多少 ...
poj 2411 Mondriaan#39;s Dream 【dp】
题目:poj 2411 Mondriaan's Dream 题意:给出一个n*m的矩阵,让你用1*2的矩阵铺满,然后问你最多由多少种不同的方案. 分析:这是一个比較经典的题目.网上各种牛B写法一大堆. ...
BestCoder冠军赛 - 1005 Game 【DP】
[题意] 给出一个set,set中有几个数. 现在给出n个人,环成一圈搞约瑟夫... 开始时从第1号报数,每次从set中随机选出一个数s,等报数到s后,报s的人出圈,其他人继续报数. 最后只剩1人时, ...

UVA10934 Dropping water balloons【DP】

UVA10934 Dropping water balloons【DP】相关推荐

最新文章

热门文章