2018牛客多校训练----Another Distinct Values（数学规律）

最新推荐文章于 2018-09-16 08:05:30 发布

对你说的对

最新推荐文章于 2018-09-16 08:05:30 发布

阅读量353

点赞数

分类专栏：思维or贪心

本文链接：https://blog.csdn.net/jinghui_7/article/details/81265356

版权

这是一道来自牛客网的编程题目，挑战者需要填充一个n*n的矩阵，使得每行和每列的和都是独特的值，且限于-1, 0, 1。奇数长度的矩阵无法满足条件，而偶数长度的矩阵可以通过对角线划分进行构造，保证行列和的多样性。" 133155307,19991358,TiDB HTAP在新能源车企实时数据分析的应用,"['数据库', '数据分析', '实时处理', '新能源汽车', 'TiDB']

摘要由CSDN通过智能技术生成

链接：https://www.nowcoder.com/acm/contest/142/D
来源：牛客网

题目描述

Chiaki has an n x n matrix. She would like to fill each entry by -1, 0 or 1 such that r1,r2,...,rn,c1,c2, ..., cn are distinct values, where ri be the sum of the i-th row and ci be the sum of the i-th column.

输入描述:

There are multiple test cases. The first line of input contains an integer T (1 ≤ T ≤ 200), indicating the number of test cases. For each test case:
The first line contains an integer n (1 ≤ n ≤ 200) -- the dimension of the matrix.

输出描述:

For each test case, if no such matrix exists, output ``impossible'' in a single line. Otherwise, output ``possible'' in the first line. And each of the next n lines contains n integers, denoting the solution matrix. If th