# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332114 | pggp | Packing Biscuits (IOI20_biscuits) | C++14 | 1063 ms | 4916 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 <bits/stdc++.h>
using namespace std;
long long count_tastiness(long long x, vector < long long > k){
long long total_tastiness = 0;
long long cur_pow = 1;
for (int i = 0; i < k.size(); ++i)
{
total_tastiness += cur_pow * k[i];
cur_pow *= 2;
}
int ans = 1;
long long k_cur;
for(int y = 1; y <= total_tastiness; y++){
int y_cur = y;
int y_dig = 0;
bool possible = true;
k_cur = k[0];
while(y_cur > 0){
//cout << "y_cur:" << y_cur << endl;
//cout << "k_cur:" << k_cur << endl;
if(y_cur % 2 == 1){
k_cur -= x;
if(k_cur < 0){
possible = false;
}
}
k_cur /= 2;
k_cur += k[y_dig + 1];
y_dig++;
y_cur /= 2;
}
if(possible){
cout << "p: " << y << endl;
}
ans += possible;
}
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... |