B. Friends and Presents

B. Friends and Presents

time limit per test

 1 second

memory limit per test

 256 megabytes

input

 standard input

output

 standard output

You have two friends. You want to present each of them several positive integers. You want to present cnt1 numbers to the first friend andcnt2 numbers to the second friend. Moreover, you want all presented numbers to be distinct, that also means that no number should be presented to both friends.

In addition, the first friend does not like the numbers that are divisible without remainder by prime number x. The second one does not like the numbers that are divisible without remainder by prime number y. Of course, you're not going to present your friends numbers they don't like.

Your task is to find such minimum number v, that you can form presents using numbers from a set 1, 2, ..., v. Of course you may choose not to present some numbers at all.

A positive integer number greater than 1 is called prime if it has no positive divisors other than 1 and itself.

Input

The only line contains four positive integers cnt1, cnt2, x, y (1 ≤ cnt1, cnt2 < 109; cnt1 + cnt2 ≤ 109; 2 ≤ x < y ≤ 3·104) — the numbers that are described in the statement. It is guaranteed that numbers x, y are prime.

Output

Print a single integer — the answer to the problem.

Sample test(s)

input

3 1 2 3

output

5

input

1 3 2 3

output

4

Note

In the first sample you give the set of numbers {1, 3, 5} to the first friend and the set of numbers {2} to the second friend. Note that if you give set {1, 3, 5} to the first friend, then we cannot give any of the numbers 1, 3, 5 to the second friend.

In the second sample you give the set of numbers {3} to the first friend, and the set of numbers {1, 2, 4} to the second friend. Thus, the answer to the problem is 4.

题意：

你要给两个人一些数字。给第一个人a个数字，第二个人b个数字。这所有的数字都不能相同，且第一个人的数字不能整除x，第二个人的数字不能整除y。现给你a, b, x, y 四个数字，从1...v中取数字，使得v是满足条件的且是最小的。

分析：

表示这题想了半天也没想出来啊。于是问了兽兽学长，且看了。。。这题是个二分啊。当v很大时肯定满足条件但不是最小的，所以只要用二分一个一个找这个最小的v。假设找到m，那么1...m这m个数可以取，再去掉x的倍数就为第一个人可以取的数na，同样可以求得第二个人可以取的数nb，如果na小于a或者nb小于b都是不满足，还有m个数中去掉两个人都不能取的数要大于等于a+b。最后注意所求得的数会大于等于a+b，所以要用 long long , 且二分的右端取大些。

程序如下：

[cpp]  view plain  copy

1. #include<stdio.h>  
2. int main()  
3. {  
4.     int a, b, x, y;  
5.   
6.     scanf("%d%d%d%d", &a,&b,&x,&y);  
7.     long long l = 1, r = 1e18;  
8.     while(l < r)  
9.     {  
10.         long long mid = l+(r-l)/2;  
11.         long long na = mid-mid/x;  
12.         long long nb = mid-mid/y;  
13.         long long all = mid-mid/x/y;  
14.         if(na < a || nb < b || all < a+b) l = mid+1;  
15.         else r = mid;  
16.     }  
17.     printf("%lld\n", l);  
18.     return 0;  
19. }