CF452B.4-point polyline

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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
```
1 1
0 0
1 0
0 1
```
输入#2
```
0 10
```
输出#2
```
0 1
0 10
0 0
0 9
```

首页