tx+algorithm

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 3e5 + 5;
int n, k;
int main()
{
    while(cin >> n >> k){
        int ans = n;
        vector<int> v;
        v.push_back(n);
        int round = 0;
        while(k > 0){
            int len = v.size();
            int cnt = 0;
            for(int j = 0;j < min(len, k);j++){
                int val = v[len - 1 - j];
                v[len - 1 - j] = val / 2;
                v.push_back((val + 1) / 2);
                cnt++;
            }
            k -= cnt;