#include "biscuits.h"
/*
Author of all code: Pedro BIGMAN Dias
Last edit: 15/02/2021
*/
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 500000000LL
#define EPS 0.00000001
#define pi 3.14159
ll mod=1000000007LL;
template<class A=ll>
void Out(vector<A> a) {REP(i,0,a.size()) {cout<<a[i]<<" ";} cout<<endl;}
template<class A=ll>
void In(vector<A> &a, ll N) {A cur; REP(i,0,N) {cin>>cur; a.pb(cur);}}
ll count_tastiness(long long x, vector<ll> a)
{
while(a.size()<60) {a.pb(0LL);}
ll ans=0LL; ll total=100000LL;
vector<ll> needed; vector<ll> ava; REP(i,0,60) {needed.pb(0LL); ava.pb(0LL);}
for(ll y = total/x; y>=0LL; y--)
{
REP(i,0,60) {needed[i]=0LL; ava[i]=a[i];}
ll z = y;
REP(i,0,60) {if(z%2LL!=0LL) {needed[i]=1LL;} z=z/2LL;}
bool ok=true;
for(ll pos = 0;pos<60;pos++)
{
if(needed[pos]==1LL) {if(ava[pos]<x) {ok=false; break;} ava[pos]-=x;}
ava[pos+1]+=(ava[pos]/2LL);
}
if(ok) {ans++;}
}
return ans;
}
