I and (apparently) one other contestant are discovering that it is very easy for a problem to flip between solvable in a short time to unsolvable in hours, based on minor adjustments to algorithms. See some of the samples I've uploaded. Because of that it has been hard to find cases suitable for multi-thread optimization -- they seem to either solve very quickly (in which case multi-core doesn't matter), or they solve so slowly that nobody wants to wait for the result, even with multi-core. Due to this effect, what do the judges anticipate doing when a solver does not come back for a very long time?
Nähere Informationen zur Compiler-Optimierung finden Sie in unserem Optimierungshinweis.