洛谷P3579 [POI2014]PAN-Solar Panels（BZOJ3834）

版权声明：蒟蒻Blog随意转载 https://blog.csdn.net/a1799342217/article/details/82153114

数学题

洛谷题目传送门
BZOJ题目传送门

考虑枚举答案，那么我们只要判断$\frac{smin}{ans}<\frac{smax}{ans}$和$\frac{wmin}{ans}<\frac{wmax}{ans}$是否满足即可。一发除法分块就好了。

代码：

#include<cstdio>
#include<algorithm>
using namespace std;
int t,sn,sx,wn,wx,ans;
int main(){
    for (scanf("%d",&t);t;t--){
        scanf("%d%d%d%d",&sn,&sx,&wn,&wx);
        sn--,wn--;
        if (sx>wx) swap(sx,wx),swap(sn,wn);
        for (int l=1,r;l<=sx;l=r+1){
            r=min(wx/(wx/l),sx/(sx/l));
            if (l<=sn) r=min(r,sn/(sn/l));
            if (l<=wn) r=min(r,wn/(wn/l));
            if (sn/l<sx/l&&wn/l<wx/l) ans=r;
        }
        printf("%d\n",ans);
    }
    return 0;
}