B. Matrix of Differences Educational Codeforces Round 141 (Rated for Div. 2) Problem Solution

This post is all about the solution of the B. Matrix of Differences Educational Codeforces Round 141 (Rated for Div. 2) Problem Solution.

Codeforces

Problem Statement :

Let's define the beauty of a square matrix of integers of size nn as follows: for each pair of side-adjacent elements x and y, write out the number |xy|, and then find the number of different numbers among them.

For instance, for the matrix (1432), the numbers to consider are |13|=2, |14|=3, |32|=1, and |42|=2; there are three distinct numbers among them (2, 3 and 1), implying that its beauty is equal to three.

You have been given the integer n. You must find a matrix of size nn in which each integer from 1 to n2 occurs exactly once and whose beauty is the greatest possible between all such matrices.

Format of Input :

The first line contains a single integer t (1t2000) indicating the number of test cases.

Evey test case is made up of two lines. The first line has a single integer n (2n50). The second line has n integers a1,a2,...,an (1a12an100).

Format of the Output :

A. Make it Beautiful Educational Codeforces Round 141 (Rated for Div. 2) Problem Solution, Click Here

B. Matrix of Differences Educational Codeforces Round 141 (Rated for Div. 2) Problem Solution, Click Here

C. Yet Another Tournament Educational Codeforces Round 141 (Rated for Div. 2) Problem Solution, Click Here

D. Different Arrays Educational Codeforces Round 141 (Rated for Div. 2) Problem Solution, Click Here

E. Game of the Year Educational Codeforces Round 141 (Rated for Div. 2) Problem Solution, Click Here

New Upcoming OnePlus 11 Specifications, Click Here

Also Check this out:-

A. Make it Beautiful Educational Codeforces Round 141 (Rated for Div. 2) Problem Solution, Click Here

Solution of the Problem: Click Here

B. Matrix of Differences Educational Codeforces Round 141 (Rated for Div. 2) Problem Solution