CodeForces807c_二分+思维

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, or3 / 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.

题意：

现在某某某要交题，他目前的交题情况是交了y次过了x次，但他希望自己的提交变成交q次过p次的比率，现在他有两种操作，一是成功交过一次，二是不成功交过。

问他一共至少需要交几次才能满足条件。

解：

这个问题数据量比较大，用暴力过不了。

换个思维，直接找倍数。

例如：

7  14  3  8

这一组中，最后14->24，7->9，可以看到其实需要将14和7分别变成8和3的倍数就行。那么就可以找p和q的扩大的最小倍数了。

但需要满足y的增加量要大于或等于x的增加量，且p和q互质，p和q扩大后均需要比x和y大。

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b)
{  if(b==0) return a;
   return gcd(b,a%b);
}
int main()
{   int t;
   ll x,y,p,q;
   double a,b;
   scanf("%d",&t);
   while(t--)
   {   scanf("%lld%lld%lld%lld",&x,&y,&p,&q);

        double a=(double)x/y,b=(double)p/q;  
        ll k=y;
        ll mm=gcd(p,q);
        p/=mm;q/=mm;
        if(x*q==y*p)  //这题有点坑啊，单纯判断a与b的值会出错过不了，卡精度。
        {   
            printf("0\n");
            continue;
        }
        if(a>1||b>=1||b==0)
        {
            puts("-1");
             continue;
        }
        ll l=1,r=1000200000;
        while(l<=r)
        {
           long long int mid=(l+r)/2;
           if(mid*q>=y&&mid*p>=x&&mid*q-y>=mid*p-x&&mid*p-x>=0)
           r=mid-1;
           else
           l=mid+1;
        }
        printf("%lld\n",l*q-k);
   }
    return 0;
}