网站毕设,个人微信公众号怎么做微网站,主机屋免费服务器,有电脑网站怎样建手机号码题意#xff1a;给定K个气球#xff0c;然后n层楼的高度#xff0c;求确定气球的硬度#xff08;站在多高能摔破#xff09; 思路#xff1a;递推。dp#xff08;i#xff0c;j#xff09;表示最优#xff0c;那么即dp#xff08;i-1#xff0c;j-1#xff09;1最…题意给定K个气球然后n层楼的高度求确定气球的硬度站在多高能摔破 思路递推。dpij表示最优那么即dpi-1j-11最优如果K层没有破则把K1看成1层继续。得到转移方程dpijkdp(i,j-1)dp(i-1,j-1)dp(i,j-1); code #include iostream
#include cstdio
#include cmath
#include algorithm
#include cstring
#include sstream
#include string
#include vector
#include list
#include queue
#include stack
#include map
#include set
#include bitsetusing namespace std;typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;const int INF9999999;
const int inf-INF;
const int N125;
const int M2005;
const int mod1000000007;
const double piacos(-1.0);#define cls(x,c) memset(x,c,sizeof(x))
#define ft(i,s,n) for (int is;in;i)
#define lson l,m,rt1
#define rson m1,r,rt1|1
#define lrt rt1
#define rrt rt1|1
#define middle int m(rl)1
#define lowbit(x) (x-x)
#define pii pairint,int
#define mk make_pair
#define IN freopen(in.txt,r,stdin);
#define OUT freopen(out.txt,w,stdout);int k,ans;
ll n,dp[N][N];
int main()
{while (~scanf(%d%lld,k,n),k){cls(dp,0);kmin(k,63);ans-1;ft(i,1,63) ft(j,1,63)dp[i][j]dp[i-1][j-1]1dp[i][j-1];ft(i,1,63)if (dp[k][i]n) {ansi;break;}if(ans-1) printf(%d\n,ans);else puts(More than 63 trials needed.);}
}