CF_483B Friends and Presents(二分大法好啊)

You have two friends. You want to present each of them several positive integers. You want to present cnt1 numbers to the first friend and cnt2 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.

Example 
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.

题解：将  1 到 v  之间的数 分给 两个人，要求 给第一个人 分的数不为 x 的倍数，第二个人分的数 不为 y 的倍数， 求最小的 v。

题量不够，没想到的二分。 二分大法强。

注意一下， cnt1 + cnt2 <= mid - mid / (x * y),   保证有足够的数，以至于不会被数重复使用。

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int cnt1,cnt2,x,y;
    while(~scanf("%d%d%d%d",&cnt1,&cnt2,&x,&y)){
        long long l = 0,r = 0x3f3f3f3f3f3f;
        while(l <= r){
            long long mid = (l + r) >> 1;
            if(cnt1 <= mid - mid / x && cnt2 <= mid - mid / y && cnt1 + cnt2 <= mid - mid / (x * y))
                r = mid - 1;
            else l = mid + 1;
        }
        printf("%I64d\n",l);
    }
    return 0;
}