 # 用C语言编程如何解决这个棋盘填充颜色的问题？？？

Problem Description
In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color.
— Wikipedia, the free encyclopedia

In this problem, you have to solve the 4-color problem. Hey, I’m just joking.

You are asked to solve a similar problem:

Color an N × M chessboard with K colors numbered from 1 to K such that no two adjacent cells have the same color (two cells are adjacent if they share an edge). The i-th color should be used in exactly ci cells.

Matt hopes you can tell him a possible coloring.

Input
The first line contains only one integer T (1 ≤ T ≤ 5000), which indicates the number of test cases.

For each test case, the first line contains three integers: N, M, K (0 < N, M ≤ 5, 0 < K ≤ N × M ).

The second line contains K integers ci (ci > 0), denoting the number of cells where the i-th color should be used.

It’s guaranteed that c1 + c2 + · · · + cK = N × M .

Output
For each test case, the first line contains “Case #x:”, where x is the case number (starting from 1).

In the second line, output “NO” if there is no coloring satisfying the requirements. Otherwise, output “YES” in one line. Each of the following N lines contains M numbers seperated by single whitespace, denoting the color of the cells.

If there are multiple solutions, output any of them.

Sample Input
4
1 5 2
4 1
3 3 4
1 2 2 4
2 3 3
2 2 2
3 2 3
2 2 2

Sample Output
Case #1:
NO
Case #2:
YES
4 3 4
2 1 2
4 3 4
Case #3:
YES
1 2 3
2 3 1
Case #4:
YES
1 2
2 3
3 1

• 写回答

#### 悬赏问题

• ¥15 edge浏览器最近莫名其妙老是每隔一段时间弹出色情网站，求解决。。
• ¥15 “glmnet”运行出错
• ¥30 如何用matlab表达以下公式？
• ¥15 在arm架构芯片上基于32位linux操作系统做内存检查
• ¥15 怎么样才能禁止VS自动调整Windows窗体布局
• ¥15 mysql5.7.40安装到Initializing database报错，如何解决？
• ¥30 如何降低hdfs中datanode的JVM内存用量
• ¥15 Android URL如何转成视频/音频，可行吗？
• ¥40 Hive SQL数据查询，子查询
• ¥15 c++字符串分割问题