A flea on a chessboard
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 1509 | Accepted: 491 |
Description
![](https://i-blog.csdnimg.cn/blog_migrate/43c392d4634727d7ecc7f790badb081b.jpeg)
Given the starting position of the flea on the board your task is to find out after how many jumps the flea will reach a white square. If the flea lands on a boundary between two squares then it does not count as landing on the white square. Note that it is possible that the flea never reaches a white square.
Input
Each test case consists of one line of input containing five non-negative numbers separated by white space and giving integers S, x, y, dx, and dy. An input line containing five zeroes follows the last test case.
Output
For test case print one line of output in the format shown in the sample.
Sample Input
10 2 3 3 2 100 49 73 214 38 25 0 0 5 25 407 1270 1323 1 1 18 72 6 18 6 407 1270 1170 100 114 0 0 0 0 0
Sample Output
After 3 jumps the flea lands at (11, 9). After 1 jumps the flea lands at (263, 111). The flea cannot escape from black squares. After 306 jumps the flea lands at (1576, 1629). The flea cannot escape from black squares. After 0 jumps the flea lands at (1270, 1170).
Source