欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页  >  数据库

Codeforces Round #195 (Div. 2) A Vasily the Bear and Trian

程序员文章站 2022-05-07 13:13:38
...

Vasily the bear has a 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. Vasya also loves triangles

Vasily the bear has a 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.

Vasya also loves triangles, if the triangles have one vertex at point B?=?(0,?0). That's why today he asks you to find two points A?=?(x1,?y1) and C?=?(x2,?y2), such that the following conditions hold:

  • the coordinates of points: x1, x2, y1, y2 are integers. Besides, the following inequation holds: x1?x2;
  • the triangle formed by point A, B and C is rectangular and isosceles (Codeforces Round #195 (Div. 2)  A	 Vasily the Bear and Trian is right);
  • all points of the favorite rectangle are located inside or on the border of triangle ABC;
  • the area of triangle ABC is as small as possible.

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