# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91062 | YottaByte | Bank (IZhO14_bank) | C++14 | 1077 ms | 3204 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 <iostream>
using namespace std;
const int N = 22;
#define ll long long
#define ok puts("OK");
int n, m, a[N], mx;
int b[N], dp[1 << N];
string tr(int a, int b)
{
string res = "";
while(a)
{
res += char(a % b + '0');
a /= b;
}
while(res.size() < m)
{
res += '0';
}
return res;
}
void calc(int mask, int p = 0, int c = 0, int last = 0)
{
//cout << tr( mask, 2 ) << " " << c << endl;
//cout << tr( p, 2 ) << " " << c << endl;
//system("pause");
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... |