SGARDEN - Editorial

[himanshujaju]

Cycles finding is similar to this : PCYCLE Problem - CodeChef

[ravi0213]

java biginteger is really useful

[himanshujaju]

use prime factorization to find LCM.

[cherry_jain]

Won’t taking mod each time give the wrong answer?

[devuy11]

Hi All , The last pseudo code is wrong and is mentioned above . Even the function name “Wrong_Solution” suggests that it is wrong!

[gagaboy]

slow logic and the use of swap function is making it slower
and ur using brute force…think of some other logic

[yoyo123]

one mistake which I found is overflow in variable x .There may or may not be other mistakes.

[achaitanyasai]

(x/y)%z != (x%z)/(y%z)

[minato_namikaz]

you need to do inverse to calc division modulo

[garakchy]

another good editorial, which was written during the contest: combinatorics - Count the whistles - Mathematics Stack Exchange

[pratku123]

Hey, @devuy11, the error in the pseudo code wrong_soltion
http://discuss.codechef.com/questions/47443/lcm-of-n-numbers-modulo-1097

[perseus]

This was not very obvious to me. (x.y)modm==((xmodm).y)modm modular arithmetic - Very simple question, but what is the proof that x.y mod m == ((x mod m).y) mod m? - Mathematics Stack Exchange