Roundgod draws a grid graph of size nnn with n×nn times nn×n cells. She can use one of kkk colors to color every edge once, but lzr gives her some limits. lzr loves balance. All colors should appear in the same number of times. lzr loves complexity. The graph should not contain any monochromatic cycle. lzr hatesmonotone. Each whole horizontal or vertical line of the graph should contain at least two colors. Roundgod is so divine that she doesn't want to waste her god's power to solve this problem. Could you give her a solution?
Roundgod draws a grid graph of size nnn with n×nn times nn×n cells. She can use one of kkk colors to color every edge once, but lzr gives her some limits. lzr loves balance. All colors should appear in the same number of times. lzr loves complexity. The graph should not contain any monochromatic cycle. lzr hates monotone. Each whole horizontal or vertical line of the graph should contain at least two colors. Roundgod is so divine that she doesn't want to waste her god's power to solve this problem. Could you give her a solution?