# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967537 | lanaskarica | Zagonetka (COI18_zagonetka) | C++14 | 1 ms | 452 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;
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
const int MAXN = 110;
int n, a, p[MAXN];
int pro(int br, int idx) {
if (idx == 0) return br + 1;
else return br - 1;
}
void isprobaj(int i, int j, int idx) {
int br = 1, d;
if (idx == 1) br = n;
for (int z = 1; z <= n; z++) {
if (z != i && z != j) {cout << br << " "; br = pro(br, idx); continue;}
if (z == i) {d = br; br = pro(br, idx); cout << br << " "; br = pro(br, idx);}
else {cout << d << " ";}
}
cout << endl;
}
void rjesi(int idx) {
bool bl = 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... |