Chinese Chess

Submit

Your name:
File:
Open code-statistics:

Language is selected by the extension of the file. See the list of supported languages to know the extension of your language.

Problem

A has a large chessboard. There is only a "bishop" on it. He wants to know if the bishop can jump from the starting point(x1, y1) to the ending point(x2, y2) using one jump.

The "bishop" moves like this: it can move from (x,y) to (x+2, y+2), (x-2, y+2), (x+2, y-2), (x-2, y-2).

Inputs four integers(x1, y1, x2, and y2) that represent the position of the starting point and the ending point.

If the "bishop" can jump from the starting point to the ending point using one jump, output "Yes", otherwise output "No".

Options

exec is denied

rejudge feature is enabled

now post-mortem time, all source codes will be revealed

Sample input:_

2 3 4 5

Sample output:

Yes

Ranking

PHP _

RankUserSizeTimeDateStatistics
1Unihedron ユニ30.03332019/04/17 15:17:390B / 3B / 0B

C _

RankUserSizeTimeDateStatistics
1_1310.01052019/04/13 14:18:510B / ?B / ?B

AWK _

RankUserSizeTimeDateStatistics
1Unihedron ユニ80.01042019/04/17 15:18:300B / 4B / 4B

sed _

RankUserSizeTimeDateStatistics
1Unihedron ユニ40.01042019/04/17 15:18:370B / 4B / 0B

gs2 _

RankUserSizeTimeDateStatistics
1Unihedron ユニ30.05872019/04/17 15:17:560B / 3B / 0B

Language Ranking_

RankLangUserSizeScore
1PHPUnihedron ユニ310000
2gs2Unihedron ユニ310000
3sedUnihedron ユニ47500
4AWKUnihedron ユニ83750
5C131229

return to the top page