给定四种操作,前两个操作是倒入100 * A 的水,或倒入100 *B的水,后两个操作是倒入C的糖或者D的糖,保证每100的水中最多能溶解E的糖也就是糖水的浓度 小于E/100,也就是100的水对应的糖要小于E,同时保证糖加水不超过F,
定义糖水的浓度为100 *b / (a + b) ,a为水,b为糖
#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b; -- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =3e3 + 10 ,M = N *5,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8,DNF = 1e18;
const int mod = 998244353 ,base= 20010;
const LL LNF=(LL) INF * INF;
bool st[N];
LL anss,answ;
LD deg= - 1 ;
void solve()
{
LL a,b,c,d,e,f;
cin >> a >> b >> c >> d >> e >> f ;
st[0] = 1 ;
fu(i,c,N-1) st[i] |= st[i - c ];
fu(i,d,N-1) st[i] |= st[i - d ];
for(int i = 0 ;i <= N - 1 ;i += a * 100 )
for(int j= 0;j <= N - 1 ; j += b * 100 )
{
LL water = i + j ;
if(!water || water >f ) continue;
LL t = min(e * (i + j ) / 100 , f -water);
// 最大能放的糖的 数量
fd(k,t,0)
if(st[k])// k 能够拆分 成c,d的组合
{
if(100.l * k / (water + k ) > deg )
answ= water + k , anss = k,deg = 100.l * k/ (water + k);
break; // 在两重循环内会更新多次
}
}
cout << answ<< " " << anss << endl;
}
signed main()
{
// freopen("1.txt","r",stdin);
// #define int long long
// init(N-1);
ios
// cout << fixed<<setprecision(2);
int t=1;
// cin>>t;
int now = 1;
while(t -- )
{
// cout<<"Case ";
// cout<<"Case #";
// cout<<"Scenario #";
// cout<< now ++ <<": ";
// cout<< now ++ <<": \n";
solve();
}
return 0;
}