Description: The problem of combat horse was realized by the algorithm
Description of laquo:
According to the rules of chess, the mark at position (0, 0) jumps to position (1, 2), (1, -2), (-1, 2),
(-1, -2), (2, 1), (2, -1), (-2, 1), (-2, -1). Steeds in combat horses have a more general jump
Ability. The combat horse at the position (0, 0) can jump to a position in k position x, y, I, I, 1 £ & pound. war
The horse question asked to determine whether a given horse could jump over every position on the infinite board.
« programming tasks:
The jumping ability of a horse in a given battle horse. Determine whether the horse can jump over every position on the infinite board.
« data input:
Input data is given by input.txt. Line 1 has a positive integer k, which represents the combat horse at the position (0, 0)
I can jump to k. The next k line, each row has two integers, representing the jump position of the horse.
« result output:
Output the computed result to the file output.txt. A given horse can hop across every position on the board and output "Yes",
Otherwise output "No".
An example of the input file example output file
Input. TXT output. TXT
3
1 0
0 1
- 2-1
Yes
To Search:
- [factor] - Description of laquo: The positive integ
- [permrank] - The algorithm realizes the dictionary or
- [libbt-1.01] - libbt-1.01 BT Application software is th
File list (Check if you may need any files):
Download