CF617D.Polyline

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

There are three points marked on the coordinate plane. The goal is to make a simple polyline, without self-intersections and self-touches, such that it passes through all these points. Also, the polyline must consist of only segments parallel to the coordinate axes. You are to find the minimum number of segments this polyline may consist of.

输入格式

Each of the three lines of the input contains two integers. The $i$ -th line contains integers $x_{i}$ and $y_{i}$ ( $-10^{9}<=x_{i},y_{i}<=10^{9}$ ) — the coordinates of the $i$ -th point. It is guaranteed that all points are distinct.

输出格式

Print a single number — the minimum possible number of segments of the polyline.

输入输出样例

输入#1
```
1 -1
1 1
1 2
```
输出#1
```
1
```
输入#2
```
-1 -1
-1 3
4 3
```
输出#2
```
2
```
输入#3
```
1 1
2 3
3 2
```
输出#3
```
3
```

说明/提示

The variant of the polyline in the first sample: The variant of the polyline in the second sample: The variant of the polyline in the third sample:

首页