#include #include #include #include #include #include using Board = std::array, 36>; class xrand { uint64_t x; public: using result_type = uint32_t; static constexpr result_type min() { return std::numeric_limits::min(); } static constexpr result_type max() { return std::numeric_limits::max(); } xrand(uint64_t k) : x(k) {} xrand() : xrand(1) {} result_type operator()() { x ^= x << 9; x ^= x >> 7; return (x * 0x123456789abcdef) >> 32; } }; int calc_score(const Board &board) { std::array, 6> contain_row, contain_col; std::array, 6> count_row, count_col; for (int i = 0; i < 6; i++) { contain_row[i].fill(true); contain_col[i].fill(true); count_row[i].fill(0); count_col[i].fill(0); } for (int row = 0; row < 6; row++) { for (int col = 0; col < 6; col++) { const int idx = 6 * row + col; for (int type = 0; type < 6; type++) { if (board[idx][type] == 0) { contain_row[row][type] = false; contain_col[col][type] = false; } else { count_row[row][type] += board[idx][type]; count_col[col][type] += board[idx][type]; } } } } int s = 0; for (int i = 0; i < 6; i++) { for (int type = 0; type < 6; type++) { if (contain_row[i][type]) { s += count_row[i][type] - 3; } if (contain_col[i][type]) { s += count_col[i][type] - 3; } } } return s; } int main() { xrand rng; std::uniform_int_distribution<> dist(0, 5); Board board; for (int i = 0; i < 36; i++) { board[i].fill(0); } std::array used; used.fill(false); for (int i = 0; i < 35; i++) { std::array dice; dice.fill(0); for (int j = 0; j < 6; j++) { int d; std::cin >> d; d--; dice[d]++; } std::array score; score.fill(0); for (int j = 0; j < 36; j++) { if (used[j]) { score[j]--; continue; } for (int itr = 0; itr < 10000; itr++) { Board board_new = board; board_new[j] = dice; for (int k = 0; k < 36; k++) { if (used[k] or k == j) continue; for (int l = 0; l < 6; l++) { board_new[k][dist(rng)]++; } } score[j] += calc_score(board_new); } } int idx = std::max_element(score.begin(), score.end()) - score.begin(); std::cout << idx / 6 + 1 << ' ' << idx % 6 + 1 << std::endl; used[idx] = true; } return 0; }