#include "biscuits.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <cmath>
#include <random>
#include <chrono>
#include <iomanip>
#include <bitset>
using namespace std;
long long count_tastiness(long long x, std::vector<long long> a) {
int k = a.size();
map<long long, long long> mp;
mp[0] = 1;
map<long long, long long> mp2;
for (int i = 0; i < k; i++) {
mp2.clear();
for (auto j : mp) {
long long o = j.first;
long long col = j.second;
mp2[(o + a[i]) / 2] += col;
long long C = o + a[i];
if (C >= x)
{
mp2[(C - x) / 2] += col;
}
}
mp = mp2;
}
long long ans = 0;
for (auto i : mp)
{
ans += i.second;
}
return ans;
}
