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=1;
for (ll i=0; i<k; i++){
if (a[i]>1){
a[i+1]+=a[i]/2;
a[i]%=2;
}
ans*=a[i]+1;
}
return ans*(a[60]+1);
}
# | 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... |