Well, I must say it will be very difficult to achieve. But anyway, wish you all the best!

I saw your profile, considering you still can't solve B problems of Div3, I'd say specialist is very unrealistic target. Depending on the time you have you can reach pupil though. Best of luck anyways.

Problem != Question.

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        long long k, a, b, x, y;
        cin >> k >> a >> b >> x >> y;

        long long count = 0;

        // Prioritize the one with smaller decrement
        if (x > y) {
            swap(a, b);
            swap(x, y);
        }

        // First cook as much as possible with the better option (less decrement)
        while (k >= a) {
            k -= x;
            count++;
        }

        // Then cook the other one if still possible
        while (k >= b) {
            k -= y;
            count++;
        }

        cout << count << '\n';
    }

    return 0;
}

is this one also your own code which is copied i mean written by you?

no

looking at the ratings of the questions you solved, you might reach pupil, but specialist might be difficult at this time, but gl!