55702023-07-30 18:32:34111Hanoi tornyai variáns (45)cpp14Wrong answer 0/453ms4308 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double

#define pii pair<int, int>

array<vector<int>, 3> v, b;
vector<int> p(20), q(20);
vector<pii> r;

void solve(int n, int i = -1, bool z = true) {
	if (n == 0) {
		return;
	}
	if (z) {
		i = q[n];
	}
	//cout << "task: move " << n << " to " << i+1 << endl;
	if (p[n] == i) {
		solve(n - 1, i, z);
		return;
	}
	for (int j = 0; j < 3; j++) {
		if (p[n] != j && i != j) {
			solve(n - 1, j, false);
			break;
		}
	}
	r.emplace_back(p[n], i);
	p[n] = i;
	solve(n - 1, i, z);
}

void printPattern() {
    cout << "6" << endl;
    cout << "1 3" << endl;
    cout << "1 2" << endl;
    cout << "3 1" << endl;
    cout << "3 2" << endl;
    cout << "1 2" << endl;
    cout << "1 3" << endl;
}

signed main() {
    printPattern();
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/45
1Wrong answer0/03ms1872 KiB
2Wrong answer0/03ms2120 KiB
3Wrong answer0/23ms2328 KiB
4Wrong answer0/22ms2412 KiB
5Wrong answer0/23ms2556 KiB
6Wrong answer0/33ms2708 KiB
7Wrong answer0/22ms2924 KiB
8Wrong answer0/23ms3176 KiB
9Wrong answer0/23ms3392 KiB
10Wrong answer0/22ms3428 KiB
11Wrong answer0/22ms3564 KiB
12Wrong answer0/22ms3676 KiB
13Wrong answer0/22ms3800 KiB
14Wrong answer0/23ms3800 KiB
15Wrong answer0/22ms3852 KiB
16Wrong answer0/22ms3984 KiB
17Wrong answer0/22ms4072 KiB
18Wrong answer0/22ms4064 KiB
19Wrong answer0/32ms4068 KiB
20Wrong answer0/32ms4192 KiB
21Wrong answer0/33ms4188 KiB
22Wrong answer0/32ms4308 KiB