题目来源:https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH01
题目:Map Coloring
描述:
Given edges of a graph with N nodes. There are three colors that can be used for coloring nodes. Determine the color of each node so that the colors of nodes of each edge should be different.
输入:
First line: one positive integer N (N <= 20).
Next N lines: an N*N 0/1 matrix A={a[i][j]} indicating whether there exists an edge (a[i][j]=1) between Node i and Node j or not (a[i][j]=0).
输出:
N lines, the i-th line contains one integer c[i] indicating the color of the i-th node (c[i] = 1, 2, or 3).
我的译文:
给定一个边缘有n个节点图形,现在有三种颜色,你的任务就是将节点上色,不同边的颜色不同;
输入:
第一行输入n个整数。
接下来的n行为n*n的矩阵,确定在节点 i 与节点 j 之间是否存在边a[i][j]
输出:n行,第i个节点的颜色。