This documentation is automatically generated by online-judge-tools/verification-helper
#include "../template.h"
#include "Die.h"
int main() {
}
#line 1 "template.h"
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
// For printing pair, container, etc.
// Copied from https://quangloc99.github.io/2021/07/30/my-CP-debugging-template.html
template<class U, class V> ostream& operator << (ostream& out, const pair<U, V>& p) {
return out << '(' << p.first << ", " << p.second << ')';
}
template<class Con, class = decltype(begin(declval<Con>()))>
typename enable_if<!is_same<Con, string>::value, ostream&>::type
operator << (ostream& out, const Con& con) {
out << '{';
for (auto beg = con.begin(), it = beg; it != con.end(); it++) {
out << (it == beg ? "" : ", ") << *it;
}
return out << '}';
}
template<size_t i, class T> ostream& print_tuple_utils(ostream& out, const T& tup) {
if constexpr(i == tuple_size<T>::value) return out << ")";
else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup);
}
template<class ...U> ostream& operator << (ostream& out, const tuple<U...>& t) {
return print_tuple_utils<0, tuple<U...>>(out, t);
}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long get_rand(long long r) {
return uniform_int_distribution<long long> (0, r-1)(rng);
}
template<typename T>
vector<T> read_vector(int n) {
vector<T> res(n);
for (int& x : res) cin >> x;
return res;
}
void solve();
int main() {
ios::sync_with_stdio(0); cin.tie(0);
solve();
return 0;
}
#line 1 "Misc/Die.h"
const int rotations[6][4] = {
{1, 4, 0, 5}, // left
{1, 5, 0, 4}, // right
{4, 3, 5, 2}, // up
{4, 2, 5, 3}, // down
};
struct Die;
map<int, Die> dieMap;
struct Die {
int arr[6]; /* 0 right, 1 left, 2 forward, 3 backward, 4 top, 5 bottom */
Die(){ REP(i,6) arr[i] = i; }
Die(int cipher) { // 0 -> 23
if (dieMap.empty()) puts("Call openDie(die());"); else (*this) = dieMap[cipher];
}
Die move(int dir) {
Die res = (*this);
int t = res.arr[rotations[dir][0]];
REP(i,3) res.arr[rotations[dir][i]] = res.arr[rotations[dir][i+1]];
res.arr[rotations[dir][3]] = t;
return res;
}
int encrypt() { // 0 -> 23
int res = arr[0] * 4;
FOR(i,3,5) if (arr[i] < arr[2]) res++;
return res;
}
};
void openDie(Die t) {
dieMap[t.encrypt()] = t;
REP(dir,4) if (!dieMap.count(t.move(dir).encrypt())) openDie(t.move(dir));
}
#line 3 "Misc/Die.cpp"
int main() {
}