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大小的 0/1数组A={a [i][j]},表示节点i和节点j之间是否存在边(a [i][j]=1) 或(a [i][j]=0)。
输出:
N行,第i行包含一个整数c[i],表示第i个节点的颜色(c[i] = 1、2或3)。