CodeFroces 412.C Success Rate

C. Success Rate

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are an experienced Codeforces user. Today you found out that during your activity on Codeforces you have made y submissions, out of which x have been successful. Thus, your current success rate on Codeforces is equal to x / y.

Your favorite rational number in the [0;1] range is p / q. Now you wonder: what is the smallest number of submissions you have to make if you want your success rate to be p / q?

Input

The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases.

Each of the next t lines contains four integers x, y, p and q (0 ≤ x ≤ y ≤ 109; 0 ≤ p ≤ q ≤ 109; y > 0; q > 0).

It is guaranteed that p / q is an irreducible fraction.

Hacks. For hacks, an additional constraint of t ≤ 5 must be met.

Output

For each test case, output a single integer equal to the smallest number of submissions you have to make if you want your success rate to be equal to your favorite rational number, or -1 if this is impossible to achieve.

Example

input

4
3 10 1 2
7 14 3 8
20 70 2 7
5 6 1 1

output

4
10
0
-1

Note

In the first example, you have to make 4 successful submissions. Your success rate will be equal to 7 / 14, or 1 / 2.

In the second example, you have to make 2 successful and 8 unsuccessful submissions. Your success rate will be equal to 9 / 24, or 3 / 8.

In the third example, there is no need to make any new submissions. Your success rate is already equal to 20 / 70, or 2 / 7.

In the fourth example, the only unsuccessful submission breaks your hopes of having the success rate equal to 1.

题目大意：给出你的AC数目x，提交数目y，要求你凑成p/q,你可以AC一些题目，使得x+1，y+1，也可以故意WA，使得y+1.问，最少要多少步达到p/q。

我这边的方法是二分，一开始很蠢的二分了提交数目，并不ok。后来别人告诉我二分一下p/q的倍数k，因为只要你恰好使得k * p - x <= k * q - y，那么答案就出来了，

就是k*q-y。但是要注意一些细节，比如，你的k*p-x要大于等于0，k*q-y也一样。最后二分完判断时候发现上界和下界竟然都不满足这两个条件，那么就是不存在，输出-1.

代码如下：

#include<bits/stdc++.h>
using namespace std;
long long x, y, p, q;

long long slove()
{
	long long s = 0, e = 1e9 + 7;
	while(s < e - 1)
	{
		int mid = (s + e) / 2;
		if(mid * p >= x && mid * q >= y && mid * p - x <= mid * q - y)
			e = mid;
		else
			s = mid;
	}
	if(s * p >= x && s * q >= y && s * p - x <= s * q - y)
		return s * q - y;
	else if(e * p >= x && e * q >= y && e * p - x <= e * q - y)
		return e * q - y;
	else
		return -1;
}

int main()
{
	int T;
	long long ans;
	cin >> T;
	while(T--)
	{
		scanf("%d%d%d%d", &x, &y, &p, &q);
		ans = slove();
		cout << ans << endl;
	}
	return 0;
 } 

这里涉及到乘法，所以切记一定要用long long，否则会爆int。