Buildings

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 221    Accepted Submission(s): 29

Problem Description

Your current task is to make a ground plan for a residential building located in HZXJHS. So you must determine a way to split the floor building with walls to make apartments in the shape of a rectangle. Each built wall must be paralled to the building‘s sides.

The floor is represented in the ground plan as a large rectangle with dimensions n×m, where each apartment is a smaller rectangle with dimensions a×b located inside. For each apartment, its dimensions can be different from each other. The number a and b must be integers.

Additionally, the apartments must completely cover the floor without one 1×1 square located on (x,y). The apartments must not intersect, but they can touch.

For this example, this is a sample of n=2,m=3,x=2,y=2.

To prevent darkness indoors, the apartments must have windows. Therefore, each apartment must share its at least one side with the edge of the rectangle representing the floor so it is possible to place a window.

Your boss XXY wants to minimize the maximum areas of all apartments, now it‘s your turn to tell him the answer.

Input

There are at most 10000 testcases.
For each testcase, only four space-separated integers, n,m,x,y(1≤n,m≤108,n×m>1,1≤x≤n,1≤y≤m).

Output

For each testcase, print only one interger, representing the answer.

Sample Input

2 3 2 2
3 3 1 1

Sample Output

1
2

Hint

Case 1 :
You can split the floor into five 1×1 apartments. The answer is 1.

Case 2:
You can split the floor into three 2×1 apartments and two 1×1 apartments. The answer is 2.
If you want to split the floor into eight 1×1 apartments, it will be unacceptable because the apartment located on (2,2) can‘t have windows.

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <algorithm>
 4 using namespace std;
 5 int main()
 6 {
 7     int n,m,x,y;
 8     while(scanf("%d %d %d %d",&n,&m,&x,&y)!=EOF)
 9     {
10         int s=0,k=0;
11         int flg=1,misetp;
12         misetp=min(x-1,y-1);
13         misetp=min(misetp,n-x);
14         misetp=min(misetp,m-y);
15         s=s+misetp;
16         n=n-misetp*2,m=m-misetp*2;
17         x=x-misetp,y=y-misetp;
18         while(flg)
19         {
20             if(n==1 && m==1 && x==1 &&y==1)
21                 s--,flg=0;
22             s++;
23             n=n-2,m=m-2;
24             if(n<=0 || m<=0)
25                 break;
26             x--,y--;
27             if(x==0 || x==n+1 || y==0 || y==m+1)
28             {
29                 flg=0;
30                 if((n>=2 && m>=3) || (n>=3 && m>=2))
31                 {
32                     if(1<x && x<n)
33                     {
34                         k=min(x,n-x+1);
35                         k=min(k,m);
36                         k=k+s;
37                     }
38                     else if(1<y && y<m)
39                     {
40                         k=min(y,m-y+1);
41                         k=min(k,n);
42                         k=k+s;
43                     }
44                 }
45             }
46         }
47         if(n>0 && m>0)
48         {
49             s=s+min(n/2+n%2,m/2+m%2);
50         }
51         if(k>s)
52             s=k;
53         printf("%d\n",s);
54     }
55     return 0;
56 }