NOVICE51 - A Simple Game
Akash and Aayush play the following number game. First they choose a number N (1<=N<=1000000000). Then both of them take their turn one by one. In a turn player has to subtract 1 from the number if it is odd or divide the number by 2 if it is even. Game end when the number becomes zero. Aayush has a dominating nature so he always play first. Help them in finding out who will win the game.
Input
First line contains T, the number of test cases. Following T lines contain 1 integer each, the value of N.
Output
For each test case print "Aayush" if Aayush wins else print "Akash".
Example
Input: 2 468 7547 Output: Aayush Akash
hide comments
kamran siddique:
2016-04-07 12:09:15
As simple As to follow the steps |
|
karthik1997:
2015-07-14 18:31:55
if n==0 akash wins loll ;( costed me lot of wa :P
|
|
Dushyant Singh:
2015-06-18 14:57:54
Can this be done in O(1)? |
|
owis hussien :
2015-03-09 11:55:46
runtime error (SIGSEGV) :(
|
|
mohamed ben ali:
2014-01-24 00:56:14
n=0 take me 1 wrong answer :(
|
|
Nick:
2013-11-22 14:11:01
follow the steps of question.. |
|
devD:
2013-07-03 09:57:49
Its 0<=N<=1000000000
|
|
Jitesh:
2013-04-26 16:02:18
@khald: anyone can subtract and anyone can divide.
|
|
forma:
2013-04-22 00:52:10
i want to know who subtract and who devides !!!!! |
|
bavly morcos:
2013-03-27 20:14:54
if n=2
|
Added by: | Mahesh Chandra Sharma |
Date: | 2011-03-25 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Own problem |