zoukankan      html  css  js  c++  java
  • CodeForces#275--DIV 2--B(BinarySearch)(!!)

    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 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, xy (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 xy 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.

    二分在最大求最小(whojay童鞋说的,我还没有查查,学渣伤不起)

    #include <iostream>
    
    using namespace std;
    
    typedef long long ll;
    
    ll cur1, cur2, x, y;
    
    int main()
    {
        cin>>cur1>>cur2>>x>>y;
        ll l = 0;
        ll r = 2e15;
        while (l != r)
        {
            ll m = (l + r) >> 1LL;
            ll f = m - (m/x);
            ll s = m - (m/y);
            ll all = m - (m/x/y);
            if (f < cur1 || s < cur2 || all < cur1 + cur2)
                l = m + 1;
            else
                r = m;
        }
        cout<<l;
        return 0;
    }
  • 相关阅读:
    水平触发与边缘触发
    Leetcode935 骑士拨号器
    leetcodeF47 礼物的最大价值
    leetcodeF42 连续子数组的最大和
    leetcode12 矩阵中的路径 回溯算法
    leetcode14-II 剪绳子II DP 解法配合快速乘取模
    leetcode17.16 按摩师DP
    leetcode530 二叉树的最小绝对差
    PCB genesis大孔加小孔(即卸力孔)实现方法
    PCB genesis短槽加引导孔实现方法
  • 原文地址:https://www.cnblogs.com/ya-cpp/p/4053007.html
Copyright © 2011-2022 走看看