-
Notifications
You must be signed in to change notification settings - Fork 0
/
B. Monster Gouketsu
49 lines (49 loc) · 1.1 KB
/
B. Monster Gouketsu
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <stdio.h>
int main()
{
long int M,N,X,Y,T,i;
scanf("%ld",&T);
long int arr[T];
for(i=0;i<T;i++)
arr[i]=0;
for(i=0;i<T;i++)
{
scanf("%ld %ld %ld %ld",&M,&N,&X,&Y);
long int l=0,u=N,m,temp;
while(1)
{
m=(l+u)/2;
temp=M;
temp=temp+(N-m)*Y;
if(X*m<=temp)
{
l=m;
arr[i]=m;
if(u-l==1)
{
if(X*u<=(M+(N-u)*Y))//checking if u is a solution
{
arr[i]=u;
break;
}
else//if u is not then l must be the solution
{
arr[i]=l;
break;
}
}
}
else
{
u=m;
if(l==u)
{
arr[i]=l;
break;
}
}
}
}
for(i=0;i<T;i++)
printf("%ld\n",arr[i]);
}