#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long LL;
int main()
{
//ios::sync_with_stdio(false);
//freopen("in.in","r",stdin);
//freopen("out.out","w",stdout);
LL t,cas=0;
cin>>t;
while(t--)
{
LL n,s1,v1,s2,v2;
LL ans=0;
cin>>n>>s1>>v1>>s2>>v2;
cas++;
LL num1=n/s1,num2=n/s2;
if(s1>=100000)
{
for(int i=0;i<=num1;i++)
{
LL temp=(n-i*s1)/s2*v2+i*v1;
if(temp>ans) ans=temp;
}
}
else
{
if(s2>=100000)
{
for(int i=0;i<=num2;i++)
{
LL temp=(n-i*s2)/s1*v1+i*v2;
if(temp>ans) ans=temp;
}
}
else
if(s1*v2>=s2*v1)
for(int i=0;i<=min(num1,s2-1);i++)
{
LL temp=i*v1+(n-i*s1)/s2*v2;
if(temp>ans) ans=temp;
}
else
for(int i=0;i<=min(num2,s1-1);i++)
{
LL temp=i*v2+(n-i*s2)/s1*v1;
if(temp>ans) ans=temp;
}
}
cout<<"Case #"<<cas<<": "<<ans<<endl;
}
return 0;
}
UVA 12325(p210)----Zombie's Treasure Chest
最新推荐文章于 2022-09-02 12:19:40 发布