← 返回题目

题库练习 4-point polyline

← 上一题下一题 →

A9475 | $4-point polyline$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given a rectangular grid of lattice points from $(0,0)$ to $(n,m)$ inclusive. You have to choose exactly 4 different points to build a polyline possibly with self-intersections and self-touching. This polyline should be as long as possible. A polyline defined by points $p_{1},p_{2},p_{3},p_{4}$ consists of the line segments $p_{1}p_{2},p_{2}p_{3},p_{3}p_{4}$ , and its length is the sum of the lengths of the individual line segments.

输入格式

The only line of the input contains two integers $n$ and $m$ $(0<=n,m<=1000)$ . It is guaranteed that grid contains at least 4 different points.

输出格式

Print 4 lines with two integers per line separated by space — coordinates of points $p_{1},p_{2},p_{3},p_{4}$ in order which represent the longest possible polyline. Judge program compares your answer and jury's answer with $10^{-6}$ precision.

输入输出样例

输入 #1

1 1

输出 #1

输入 #2

0 10

输出 #2

C++ 编辑器

输入

输出