Answer to Question #60945 in Java | JSP | JSF for sangeetha
Alice and Bob are playing a game called "Stone Game". Stone game is a two-player game. Let N be the total number of stones. In each turn, a player can remove either one stone or four stones. The player who picks the last stone, wins. They follow the "Ladies First" norm. Hence Alice is always the one to make the first move. Your task is to find out whether Alice can win, if both play the game optimally.
First line starts with T, which is the number of test cases. Each test case will contain N number of stones.
Print "Yes" in the case Alice wins, else print "No".
Sample Input and Output
SNo. Input Output 1 3 1 6 7 Yes Yes No
Dear sangeetha, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order
i am grouping my way at these maths , which I could not do with out you. You cover every question step by step and of top quality , inch by inch you guide me along the path, maybe a little expensive for me (71 years old who had a stroke) but top quality.
yours sincerely kevin