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 <bits/stdc++.h>
#include "biscuits.h"
using namespace std;
#define ll long long
ll count_tastiness(ll x, vector<ll> a) {
vector<ll> D(62, 1);
a.resize(62);
for (int i = 1; i < 62; i++) {
a[i] = (a[i] << i) + a[i-1];
ll n = INT_MAX;
for (int j = i - 1; j > -1; j--) {
n = min(n, a[j]);
if (x <= (n >> j)) D[i] += D[j], n -= (x << j);
}
}
return D.back();
}
# | 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... |