A12748 | $Maximum Sine$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You have given integers $a$ , $b$ , $p$ , and $q$ . Let $f(x) = \text{abs}(\text{sin}(\frac{p}{q} \pi x))$ . Find minimum possible integer $x$ that maximizes $f(x)$ where $a \le x \le b$ .

Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1 \le t \le 100$ ) — the number of test cases. The first line of each test case contains four integers $a$ , $b$ , $p$ , and $q$ ( $0 \le a \le b \le 10^{9}$ , $1 \le p$ , $q \le 10^{9}$ ).

Print the minimum possible integer $x$ for each test cases, separated by newline.

输入 #1

2
0 3 1 3
17 86 389 995

输出 #1

1
55

C++ 编辑器

输入

输出