寒假集训_专题一题解_L - 二分？？？ （CodeForces - 1260B ）

题目

B. Obtain Two Zeroes
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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).

Example
input
3
6 9
1 1
1 2
output
YES
NO
YES
Note

题目大意

给你两个正数a,b，问是否能够经过以下若干次操作把a、b同时变为0
1.a:=a−x, b:=b−2x（x为正整数）
2.a:=a−2x, b:=b−x（x为正整数）

题解

经过分析不难得出：若a<b，a+b为3的倍数且a>=2b就可以

代码

#include <iostream>

using namespace std;

int main()
{
	int a,b,T;
	cin>>T;
	while(T--)
	{
		cin >> a >> b;
		if(a>b)swap(a,b);
		if((a+b)%3==0&&a*2>=b)printf("YES\n");
		else printf("NO\n");
	}
	return 0;
}