CF833A.The Meaningless Game
普及+/提高
通过率:0%
时间限制:1.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述

Slastyona and her loyal dog Pushok are playing a meaningless game that is indeed very interesting.
The game consists of multiple rounds. Its rules are very simple: in each round, a natural number k is chosen. Then, the one who says (or barks) it faster than the other wins the round. After that, the winner's score is multiplied by _k_2, and the loser's score is multiplied by k. In the beginning of the game, both Slastyona and Pushok have scores equal to one.
Unfortunately, Slastyona had lost her notepad where the history of all n games was recorded. She managed to recall the final results for each games, though, but all of her memories of them are vague. Help Slastyona verify their correctness, or, to put it another way, for each given pair of scores determine whether it was possible for a game to finish with such result or not.

斯拉丝托娜(Slastyona)和她忠诚的狗普什奥克(Pushok)正在玩一个看似毫无意义、实则非常有趣的游戏。
该游戏由多轮组成,规则极其简单:每轮中选定一个正整数 k;谁先说出(或吠出)该数,谁就赢得该轮。随后,获胜者的得分乘以 k2,失败者的得分乘以 k。游戏开始时,斯拉丝托娜和普什奥克的得分均为 1。
不幸的是,斯拉丝托娜遗失了记录全部 n 局游戏历史的笔记本。不过,她仍能回忆起每局游戏的最终得分结果,尽管这些记忆都已相当模糊。请帮助斯拉丝托娜验证这些结果是否正确;换言之,对每一对给定的最终得分,判断是否存在某种合法的游戏过程,使其以该结果结束。
输入格式
In the first string, the number of games n (1 ≤ n ≤ 350000) is given.
Each game is represented by a pair of scores a, b (1 ≤ a, b ≤ 109) – the results of Slastyona and Pushok, correspondingly.
第一行给出比赛场数 n(1 ≤ n ≤ 350000)。
每场比赛由一对分数 a、b(1 ≤ a,b ≤ 109)表示,分别对应 Slavyona 和 Pushok 的得分。
输出格式
For each pair of scores, answer "Yes" if it's possible for a game to finish with given score, and "No" otherwise.
You can output each letter in arbitrary case (upper or lower).
对于每一对得分,请判断是否存在一局游戏能以给定的比分结束:若可能,输出“Yes”;否则,输出“No”。
每个字母的大小写可任意(大写或小写均可)。
输入输出样例
输入#1
6 2 4 75 45 8 8 16 16 247 994 1000000000 1000000
输出#1
Yes Yes Yes No No Yes
说明/提示
First game might have been consisted of one round, in which the number 2 would have been chosen and Pushok would have won.
The second game needs exactly two rounds to finish with such result: in the first one, Slastyona would have said the number 5, and in the second one, Pushok would have barked the number 3.
第一局游戏可能只进行了一轮,其中选择的数字是 2,Pushok 获胜。
第二局游戏恰好需要两轮才能得到这样的结果:在第一轮中,Slastyona 说出数字 5;在第二轮中,Pushok 喊出数字 3。
输入解题思路,AI测评打分。不知道怎么写?