GO Solution For UVa 10004 - Bicoloring. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

In 1976 the “Four Color Map Theorem” was proven with the assistance of a computer. This theorem states that every map can be colored using only four colors, in such a way that no region is colored using the same color as a neighbor region.

Here you are asked to solve a simpler similar problem. You

...

You can find the full details of the problem Bicoloring at UVa Online Judge

Sample Input

3
3
0 1
1 2
2 0
3
2
0 1
1 2
9
8
0 1
0 2
0 3
0 4
0 5
0 6
0 7
0 8
0

Sample Output

NOT BICOLORABLE.
BICOLORABLE.
BICOLORABLE.

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985