Preparando MOJI

Triangle

1000ms 262144K

Description:

There is a right triangle with legs of length a and b. Your task is to determine whether it is possible to locate the triangle on the plane in such a way that none of its sides is parallel to the coordinate axes. All the vertices must have integer coordinates. If there exists such a location, you have to output the appropriate coordinates of vertices.

Input:

The first line contains two integers a, b (1 ≤ a, b ≤ 1000), separated by a single space.

Output:

In the first line print either "YES" or "NO" (without the quotes) depending on whether the required location exists. If it does, print in the next three lines three pairs of integers — the coordinates of the triangle vertices, one pair per line. The coordinates must be integers, not exceeding 109 in their absolute value.

Sample Input:

1 1

Sample Output:

NO

Sample Input:

5 5

Sample Output:

YES
2 1
5 5
-2 4

Sample Input:

5 10

Sample Output:

YES
-10 4
-2 -2
1 2

Informação

Codeforces

Provedor Codeforces

Código CF407A

Tags

brute forcegeometryimplementationmath

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:49:55

Relacionados

Nada ainda