# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398308 | 2021-05-04T06:48:27 Z | Everule | Packing Biscuits (IOI20_biscuits) | C++14 | 0 ms | 0 KB |
#include "biscuits.h" ll count_tastiness(ll x, vector<ll> a){ ll s = 0; int k = a.size(); for(int i=0;i<k;i++) s += a[i] * (1ll<<i); ll ans = 0; for(ll y=0;y<=s/x;y++){ ll sum = 0; for(int i=0;i<60;i++){ if(i < k) sum += a[i] * (1ll<<i); if(y & (1ll<<i)){ sum -= x * (1ll<<i); } if(sum < 0) break; } ans += (sum >= 0); } return ans; }