This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "biscuits.h"
#include <iostream>
#define ll long long
#define ff first
#define ss second
#define ln "\n"
#define pll pair<ll, ll>
using namespace std;
long long count_tastiness(long long x, vector<long long> _a) {
vector<ll> a=_a;
a.resize(61);
ll k=60;
ll ans=0;
for (ll i=0; i<=100000/x; i++){
vector<ll> an=a;
bool pos=1;
for (ll j=0; j<k; j++){
if ((1ll<<j)&i){
if (an[j]>=x){
an[j+1]+=(an[j]-x)/2;
}else{
pos=0;
}
}else{
an[j+1]+=an[j]/2;
}
}
if (pos) {
// cout << i << " ";
ans++;
}
}
// cout << ln;
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |