A15322 | $Burenka Plays with Fractions$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Burenka came to kindergarden. This kindergarten is quite strange, so each kid there receives two fractions ( $\frac{a}{b}$ and $\frac{c}{d}$ ) with integer numerators and denominators. Then children are commanded to play with their fractions. Burenka is a clever kid, so she noticed that when she claps once, she can multiply numerator or denominator of one of her two fractions by any integer of her choice (but she can't multiply denominators by $0$ ). Now she wants know the minimal number of claps to make her fractions equal (by value). Please help her and find the required number of claps!

The first line contains one integer $t$ ( $1 \leq t \leq 10^4$ ) — the number of test cases. Then follow the descriptions of each test case. The only line of each test case contains four integers $a$ , $b$ , $c$ and $d$ ( $0 \leq a, c \leq 10^9$ , $1 \leq b, d \leq 10^9$ ) — numerators and denominators of the fractions given to Burenka initially.

For each test case print a single integer — the minimal number of claps Burenka needs to make her fractions equal.

输入 #1

8
2 1 1 1
6 3 2 1
1 2 2 3
0 1 0 100
0 1 228 179
100 3 25 6
999999999 300000000 666666666 100000000
33 15 0 84

输出 #1

C++ 编辑器

输入

输出