The lateral direction of one role is opposite to yours.
Do not focus on one role but cause another character to die.
As long as a role death game ends
As long as a role death game ends
Fat Xiaoxingxing was so fat that he couldn't walk with his feet. But he didn't care about it. "Sphere is also a shape of body." He always said and somehow he was a bit happy with that.nnThe only thing he cared was his Lost Piece (LP). He was born with some imperfection. He felt depressed with that. Not does he become complete until he could find his LP. "I will find my LP." As he declared, he set off for his LP. He couldn't walk, so he could only move by rolling. He had to bear the hard sunshine or the heavy rain. However, he still sang songs on his way, "La... la... la... I am going to find my LP..." After a long journey of adventure, he found where his LP lay. It was not far away from him.nnNow given the positions of Xiaoxingxing and his LP, you are asked to calculate the minimum degree he needed to roll to reach his LP.nnInputnnThere are multiple test cases. The first line contains an integer n (0 < n ≤ 100). The body of Xiaoxingxing can be decribed as a polygon of n points. Each of the following n lines contains two integers xi and yi (|xi| ≤ 10000, 0 ≤ yi ≤ 10000) , descibing a point of the polygon clockwise or counter-clockwise. The first point of the polygon is always the origin and the polygon will not be self-crossed. The last line of each test case contains two integers X and Y (xi < X ≤ 10000, 0 ≤ Y ≤ 10000), descrbing the position of the Lost Piece. Xiaoxingxing can only roll with some point fixed on the ground where y = 0.nnOutputnnFor each test case, first output one line containing "Case x:" where x is the case number (starting from 1). If it is possible for Xiaoxingxing to reach his LP, output the minimum angel in degrees he has to roll before he can reach his LP. The result should be accurate up to 2 decimal places. Otherwise, output "Impossible" instead.nnSample Inputnn4n0 0n0 1n-1 1n-1 0n1 0n4n0 0n0 3n-4 3n-4 0n3 6nSample OutputnnCase 1: 90.00nCase 2: Impossible
DescriptionnnAcm, a treasure-explorer, is exploring again. This time he is in a special maze, in which there are some doors (at most 5 doors, represented by 'A', 'B', 'C', 'D', 'E' respectively). In order to find the treasure, Acm may need to open doors. However, to open a door he needs to find all the door's keys (at least one) in the maze first. For example, if there are 3 keys of Door A, to open the door he should find all the 3 keys first (that's three 'a's which denote the keys of 'A' in the maze). Now make a program to tell Acm whether he can find the treasure or not. Notice that Acm can only go up, down, left and right in the maze.nInputnnThe input consists of multiple test cases. The first line of each test case contains two integers M and N (1 < N, M < 20), which denote the size of the maze. The next M lines give the maze layout, with each line containing N characters. A character is one of the following: 'X' (a block of wall, which the explorer cannot enter), '.' (an empty block), 'S' (the start point of Acm), 'G' (the position of treasure), 'A', 'B', 'C', 'D', 'E' (the doors), 'a', 'b', 'c', 'd', 'e' (the keys of the doors). The input is terminated with two 0's. This test case should not be processed.nOutputnnFor each test case, in one line output "YES" if Acm can find the treasure, or "NO" otherwise.nSample Inputnn4 4 nS.X. na.X. n..XG n.... n3 4 nS.Xa n.aXB nb.AG n0 0