cf1260B(div2)

秒掉的水题

题意:

• 给定两个数$a,b$
• 现有如下操作
• • a-=x, b-=2x
• • b-=x, a-=2x
• x是正整数
• 现问能不能同时使得这两个数等于0

数据范围: $n\le 1e9$

>> face <<

前置技能:无

Tutorial: 枚举几个例子, 发现a,b的有效范围是相互的两倍内. 在有效范围内可以贪心每次减3的倍数, 最后只用判断最后的余数就好了

#include <bits/stdc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
int nxt()
{
	int ret;
	scanf("%d", &ret);
	return ret;
}
const int maxn = 2e5 + 10;
signed main(){
	int n = nxt();
	while(n--){
		int a = nxt(), b = nxt();
        if(a*2 < b || b*2 < a){
            cout << "NO" << endl;
            continue;
        }
        a %= 3, b %= 3;
        if(a == 0 && b == 0){
            cout << "YES" << endl;
        }else if(a == b*2 || b== a*2){
            cout << "YES" << endl;
        }else cout << "NO" << endl;
	}
}