一道小题目

题目：
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.

Input
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).

Output
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).

大致题意：
给出两个整数 一种 和 b。您可以对它们执行任意数量的操作（可能为零）。

在每次操作期间，您应该选择任何正整数 X 并设置 a ：= a − x， b ：= b − 2 x 要么 a ：= a - 2 x， b ：= b − x。请注意，您可以选择不同的值X 在不同的操作中。

有可能使 一种 和 b 等于 0 同时？

您的程序应回答 Ť 独立的测试用例。

题解：
这是一道数学规律题，先令a>b，因为令x=b，a最小也是a-2b，若其大于0，那么必然不成立，直接输出“NO”，并结束这次循环。假设执行第一个操作n次，第二个操作m次，所以a-2n-m=0,b-n-2m=0,两式相见并化简可得(a+b)/3==n+m，又因为n，m都为整数，所以只要令（a+b）为3的倍数即可。

代码如下：

#include<iostream>
#include<algorithm>

using namespace std;

int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int a,b;
		cin>>a>>b;
		if(a<b) swap(a,b);
		if(a>2*b) 
		{
			cout<<"NO"<<endl;
			continue;
		}
		if((a+b)%3==0) cout<<"Yes"<<endl;
		else cout<<"NO"<<endl;
	}
	return 0;
}