Gym - 101257D !Hasan 【二分 | 推公式】

题目链接：https://vjudge.net/problem/Gym-101257D
题意：总共有n台电脑，Moath找一台电脑需要x分钟，Saif找一台电脑需要y分钟，问你找n台电脑需要多少分钟
解析：在0~2*1e18里面二分答案，还有一种方法就是推公式

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int maxn = 2*1e5+100;
int a[maxn];
int main(void)
{
    long long n,x,y;
    scanf("%I64d %I64d %I64d",&n,&x,&y);
    long long l=0,r = 2*1e18;
    while(l<r-1)
    {
        long long mid = (l+r)/2;
        long long tmp = mid/x+mid/y;
        if(tmp>=n)
            r = mid;
        else
            l = mid;
    }
    printf("%I64d\n",r);
    return 0;
}

队长的过题姿势

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <set>

using namespace std;
typedef long long LL;

LL x,y,n;
int main()
{
    while(scanf("%I64d%I64d%I64d",&n,&x,&y)!=EOF)
    {
        LL A=(n*y)/(x+y);
        LL B=(n*x)/(x+y);
        LL m=n-A-B;
        LL ans=min(max((A+m)*x,B*y),max(A*x,(B+m)*y));
        cout<<ans<<endl;
    }
    return 0;
}