每日一题第五十二期 Codeforces Round 871 (Div. 4)

最新推荐文章于 2024-09-13 16:27:15 发布

娇娇yyyyyy

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量847

点赞数 13

分类专栏：每日一题文章标签：深度优先算法

本文链接：https://blog.csdn.net/2301_80882026/article/details/137154428

版权

每日一题专栏收录该内容

97 篇文章 1 订阅

订阅专栏

D. Gold Rush

time limit per test: 2 seconds

memory limit per test: 256 megabytes

input: standard input

output: standard output

Initially you have a single pile with $n$ gold nuggets. In an operation you can do the following:

Take any pile and split it into two piles, so that one of the resulting piles has exactly twice as many gold nuggets as the other. (All piles should have an integer number of nuggets.)

One possible move is to take a pile of size $6$ and split it into piles of sizes $2$ and $4$ , which is valid since $4$ is twice as large as $2$ .

Can you make a pile with exactly $m$ gold nuggets using zero or more operations?

Input

The first line contains an integer $t$ ( $\leq t \leq 1000$ ) — the number of test cases.

The only line of each test case contains two integers $n$ and $m$ ( $\leq n, m \leq 10^7$ ) — the starting and target pile sizes, respectively.

Output

For each test case, output “YES” if you can make a pile of size exactly $m$ , and “NO” otherwise.

You can output the answer in any case (for example, the strings “yEs”, “yes”, “Yes” and “YES” will be recognized as a positive answer).

Example
inputCopy
11
6 4
9 4
4 2
18 27
27 4
27 2
27 10
1 1
3 1
5 1
746001 2984004
outputCopy
YES
YES
NO
NO
YES
YES
NO
YES
YES
NO
NO

Note

The first test case is pictured in the statement. We can make a pile of size $4$ .

In the second test case, we can perform the following operations: $\{\color{red}{9}\} \to \{\color{red}{6},3\} \to \{4,2,3\}$ . The pile that is split apart is colored red before each operation.

In the third test case, we can’t perform a single operation.

In the fourth test case, we can’t end up with a larger pile than we started with.

AC代码：

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<numeric>
//#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int>PII;
const int N=3e5+10;
const int MOD=998244353;
const int INF=0X3F3F3F3F;
const int dx[]={-1,1,0,0,-1,-1,+1,+1};
const int dy[]={0,0,-1,1,-1,+1,-1,+1};
const int M = 1e8 + 10;


int t;

bool dfs(int x, int y)
{
	if((x == y)) return true;
	if(x % 3 != 0 || x < y) return false;
	else return (dfs(x / 3, y) || dfs(x * 2 / 3, y));
}
int main()
{
	cin >> t;
	while(t --){
		int a, b;
		cin >> a >> b;
		if(dfs(a, b)) puts("YES");
		else puts("NO");
	}
	return 0;
}