QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#105865 | #1955. Double Rainbow | ckiseki# | WA | 2ms | 3316kb | C++20 | 2.2kb | 2023-05-15 18:44:40 | 2023-05-15 18:44:43 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define orange(s...) orange_(#s, s)
#define debug(s...) debug_(#s, s)
template <typename ...T>
void debug_(const char *s, T ...a) {
cerr << "\e[1;32m(" << s << ") = (";
int cnt = sizeof...(T);
(..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
cerr << "\e[1;32m[ " << s << " ] = [ ";
for (int f = 0; L != R; ++L)
cerr << (f++ ? ", " : "") << *L;
cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define orange(...) safe
#define debug(...) safe
#endif
bool solve(int x, int y) {
set<pair<int, int>> s;
bool good = false;
while (s.emplace(x, y).second) {
if (x == 0 or y == 0) {
good = true;
break;
}
if (x == y) {
good = true;
break;
}
if (x > y) {
y *= 2;
x -= y / 2;
} else {
x *= 2;
y -= x / 2;
}
}
return good;
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
for (int x = 1; x <= 20; ++x) {
for (int y = x; y <= 20; ++y) {
if (not solve(x, y)) cout << x << ' ' << y << '\n';
}
}
return 0;
}
/*
1 2
1 4
1 5
1 6
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 16
1 17
1 18
1 19
1 20
2 3
2 4
2 5
2 7
2 8
2 9
2 10
2 11
2 12
2 13
2 15
2 16
2 17
2 18
2 19
2 20
3 4
3 6
3 7
3 8
3 10
3 11
3 12
3 14
3 15
3 16
3 17
3 18
3 19
3 20
4 5
4 6
4 7
4 8
4 9
4 10
4 11
4 13
4 14
4 15
4 16
4 17
4 18
4 19
4 20
5 6
5 7
5 8
5 9
5 10
5 12
5 13
5 14
5 16
5 17
5 18
5 19
5 20
6 7
6 8
6 9
6 11
6 12
6 13
6 14
6 15
6 16
6 17
6 19
6 20
7 8
7 10
7 11
7 12
7 13
7 14
7 15
7 16
7 17
7 18
7 19
7 20
8 9
8 10
8 11
8 12
8 13
8 14
8 15
8 16
8 17
8 18
8 19
8 20
9 10
9 11
9 12
9 13
9 14
9 16
9 17
9 18
9 19
9 20
10 11
10 12
10 13
10 14
10 15
10 16
10 17
10 18
10 19
10 20
11 12
11 13
11 14
11 15
11 16
11 17
11 18
11 19
11 20
12 13
12 14
12 15
12 16
12 17
12 18
12 19
13 14
13 15
13 16
13 17
13 18
13 20
14 15
14 16
14 17
14 19
14 20
15 16
15 18
15 19
15 20
16 17
16 18
16 19
16 20
17 18
17 19
17 20
18 19
18 20
19 20
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 3316kb
input:
1 1 1
output:
1 2 1 4 1 5 1 6 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 16 1 17 1 18 1 19 1 20 2 3 2 4 2 5 2 7 2 8 2 9 2 10 2 11 2 12 2 13 2 15 2 16 2 17 2 18 2 19 2 20 3 4 3 6 3 7 3 8 3 10 3 11 3 12 3 14 3 15 3 16 3 17 3 18 3 19 3 20 4 5 4 6 4 7 4 8 4 9 4 10 4 11 4 13 4 14 4 15 4 16 4 17 4 18 4 19 4 20 5 6 5 7 5 8 5 9 ...
result:
wrong answer 1st lines differ - expected: '0', found: '1 2'