题解：CF1183C Computer Game

这题其实很简单。考虑二分答案，设当前为 $x$，我们必须用掉 $a\times x$，对于剩下的 $k-a\times x$，用 $b$ 来减，如果最后的操作数量 $\ge n$ 就满足要求。

#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pr;
#define up(i, l, r) for(int i = (l); i <= (r); i++)
#define down(i, r, l) for(int i = (r); i >= (l); i--)
const int mod = 1000000007;
const int base = 2333;
const double eps = 1e-6;

inline int read() {
	int x = 0, f = 1; char ch = getchar();
	while(ch < '0' || ch > '9') { if(ch == '-') f = -1; ch = getchar(); }
	while(ch >= '0' && ch <= '9') { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); }
	return x * f;
}

int n, m, k, a, b, Q, T, _;
bool flag = 0;

inline bool check(int x) {
	if(a * x >= k) return 0;
	return (x + (k - a * x) / b - ((k - a * x) % b == 0)) >= n;
}

signed main() {
	Q = read();
	while(Q--) {
		k = read(), n = read(), a = read(), b = read();
		if(min(a, b) * n >= k) {
			printf("-1\n");
			continue;
		}
		int l = 0, r = n, mid, ans = 0;
		while(l <= r) {
			mid = (l + r) >> 1;
			if(check(mid)) l = mid + 1, ans = mid;
			else r = mid - 1;
		}
		printf("%d\n", ans);
	}
	return 0;
}