Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdio>
- #include <iostream>
- #include <string>
- #define N 10
- using namespace std;
- int board[N][N];
- void dfs(int move, int player) {
- if (player) {
- for (int i = 0; i < 8; i++)
- for (int j = 0; j < 7; j++) {
- if (board[i][j] == 1) {
- board[i][j] = 0;
- if (!j && !board[i][j + 2]) {
- board[i][j + 2] = 1;
- dfs();
- board[i][j + 2] = 0;
- }
- if (!board[i][j + 1]) {
- board[i][j + 1] = 1;
- dfs();
- board[i][j + 1] = 0;
- }
- board[i][j] = 1;
- }
- }
- }
- else {
- }
- }
- int main() {
- freopen("giveaway.in", "r", stdin);
- freopen("giveaway.out", "w", stdout);
- int t;
- cin >> t;
- for (int i = 0; i < t; i++) {
- int n;
- cin >> n;
- for (int i = 0; i <= n; i++) {
- string s;
- cin >> s;
- int x = int(s[0] - 'a'), y = (s[1] - '1');
- board[x][y] = ((i == n) ? 2 : 1);
- }
- }
- dfs(0, 0);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement