bzoj 1962: 模型王子

呵呵呵呵http://wenku.baidu.com/link?url=o0CPVzuBDLJMt0_7Qph1T7TtdFOzu7O-apIpvaWbIYMz8ZWqBneGqI8LGtLdqpuK5fbQ_v-H01zHwPXDsPrioR5xjCDHjqJn_boYO87ikr_

 #include <bits/stdc++.h>
 #define LL long long
 #define lowbit(x) x&(-x)
 #define inf 0x3f3f3f3f
 using namespace std;
 inline int ra()
 {
     int x=,f=; char ch=getchar();
     while (ch<'' || ch>'') {if (ch=='-') f=-; ch=getchar();}
     while (ch>='' && ch<='') {x=x*+ch-''; ch=getchar();}
     return x*f;
 }
 int n,K;
 int f[][];
 int main(int argc, char const *argv[])
 {
     n=ra(); K=ra();
     for (int i=; ; i++)
     {
         f[i][]=i/;
         for (int j=; j<=K; j++)
             f[i][j]=max(f[i-][j]+f[i-][j-],f[i-][j]+f[i-][j-])+;
         if (f[i][K]>=n) {cout<<i; break;}
     }
     return ;
 }