CF1838C.No Prime Differences
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given integers n and m . Fill an n by m grid with the integers 1 through n⋅m , in such a way that for any two adjacent cells in the grid, the absolute difference of the values in those cells is not a prime number. Two cells in the grid are considered adjacent if they share a side.
It can be shown that under the given constraints, there is always a solution.
输入格式
The first line of the input contains a single integer t ( 1≤t≤1000 ) — the number of test cases. The description of the test cases follows.
The first and only line of each test case contains two integers n and m ( 4≤n,m≤1000 ) — the dimensions of the grid.
It is guaranteed that the sum of n⋅m over all test cases does not exceed 106 .
输出格式
For each test case, output n lines of m integers each, representing the final grid. Every number from 1 to n⋅m should appear exactly once in the grid.
The extra spaces and blank lines in the sample output below are only present to make the output easier to read, and are not required.
If there are multiple solutions, print any of them.
输入输出样例
输入#1
3 4 4 5 7 6 4
输出#1
16 7 1 9 12 8 2 3 13 4 10 11 14 5 6 15 29 23 17 9 5 6 2 33 27 21 15 11 7 1 32 31 25 19 20 16 10 26 30 24 18 14 8 4 35 34 28 22 13 12 3 2 3 7 11 8 9 1 10 17 13 5 4 18 14 6 12 19 23 15 21 20 24 16 22
说明/提示
The first sample case corresponds to the picture above. The only absolute differences between adjacent elements in this grid are 1 , 4 , 6 , 8 , and 9 , none of which are prime.