Dropping water balloons - UVa 10934 dp

Problem A: Dropping water balloons

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 kidentical 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.

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.

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

Output for sample input

14
21
More than 63 trials needed.
61
63

题意：将一个气球从楼上摔下，如果他的硬度是f，那么楼层不大于f时摔不破，大于f时摔破，问k个球，n层楼，至少需要试验几次，保证知道球的硬度。

思路：dp[i][j]表示i个球试验j次可以知道的最高层数，如果只有一个球的话，假设它的硬度是f,那么你需要试验f+1次，如果有多个球的话，dp[i][j]=1+dp[i-1][j-1]+dp[i][j-1]。又因为顶层也摔不破这种情况，所以结果-1。

AC代码如下：

#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
ll dp[110][70];
int main()
{
    int i,j,n,k;
    ll m;
    for(i=0;i<=63;i++)
       dp[1][i+1]=i;
    for(i=2;i<=100;i++)
       for(j=2;j<=64;j++)
          dp[i][j]=1+dp[i-1][j-1]+dp[i][j-1];
    while(~scanf("%d%lld",&n,&m) && n)
    {
        for(i=1;i<=64;i++)
           if(dp[n][i]>=m)
             break;
        if(i<=64)
          printf("%d\n",i-1);
        else
          printf("More than 63 trials needed.\n");
    }
}