1363C.md (1704B)
1 Source: https://codeforces.com/problemset/problem/1363/C 2 3 C. Game On Leaves 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Ayush and Ashish play a game on an unrooted tree consisting of $n$ nodes numbered $1$ to $n$. Players make the following move in turns: 22 23 * Select any leaf node in the tree and remove it together with any edge which has this node as one of its endpoints. A leaf node is a node with degree less than or equal to $1$. 24 25 A tree is a connected undirected graph without cycles. 26 27 There is a special node numbered $x$. The player who removes this node wins the game. 28 29 Ayush moves first. Determine the winner of the game if each player plays optimally. 30 31 Input 32 33 The first line of the input contains a single integer $t$ $(1 \leq t \leq 10)$ — the number of testcases. The description of the test cases follows. 34 35 The first line of each testcase contains two integers $n$ and $x$ $(1\leq n \leq 1000, 1 \leq x \leq n)$ — the number of nodes in the tree and the special node respectively. 36 37 Each of the next $n-1$ lines contain two integers $u$, $v$ $(1 \leq u, v \leq n, \text{ } u \ne v)$, meaning that there is an edge between nodes $u$ and $v$ in the tree. 38 39 Output 40 41 For every test case, if Ayush wins the game, print "Ayush", otherwise print "Ashish" (without quotes). 42 43 Examples 44 45 Input 46 47 ``` 48 1 49 3 1 50 2 1 51 3 1 52 ``` 53 54 Output 55 56 ``` 57 Ashish 58 ``` 59 60 Input 61 62 ``` 63 1 64 3 2 65 1 2 66 1 3 67 ``` 68 69 Output 70 71 ``` 72 Ayush 73 ``` 74 75 Note 76 77 For the $1$st test case, Ayush can only remove node $2$ or $3$, after which node $1$ becomes a leaf node and Ashish can remove it in his turn. 78 79 For the $2$nd test case, Ayush can remove node $2$ in the first move itself.