Problem:
Score : 300 points

Problem Statement

There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).
You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.

Constraints

1 \leq W,H \leq 10^9

0\leq x\leq W

0\leq y\leq H

All values in input are integers.

Input

Input is given from Standard Input in the following format:

W H x y

Output

Print the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.

The area printed will be judged correct when its absolute or relative error is at most 10^{-9}.

Sample Input 1

2 3 1 2

Sample Output 1

3.000000 0

The line x=1 gives the optimal cut, and no other line does.

Sample Input 2

2 2 1 1

Sample Output 2

2.000000 1

Solution in Python (3.4.3) (judge verdict: Runtime Error)

N,K = map(int,input().split())
a = [int(x) for x in input().split()]

start = 0
end = 0
a_sum = a[0]

ans = 0
#右に進めるだけ進む ->  a_sum >= Kを満たすまで
#左を詰めていく -> a_sum >= K の間だけ

#右端までいったらbreak



while True:
    if a_sum < K:
        end += 1
        if end == N:
            break

        #新たに追加した最後の数字を追加
        a_sum += a[end]

    else:
        #もしK以上の場合、end以降の全ての要素が追加されても満たすため、その数を足す
        #その数はこの場合、N - end  ex:10個あってa[2]~a[5]個で満たしているとき、 2~a[6], a[7], a[8], a[9]とあって計 N - 5個
        ans += N - end

        #左を詰める
        a_sum -= a[start]
        start += 1

print(ans)