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 <bits/stdc++.h>
typedef long long ll;
using namespace std;
long long count_tastiness(long long x, std::vector<long long> a) {
ll k = a.size();
ll sizes = 1; //the case where there are no biscuits in the bag
ll power2 = 1;
for (int i = 0; i < k; i++)
{
sizes += power2*a[i];
power2 *= 2;
}
return sizes;
}
# | 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... |