1400B - RPG Protagonist - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int modd = 114514;
const int N = 1919810;
int n,t,m;

void solve(){
	ll ap1,ap2,num1,num2,dam1,dam2;
	cin >> ap1 >> ap2 >> num1 >> num2 >> dam1 >> dam2;
	if(dam1 > dam2){
		swap(dam1,dam2);
		swap(num1,num2);
	}
	ll ans = 0;
	for(ll i = 0; i <= num1; i ++){
		ll used1 = i;
		ll yushu1 = ap1 - i*dam1;
		if(yushu1 < 0) break;
		ll used2 = min(num2,yushu1/dam2);
		yushu1 -= used2*dam2;
		ll nownum1 = num1 - used1;
		ll nownum2 = num2 - used2;
		ll used1_ = min(nownum1,ap2/dam1);
		ll yushu2 = ap2 - used1_*dam1;
		ll used2_ = min(nownum2,yushu2/dam2);
		ll num = used1 + used2 + used1_ + used2_;
		ans = max(ans,num);
	}
	cout << ans << '\n';
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> t;
	while(t --){
		solve();
	}
	return 0;
}