SHAKTI - SHAKTIMAN AND KILWISH
Since very long time shaktiman and kilwish have been fighting with each other but the fight never came to end . So finally I came to rescue . I decided that the result of the fight will be decided by a mathematical game , in which I will write a number (N) . Kilwish and shaktiman will play the game alternatively and each of them would subtract a number(n) [n is less than N] such that N modulo n gives zero. The game is repeted turn by turn until the one , who now cannot make a further move looses the game
Shaktiman being weak at mathematics asks you for help , whether or not he can win in that particular case. If Shaktimaan wins that game then print "Thankyou Shaktiman" otherwise print "Sorry Shaktiman".The game begins with shaktimaan playing first move.It is well understood that both of them will make moves in optimal way.
Input contains test cases t (< 10^5) and followed by t numbers (1 <= N <= 10^6 ).
If Shaktimaan wins that game then print "Thankyou Shaktiman" otherwise print "Sorry Shaktiman".
|Cluster:||Cube (Intel Pentium G860 3GHz)|
(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
Submit bruteforce algo ==> AC
learnt game theory :)
its not easy for me, i don't know how others find it easy..
i didn't get the question...can someone help in understanding it
I found this very helpful for this problem - https://www.youtube.com/watch?v=-8H15d5ibW4
It's possible that some people misunderstood the question, as it is not written very precisely. To clarify: At the start of the game, Shaktiman chooses some positive integer n<N such that N modulo n gives zero (if such an n exists), then he replaces N with N' = N-n, and in the following turn Kilwish will choose an n'<N' such that N' modulo n' gives zero (if such an n' exists), etc.Last edit: 2014-12-29 06:49:21
Anubhav Balodhi :
@Mitch thank U, yes this is an easy one...
a b :
it intresting to solve it by understanding the proof... nt jst observation