Greetings.

As we know, inside a SCT, there exists a Hamiltonian path, starting from each node.

What is an efficient way of finding a Hamiltonian path inside of a Strongly Connected Tournament?

On POI, there is a special testing environment, which assumes equal execution time of every instruction (one clock cycle each), the count of the cycles is then divided by some number which mimicates the real CPU cycle capabilities, to get the runtime.

Could you (specifically in C++) take somehow advantage of this testing system property, and write your programs in a style, which generally uses more costly instructions, but fewer of them, as to make the execution time faster in this environment?