例题7-11(uva-12325)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
long long int  v, res, n;

long long int  GetResult(int a1, int b1, int a2, int b2){
	long long int  temp = v,len = v / a1,ret = 0;
	for (long long int i = 0; i <= len; i++){
		ret = max(ret, i * b1 + (temp - i * a1) / a2 * b2);
	}
	return ret;
}

int main()
{
	long long int  id = 0,a1,a2,b1,b2;
	cin >> n;
	while (n--){
		cin >> v >> a1 >> b1 >> a2 >> b2;
		if (a1 > a2){
			swap(a1, a2);
			swap(b1, b2);
		}

		if (v / a2 >= 65535){
			res = 0;
			for (int i = 0; i <= a1; i++)
			{
				res = max(res, i*b2 + (v - i * a2) / a1 * b1);
			}
			for (int i = 0; i <= a2; i++){
				res = max(res, i * b1 + (v - i* a1) / a2 * b2);
			}
			cout << "Case #" << ++id << ": " << res << endl;
		}else
			cout << "Case #" << ++id << ": " << GetResult(a2, b2, a1, b1) << endl;
	}
	return 0;
}