Codeforces Round 725 (Div. 3) |
---|
Finished |
You are given two integers $$$a$$$ and $$$b$$$. In one turn, you can do one of the following operations:
Your goal is to make $$$a$$$ equal to $$$b$$$ using exactly $$$k$$$ turns.
For example, the numbers $$$a=36$$$ and $$$b=48$$$ can be made equal in $$$4$$$ moves:
For the given numbers $$$a$$$ and $$$b$$$, determine whether it is possible to make them equal using exactly $$$k$$$ turns.
The first line contains one integer $$$t$$$ ($$$1 \le t \le 10^4$$$). Then $$$t$$$ test cases follow.
Each test case is contains three integers $$$a$$$, $$$b$$$ and $$$k$$$ ($$$1 \le a, b, k \le 10^9$$$).
For each test case output:
The strings "Yes" and "No" can be output in any case.
8 36 48 2 36 48 3 36 48 4 2 8 1 2 8 2 1000000000 1000000000 1000000000 1 2 1 2 2 1
YES YES YES YES YES NO YES NO
Name |
---|