# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173747 | Just_Solve_The_Problem | "The Lyuboyn" code (IZhO19_lyuboyn) | C++11 | 112 ms | 44716 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>
#define ll long long
using namespace std;
int n, k, t;
vector <int> tran;
int val(string &s) {
int res = 0;
for (int i = 0; i < s.size(); i++) {
res += ((s[i] - '0') << i);
}
return res;
}
string rev(int x) {
string res;
for (int i = 0; i < n; i++) {
res += (x % 2 + '0');
x /= 2;
}
return res;
}
int used[1 << 18];
int cnt = 0;
vector <int> vec;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |