找至少k瓶子,
那么很容易想到,合并成最少的瓶子,就是找找小于等于n的最少的2的多少次方,边找边减。
如果在k之内减为0, 输出0;
否则输出最后一个减的值于剩余值的差即为所求。
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=10007;
int a[32]={1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,262144,524288,
1048576,2097152,4194304,8388608,16777216,33554432,67108864,134217728,268435456,536870912};
int main(){
int T,n,k,i,j;
cin>>T;
while(T--){
cin>>n>>k;
if(k>=n) {printf("0\n");continue;}
int t=n;
for(i=1;i<=k;++i){
for(j=29;j>=0;--j){
if(a[j]<=t) break;
//else if(a[j]< t) break;
}
t-=a[j];if(t==0) break;
}//printf("%d %d~~~",t,i);
if(i<k) {printf("0\n");continue;}
if(t==0&&i==k){printf("0\n");continue;}
else printf("%d\n",a[j]-t);
}
return 0;
}
/**************************************************************
Problem: 1228
User: zoro
Language: C++
Result: Accepted
Time:0 ms
Memory:1696 kb
****************************************************************/
Any