65分求调

#include<bits/stdc++.h>
using namespace std;
int n,m,a,b;
bool check(int k){
	if(k==0){
		return 1;
	}
	int l=max(0,k-min(n/b,m/a));
	int r=min(k,min(n/a,m/b));
	return l<=r;
} 
int main(){
	cin>>n>>m;
	cin>>a>>b;
	int l=0;
	int r=(n+m)/(a+b);
	int ans=0; 
	while(l<=r){
		int mid=l+(r-l)/2;
		if(check(mid)){
			ans=mid;
			l=mid+1;
		}
		else{
			r=mid-1;
		}
	}
	cout<<ans;
	return 0;
}