[ACM-ICPC] 5725 - Fun Coloring
Consider the problem called Fun Coloring
below.
Fun Coloring
Problem
Instance: A
finite set U and sets S1, S2, S3,…,Sm
U and |Si|
≤ 3.
Problem: Is
there a function f : U {RED, BLUE} such that at least one member of each Si
is assigned a different color fr...
