Unformatted text preview: coordinates (0,0) and maximum coordinates (9,9). Then, prompt the user for a random guess as to the secret grid location. If the user gets it on the nose, print out a congratulatory message. Otherwise, tell them which direction they must move in to get to the point. We will consider moving in the positive x direction as going East and moving in the positive y direction as going North. (Just use N, S, E and W. Sometimes you will print out two directions for movement, other times only one.) Sample Run (User input in bold and italics) Enter your guess for x and y. 3 5 This is not correct. You need to move NW. Enter your guess for x and y. 1 7 This is not correct. you need to move S. Enter your guess for x and y. 1 6 You are correct! The secret location was 1,6....
View Full Document
- Spring '08
- Addition, Natural number, Euclidean algorithm, Fibonacci number