Karkit

#include <bits/stdc++.h>
#include <iostream>

using namespace std;


constexpr int k = 2;
int c[2];
int d[101];

int f(int x) {
	if (x == 0) return 0;
	if (x < 0) return INT_MIN;
	if (d[x]) return d[x];

	int u = INT_MIN;

	for (int i = 0; i < k; i++) {
		u = max(u, f(x-c[i])+1);
	}
	d[x] = u;

	return d[x];
}


int main() {
	int n, a, b;
	cin >> n >> a >> b;

	c[0] = a;
	c[1] = b;

	cout << f(n) << '\n';

	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED