题解 | 喝可乐 | 暴力 log 级别复杂度

#include <bits/stdc++.h>
using namespace std;

void solve() {
    int n, A, B;
    cin >> n >> A >> B;
    int ans = n;
    for(int i = 0; i <=n; i++) {
        int a = i;
        int b = n - a;
        int res = n;
        while(a >= A || b >= B) {
            res += a / A;
            b += a / A;
            a %= A;
            res += b / B;
            a += b / B;
            b %= B;
        }
        ans = max(ans, res);
    }
    cout << ans << "\n";
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int T = 1;
    cin >> T;
    while (T--) solve();
}
// 64 位输出请用 printf("%lld")