CF1260B.Obtain Two Zeroes
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given two integers a and b . You may perform any number of operations on them (possibly zero).
During each operation you should choose any positive integer x and set a:=a−x , b:=b−2x or a:=a−2x , b:=b−x . Note that you may choose different values of x in different operations.
Is it possible to make a and b equal to 0 simultaneously?
Your program should answer t independent test cases.
输入格式
The first line contains one integer t ( 1≤t≤100 ) — the number of test cases.
Then the test cases follow, each test case is represented by one line containing two integers a and b for this test case ( 0≤a,b≤109 ).
输出格式
For each test case print the answer to it — YES if it is possible to make a and b equal to 0 simultaneously, and NO otherwise.
You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).
输入输出样例
输入#1
3 6 9 1 1 1 2
输出#1
YES NO YES
说明/提示
In the first test case of the example two operations can be used to make both a and b equal to zero:
- choose x=4 and set a:=a−x , b:=b−2x . Then a=6−4=2 , b=9−8=1 ;
- choose x=1 and set a:=a−2x , b:=b−x . Then a=2−2=0 , b=1−1=0 .