Codeforces Round #195 (Div. 2) / 336A Vasily the Bear and Triangle(模拟&数学)

A. Vasily the Bear and Triangle

http://codeforces.com/problemset/problem/336/A

time limit per test

memory limit per test

input

output

favorite rectangle, it has one vertex at point (0, 0), and the opposite vertex at point (x, y). Of course, the sides of Vasya's favorite rectangle are parallel to the coordinate axes.

B = (0, 0). That's why today he asks you to find two points A = (x₁, y₁) and C = (x₂, y₂), such that the following conditions hold:

• x₁, x₂, y₁, y₂ are integers. Besides, the following inequation holds: x₁ < x₂;
• A, B and C is rectangular and isosceles ( is right);
• ABC;
• ABC

Help the bear, find the required points. It is not so hard to proof that these points are unique.

Input

x, y ( - 10⁹ ≤ x, y ≤ 10⁹, x ≠ 0, y ≠ 0).

Output

x₁, y₁, x₂, y₂

Sample test(s)

input

10 5

output

0 15 15 0

input

-10 5

output

-15 0 0 15

Note

Figure to the first sample

简单模拟。

完整代码：

/*30ms,0KB*/

#include<cstdio>

int main()
{
	int x, y;
	scanf("%d%d", &x, &y);
	if (x > 0 && y > 0)
		printf("0 %d %d 0", x + y, x + y);
	else if (x > 0 && y < 0)
		printf("0 %d %d 0", y - x, x - y);
	else if (x < 0 && y > 0)
		printf("%d 0 0 %d", x - y, y - x);
	else
		printf("%d 0 0 %d", x + y, x + y);
}