Problem UVA1627-Team them up!

Total Submissions:3577  Solved:648

Time Limit: 3000 mSec

Problem Description

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

 

題解：這個題屬於比較經典的動態規劃題，dp(i,j)表示i個水球，做j次實驗能夠測出的最高樓層，考慮第一個水球，將其在第k層扔下，如果炸了，那就說明硬度<k，為了能夠在剩下的i-1個水球和j-1次實驗機會中測出硬度，必須要求k-1<=dp(i-1,j-1),也就是說k最大dp(i-1,j-1)+1,如果沒炸，那麼k+1層相當於新的1層，還有i個球，j-1次機會，能夠測到的樓層自然是dp(i-1,j)，因此加上前面的，就是總共能測得最高的。

 

 1 #include <bits/stdc++.h>
 2 
 3 using namespace std;
 4 
 5 typedef long long LL;
 6 
 7 const int maxn = 100 + 5;
 8 
 9 int k;
10 LL n, dp[maxn][65];
11 
12 LL DP(int k, int i) {
13     if (dp[k][i] > 0) return dp[k][i];
14     if (!k || !i) return dp[k][i] = 0;
15 
16     return dp[k][i] = DP(k - 1, i - 1) + DP(k, i - 1) + 1;
17 }
18 
19 int main()
20 {
21     //freopen("input.txt", "r", stdin);
22     memset(dp, -1, sizeof(dp));
23     while (~scanf("%d%lld", &k, &n) && k) {
24         int i;
25         for (i = 0; i <= 63; i++) {
26             if (DP(k, i) >= n) {
27                 printf("%d\n", i);
28                 break;
29             }
30         }
31         if (i == 64) printf("More than 63 trials needed.\n");
32     }
33     return 0;
34 }