Not Equal Rectangle

AtCoder

IDarc140_e

Time2000ms

Memory256MB

Difficulty—

We have a grid with $N \times M$ squares. You will fill every square with an integer between $1$ and $25$ (inclusive). Let $a_{i,j}$ be the integer to be written in the square at the $i$\-th row from the top and $j$\-th column from the left. Find a way to fill the squares to satisfy the condition below. It can be proved that, under the Constraints of this problem, such a way always exists. * For any integers $1\leq x_1 < x_2\leq N,1\leq y_1 < y_2 \leq M$, it must not be the case that $a_{x_1,y_1},a_{x_1,y_2},a_{x_2,y_1},a_{x_2,y_2}$ are all equal. ## Constraints * $2 \leq N , M \leq 500$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $M$ [samples]

Samples

Input #1

2 3

Output #1

1 1 1
1 2 3

$(x_1,x_2,y_1,y_2)$ can be one of $(1,2,1,2),(1,2,2,3),(1,2,1,3)$.
For any of them, the numbers written in the squares are not all equal, so this output satisfies the condition.

API Response (JSON)

{
  "problem": {
    "name": "Not Equal Rectangle",
    "description": {
      "content": "We have a grid with $N \\times M$ squares. You will fill every square with an integer between $1$ and $25$ (inclusive). Let $a_{i,j}$ be the integer to be written in the square at the $i$\\-th row from ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "arc140_e"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We have a grid with $N \\times M$ squares. You will fill every square with an integer between $1$ and $25$ (inclusive). Let $a_{i,j}$ be the integer to be written in the square at the $i$\\-th row from ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments