#include "biscuits.h"
#include <map>
#include <cassert>
#include <algorithm>
using namespace std;
using ll = long long;
const ll INF = 1e18 + 177013;
const int MAXK = 61;
ll sm[MAXK];
map<ll, ll> mp;
ll get_ans(ll mxsm) {
if (mxsm == 0)
return 1;
int i = 0;
int cnt = 0;
while (true) {
i = 0;
while (1ll << (i + 1) <= mxsm)
++i;
if (mxsm <= sm[i]) {
break;
} else {
mxsm = sm[i];
}
assert(++cnt <= 100);
}
if (mxsm == 0)
return 1;
//assert((1ll << i) <= mxsm);
if (mp.find(mxsm) != mp.end())
return mp[mxsm];
ll t = get_ans((1ll << i) - 1) + get_ans(mxsm - (1ll << i));
mp[mxsm] = t;
return t;
}
ll count_tastiness(ll x, vector<ll> a) {
int k = a.size();
for (int i = 0; i < MAXK; ++i)
sm[i] = 0;
for (int i = 0; i < k; ++i)
sm[i] = a[i] << i;
for (int i = 1; i < MAXK; ++i) {
sm[i] += sm[i - 1];
}
for (int i = 0; i < MAXK; ++i) {
sm[i] /= x;
}
for (int i = 1; i < MAXK; ++i) {
assert(sm[i] >= sm[i - 1]);
}
return get_ans(INF);
}
