#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 65;
int n;
long long x;
long long a[maxn];
unordered_map<long long, long long> dp[maxn];
long long f(int pos, long long carry)
{
if (pos == n)
{
return carry / x + 1;
}
if (dp[pos].find(carry) != dp[pos].end())
{
return dp[pos][carry];
}
long long curr = carry + a[pos];
long long ans = f(pos + 1, curr / 2);
if (curr >= x)
{
ans += f(pos + 1, (curr - x) / 2);
}
return dp[pos][carry] = ans;
}
long long count_tastiness(long long X, vector<long long> arr)
{
n = arr.size();
x = X;
for (int i = 0; i < n; ++i)
{
a[i] = arr[i];
dp[i].clear();
}
return f(0, 0);
}
/*
1
3 3
5 2 1
1
3 2
2 1 2
2
3 3
5 2 1
3 2
2 1 2
*/
