UVa 10934-dropping Water Balloons (DP)

Give the n The same balloon, k Floors, ask at least a few experiments can know how many balloons from the top of the drop will not explode.
Use d[i][J] Represents the use i A ball, an experiment. J The maximum number of floors that can be determined, for each trial split and non-explosive two cases of discussion:
1, burst, transferred to d [I?1][J ?1]+1 , with 1 balls and an experimental opportunity.
2, no explosion, the current test layer of the previous layer as the 1th layer continues to test, transferred to d [I][J ?1] 。
To derive the transfer equation d [I][J ]=d [I?1][J ?1]+1+d [I][J ?1] 。
Long time ago To do the problem, specific ideas see purple Book.

#include <cstdio>#include <cstring>#include <algorithm>using namespace STD;typedef unsigned Long LongULL; ULL d[ the][ $],k,n;intMain () { for(intI=1;i< the; ++i) for(intj=1;j< $; ++j) d[i][j]=d[i-1][j-1]+1+d[i][j-1]; while(~scanf("%llu%llu", &k,&n) &&k) {intAns =0; for(intI= -; i>=0;-I.)if(d[k][i]<n) {ans=i+1; Break; }if(ans<= the)printf("%d\n", ans);Else puts("More than trials needed."); }return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

UVa 10934-dropping Water Balloons (DP)