| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1240464 | MuhammadSaram | Packing Biscuits (IOI20_biscuits) | C++20 | 1 ms | 328 KiB |
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long long count_tastiness(long long x, vector<long long> a) {
ll su=0,mn=1e18;
for (int i=0;i<a.size();i++)
{
if (!su && a[i])
mn=(1ll<<i);
su+=(1ll<<i)*a[i];
}
return su/mn+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... | ||||
