1. There is a building of n floors. There is an elevator in the building which...

Transcribed Image Text:

1. There is a building of “n” floors. There is an elevator in the building which has “UP” and “DOWN” buttons. By pressing the “UP” button, the elevator moves up exactly “a” floors. By pressing the "DOWN" button, the elevator moves down exactly "b" floors. If you attempt to move the elevator to lower than the first floor or higher than the "n"th floor, the elevator does not move. Now, you are in the "k" floor and want to go to the "m"th floor. Compute and print out the minimum number of times you should press the "UP" or "DOWN" buttons to go to the destination. Assume that l≤n≤ 9999. Input) The first line of the input should be the number of test cases. For each test case, a user should provide “n”, “a”, “b”, “k”, and “m” in order. Output) Print format should be "test #[testcase_number] [result] UP, [result] DOWN”, If there is no feasible solution, your program should print "IMPOSSIBLE", Sample) 3 10 1 1 8 5 test #1 12 3 4 1 5 0 UP, 3 DOWN test #24 UP, 2 DOWN 10 2 2 1 6 test #3 IMPOSSIBLE M 1. There is a building of “n” floors. There is an elevator in the building which has “UP” and “DOWN” buttons. By pressing the “UP” button, the elevator moves up exactly “a” floors. By pressing the "DOWN" button, the elevator moves down exactly "b" floors. If you attempt to move the elevator to lower than the first floor or higher than the "n"th floor, the elevator does not move. Now, you are in the "k" floor and want to go to the "m"th floor. Compute and print out the minimum number of times you should press the "UP" or "DOWN" buttons to go to the destination. Assume that l≤n≤ 9999. Input) The first line of the input should be the number of test cases. For each test case, a user should provide “n”, “a”, “b”, “k”, and “m” in order. Output) Print format should be "test #[testcase_number] [result] UP, [result] DOWN”, If there is no feasible solution, your program should print "IMPOSSIBLE", Sample) 3 10 1 1 8 5 test #1 12 3 4 1 5 0 UP, 3 DOWN test #24 UP, 2 DOWN 10 2 2 1 6 test #3 IMPOSSIBLE M

Answer rating: 100% (QA)

Code include using namespace std 10 1 1 8 ... View the full answer