Codeforces1183C 二分

假如cha=k-na=1-1e91e9=-1e18
cha=-cha=1e18
用ll
https://codeforces.com/contest/1183/problem/C

#include<deque>
using namespace std;
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

#define forn(i,n)  for(int i=0;i<n;i++)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define mp make_pair
#define pb push_back
#define fi first
#define se second

typedef long long ll;
const int maxn=3e5+5;	
const int INF=0x3f3f3f3f;
const ll inf=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7;


int ww[maxn];
ll q,k,n,a,b;

int main(){
	cin>>q;
	while(q--){
		cin>>k>>n>>a>>b;
		
		if(k>n*a){
			cout<<n<<endl;
			continue;
		}
		else{
			ll cha=0;
			cha=k-n*a;
			cha=-cha;
			cha++;	//从a->b 降级成b 1轮腾出来电量diff 需要腾出来几轮 需要几轮b 
			ll diff=a-b;
			ll turns=0;
			turns=(cha+diff-1)/diff;//小数上取整 
			if(turns>n)	//弥补 把他变成b 
				cout<<-1<<endl; //全为b  边玩边充电都不行
			else
				cout<<n-turns<<endl;	//n-b=a的轮数
		}
	}
	return 0;
}