#include "biscuits.h"
#include <bits/stdc++.h>
#define ll long long
#define se second
#define fi first
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<ll,ll> pii;
typedef pair<pii,pii> ipii;
const int MAXN = 200;
const int MAXA = 5e4+10;
const int SQRT = 300;
const ll INF = 1e18+10;
const int MOD = 1e9+7;
const int LOG = 20;
void chmn(auto &a, auto b){ a = min(a, b); }
void chmx(auto &a, auto b){ a = max(a, b); }
ll x, a[MAXN], s[MAXN];
unordered_map<ll,ll> dp;
vector<ll> vec;
ll f(ll val){
if(val <= 0) return 0;
if(val == 1) return 1;
if(dp[val] != 0) return dp[val];
vec.pb(val);
ll bit = (ll)(log2l(val-1)), low = (1ll<<bit);
// cout << val << ' '<< bit<<" val\n";
dp[val] = f(low) + f(min(val, 1+s[bit]/x) - low);
// cout << val << ' ' << dp[val] << " way\n";
return dp[val];
}
long long count_tastiness(long long X, std::vector<long long> A) {
x = X;
for(int i=0; i<=60; i++){
a[i] = (i>=A.size() ? 0 : A[i]);
s[i] = 0;
}
for(int i=0; i<=60; i++){
if(i != 0) s[i] = s[i-1];
s[i] += a[i] * (1ll<<i);
}
// cout << " pp\n";
ll ANS = f(INF);
for(auto i : vec) dp[i] = 0;
vec.clear();
return ANS;
}
