#include "biscuits.h"
#ifdef NYAOWO
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;
const int MAXK = 60;
int a[MAXK + 10];
vector<pii> trans[MAXK + 10]; // {minimum #tokens, bit}
int sum[MAXK + 10][MAXK + 10];
long long count_tastiness(long long x, std::vector<long long> _a) {
memset(a, 0, sizeof(a));
int k = sz(_a);
int sum_all = 0;
For(i, 0, k - 1) {
a[i] = _a[i];
sum_all += (a[i] << i);
}
For(b1, 0, k - 1) {
sum[b1][b1] = a[b1];
For(b2, b1 + 1, k - 1) sum[b1][b2] = sum[b1][b2 - 1] + (1ll << (b2 - b1));
For(b2, b1, k - 1) {
int need = x << (b2 - b1);
if(need > (1ll << 60)) break;
trans[b1].eb(max(0ll, need - sum[b1][b2]), b2);
}
sort(all(trans[b1]));
}
int ans = 0;
vector<pii> v;
v.eb(0, 0);
while(sz(v)) {
int hibit = v.back().F;
int cur = v.back().S;
v.pop_back();
ans += (((cur + sum[hibit][k - 1]) << hibit) >> k) + 1;
for(auto &i:trans[hibit]) {
if(i.F > cur) break;
v.eb(i.S + 1, (cur + sum[hibit][i.S] - (x << (i.S - hibit))) >> (i.S - hibit + 1));
}
// cerr << owo << " " << cur << "\n";
}
// cerr << "\n";
return ans;
}
