1395B.md (2188B)
1 Source: https://codeforces.com/problemset/problem/1395/B 2 3 B. Boboniu Plays Chess 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 512 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Boboniu likes playing chess with his employees. As we know, no employee can beat the boss in the chess game, so Boboniu has never lost in any round. 22 23 You are a new applicant for his company. Boboniu will test you with the following chess question: 24 25 Consider a $n\times m$ grid (rows are numbered from $1$ to $n$, and columns are numbered from $1$ to $m$). You have a chess piece, and it stands at some cell $(S_x,S_y)$ which is not on the border (i.e. $2 \le S_x \le n-1$ and $2 \le S_y \le m-1$). 26 27 From the cell $(x,y)$, you can move your chess piece to $(x,y')$ ($1\le y'\le m, y' \neq y$) or $(x',y)$ ($1\le x'\le n, x'\neq x$). In other words, the chess piece moves as a rook. From the cell, you can move to any cell on the same row or column. 28 29 Your goal is to visit each cell exactly once. Can you find a solution? 30 31 Note that cells on the path between two adjacent cells in your route are not counted as visited, and it is not required to return to the starting point. 32 33 Input 34 35 The only line of the input contains four integers $n$, $m$, $S_x$ and $S_y$ ($3\le n,m\le 100$, $2 \le S_x \le n-1$, $2 \le S_y \le m-1$) — the number of rows, the number of columns, and the initial position of your chess piece, respectively. 36 37 Output 38 39 You should print $n\cdot m$ lines. 40 41 The $i$-th line should contain two integers $x_i$ and $y_i$ ($1 \leq x_i \leq n$, $1 \leq y_i \leq m$), denoting the $i$-th cell that you visited. You should print exactly $nm$ pairs $(x_i, y_i)$, they should cover all possible pairs $(x_i, y_i)$, such that $1 \leq x_i \leq n$, $1 \leq y_i \leq m$. 42 43 We can show that under these constraints there always exists a solution. If there are multiple answers, print any. 44 45 Examples 46 47 Input 48 49 ``` 50 3 3 2 2 51 ``` 52 53 Output 54 55 ``` 56 2 2 57 1 2 58 1 3 59 2 3 60 3 3 61 3 2 62 3 1 63 2 1 64 1 1 65 ``` 66 67 Input 68 69 ``` 70 3 4 2 2 71 ``` 72 73 Output 74 75 ``` 76 2 2 77 2 1 78 2 3 79 2 4 80 1 4 81 3 4 82 3 3 83 3 2 84 3 1 85 1 1 86 1 2 87 1 3 88 ``` 89 90 Note 91 92 Possible routes for two examples: 93 94 