codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1783B.md (1457B)


      1 Source: https://codeforces.com/problemset/problem/1783/B
      2 
      3 B. Matrix of Differences
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 For a square matrix of integers of size $n \times n$, let's define its beauty as follows: for each pair of side-adjacent elements $x$ and $y$, write out the number $|x-y|$, and then find the number of different numbers among them.
     22 
     23 For example, for the matrix $\begin{pmatrix} 1 & 3\\ 4 & 2 \end{pmatrix}$ the numbers we consider are $|1-3|=2$, $|1-4|=3$, $|3-2|=1$ and $|4-2|=2$; there are $3$ different numbers among them ($2$, $3$ and $1$), which means that its beauty is equal to $3$.
     24 
     25 You are given an integer $n$. You have to find a matrix of size $n \times n$, where each integer from $1$ to $n^2$ occurs exactly once, such that its beauty is the maximum possible among all such matrices.
     26 
     27 Input
     28 
     29 The first line contains a single integer $t$ ($1 \le t \le 49$) – the number of test cases.
     30 
     31 The first (and only) line of each test case contains a single integer $n$ ($2 \le n \le 50$).
     32 
     33 Output
     34 
     35 For each test case, print $n$ rows of $n$ integers — a matrix of integers of size $n \times n$, where each number from $1$ to $n^2$ occurs exactly once, such that its beauty is the maximum possible among all such matrices. If there are multiple answers, print any of them.
     36 
     37 Example
     38 
     39 Input
     40 
     41 ```
     42 2
     43 
     44 2
     45 
     46 3
     47 ```
     48 
     49 Output
     50 
     51 ```
     52 1 3
     53 4 2
     54 1 3 4
     55 9 2 7
     56 5 8 6
     57 ```