# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
390690 | AdOjis485 | Packing Biscuits (IOI20_biscuits) | C++17 | 1097 ms | 340 KiB |
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 int long long
using namespace std;
int count_tastiness(int x, vector<int> a)
{
int ans = 0;
for(int i = 0; i <= 1e5; i ++)
{
vector<int> a2 = a;
bool poss = true;
int i2 = i;
int j = 0;
while(i2 > 0)
{
if(i2 % 2 == 1)
{
if(a2[j] < x)
{
poss = false;
break;
}
a2[j] -= x;
}
if(j + 1 == a2.size()) a2.push_back(0);
a2[j + 1] += a2[j] / 2;
i2 /= 2;
j ++;
}
ans += poss;
}
return ans;
}
Compilation message (stderr)
# | 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... |