The Problem
This task will test a common computer science problem: graph coloring! Specifically, you'll be completing Project Euler problem 189 with some changes:
- The program should accept input of the number of rows for which to calculate the number of colorings for.
- As an extension, and for extra credit, you can also allow the number of colors to be changed too.
Quote
Originally Posted by Problem #189
A colouring C' which is obtained from a colouring C by rotation or reflection is considered distinct from C unless the two are identical.
A colouring C' which is obtained from a colouring C by rotation or reflection is considered distinct from C unless the two are identical.
Judging
The judges for this problem will be Vswe and PythonPower. We're looking for correctness, quality of code and efficient algorithms.
Does your solution solve the problem? Can we find a case where it fails? Can it solve extreme cases quickly? Are variables name consistently? Is there redundant code or inelegant methods? Questions like these will form the process for selecting the winner.
Submissions
Send your submissions by mail to us at: CC_BattleJudges@hotmail.com before the 16th of june to join the 4th version of CodeCall's Coder Battle.
Rewards
We'll announce first, second and third place. I'm sure a few administrators/ moderators can see to some serious +rep for those people. ;)


Sign In
Create Account


Back to top










