CF40C.Berland Square

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

Last year the world's largest square was built in Berland. It is known that the square can be represented as an infinite plane with an introduced Cartesian system of coordinates. On that square two sets of concentric circles were painted. Let's call the set of concentric circles with radii $1,2,...,K$ and the center in the point $(z,0)$ a $(K,z)$ -set. Thus, on the square were painted a $(N,x)$ -set and a $(M,y)$ -set. You have to find out how many parts those sets divided the square into.

输入格式

The first line contains integers $N,x,M,y$ . ( $1<=N,M<=100000,-100000<=x,y<=100000,x≠y$ ).

输出格式

Print the sought number of parts.

输入输出样例

输入#1
```
1 0 1 1
```
输出#1
```
4
```
输入#2
```
1 0 1 2
```
输出#2
```
3
```
输入#3
```
3 3 4 7
```
输出#3
```
17
```

说明/提示

Picture for the third sample:

首页