# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
999309 | crafticat | L-triominoes (CEOI21_ltriominoes) | C++17 | 0 ms | 348 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;
int w, h, k;
vector<bool> getData(int pos) {
vector<bool> exist(w);
int j = 0;
while (pos > 0) {
if (pos % 2) exist[j] = true;
pos /= 2;
}
return exist;
}
int main() {
cin >> w >> h >> k;
for (int i = 0; i < k; ++i) {
int x, y; cin >> x >> y;
}
int pos = pow(2,w) + 1;
cout << "NO";
return 0;
}
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... |