My integral implementation finally got AC. For those who struggle with TL#9, you could change binary GCD to plain Euclidian algorithm with modulus, strangely it is a way faster despite it uses division.

Edited by author 02.04.2013 02:31