Karkit

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, a, b;
    cin >> n >> a >> b;

    vector<int> m;
    m.reserve(n + 1);
    m[0] = 0;
    for (int i = 1; i <= n; ++i)  {
        if (i < a && i < b)
            m[i] = 0;
        else if (i < a)
            m[i] = m[i - b] + 1;
        else if (i < b)
            m[i] = m[i - a] + 1;
        else
            m[i] = std::max(m[i - a] + 1, m[i - b] + 1);
    }
    cout << m[n] << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED