#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];
int val[MAXK + 10];
int sum[MAXK + 10][MAXK + 10];
vector<pii> trans[MAXK + 10]; // {minimum #tokens, bit}
long long count_tastiness(long long x, std::vector<long long> _a) {
int k = sz(_a);
memset(a, 0, sizeof(a));
memset(val, 0, sizeof(val));
memset(sum, 0, sizeof(sum));
For(i, 0, k) trans[i].clear();
int sum_all = 0;
For(i, 0, k - 1) {
a[i] = _a[i];
val[i] = a[i] << i;
sum_all += (a[i] << i);
}
For(i, 0, k) {
sum[i][i] = val[i];
For(j, i + 1, k) sum[i][j] = sum[i][j - 1] + val[j];
}
For(b1, 0, k - 1) {
For(b2, b1, k - 1) {
if((1ll << 60) / x < (1ll << b2)) break;
trans[b1].eb(max(0ll, (x << b2) - 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]) >> k) / x + 1;
for(auto &i:trans[hibit]) {
if(i.F > cur) break;
v.eb(i.S + 1, cur + sum[hibit][i.S] - (x << i.S));
}
}
return ans;
}
