Codeforces Round #426 (Div. 2)-C. The Meaningless Game
来源:互联网 发布:松下机械手如何编程 编辑:程序博客网 时间:2024/06/01 18:56
题目: C. The Meaningless GameSlastyona 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 theround. After that, the winner's score is multiplied byk2, and the loser's score is multiplied byk. 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.
InputIn the first string, the number of games n(1 ≤ n ≤ 350000) is given.
Each game is represented by a pair of scoresa, b(1 ≤ a, b ≤ 109) – the results of Slastyona and Pushok, correspondingly.
OutputFor 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).
ExampleInput62 475 458 816 16247 9941000000000 1000000
OutputYesYesYesNoNoYes
NoteFirst game might have been consisted of one round, in which the number2 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 number5, and in the second one, Pushok would have barked the number3.
题意:两个数初始值为1,每回合后一个数*k,另一个数*(k^2),问能不能得到a和b。
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 theround. After that, the winner's score is multiplied byk2, and the loser's score is multiplied byk. 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.
In the first string, the number of games n(1 ≤ n ≤ 350000) is given.
Each game is represented by a pair of scoresa, b(1 ≤ a, b ≤ 109) – the results of Slastyona and Pushok, correspondingly.
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).
62 475 458 816 16247 9941000000000 1000000
YesYesYesNoNoYes
First game might have been consisted of one round, in which the number2 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 number5, and in the second one, Pushok would have barked the number3.
思路:如果a*b为某个数的立方,且这个数能被a和b整除,说明能得到a和b
CODE:
#include<bits/stdc++.h>using namespace std;int fun(__int64 c){ int l=1,r=1e6; __int64 mid; while(l<=r){ mid=(l+r)/2; if(mid*mid*mid==c) return mid; if(mid*mid*mid<c) l=mid+1; else r=mid-1; } return 0;}int main(){ int n; __int64 a,b; scanf("%d",&n); while(n--){ scanf("%I64d%I64d",&a,&b); __int64 mid=fun(a*b); if(mid&&a%mid==0&&b%mid==0) puts("Yes"); else puts("No"); } return 0;}
- Codeforces Round #426 (Div. 2) C. The Meaningless Game C. The Meaningless Game
- (Codeforces Round #426 (Div. 2)) C.The Meaningless Game
- Codeforces Round #426 (Div. 2) C. The Meaningless Game
- Codeforces Round #426 (Div. 2)-C. The Meaningless Game
- Codeforces Round #426 (Div. 2) C The Meaningless Game
- Codeforces Round #426 (Div. 2) C. The Meaningless Game
- Codeforces Round #426 (Div. 2) C. The Meaningless Game
- Codeforces Round #426 (Div. 2) C The Meaningless Game
- Codeforces Round #426 (Div. 2) C:The Meaningless Game The Meaningless Game
- Codeforces Round #426 (Div. 2)The Meaningless Game(思维+二分)
- Codeforces Round #426 (Div. 2)The Meaningless Game(思维+二分)
- Codeforces Round #426 (Div. 2)The Meaningless Game【数学题】【水题】
- Codeforces Round #426 (Div. 2)The Meaningless Game(思维+二分)
- Codeforces Round #426 (Div. 2) C. The Meaningless Game 思维 D. The Bakery dp
- Codeforces Round #426 (Div. 2) B.The Festive Evening+C.The Meaningless Game
- C. The Meaningless Game(Codeforces Round #426 (Div. 2) C)
- Codeforces Round #426 (Div. 2) C. The Meaningless Game & A, B题代码及错误总结
- Codeforces Round #426 (Div. 2) A B C The Meaningless Game
- 深搜与广搜的区别
- Codeforces Round #426 (Div. 2) A The Useless Toy
- CreateThread,_beginthread与AfxbeginThread之间的区别
- RecyclerView Item 布局宽高无效问题探究
- ubuntu kvm+qemu 加载USB
- Codeforces Round #426 (Div. 2)-C. The Meaningless Game
- SSO单点登录
- 【Echarts 自用总结】Y轴刻度在右侧并且在标线上方
- 【代码笔记】iOS-MBProgressHUD+MJ
- Android FastJson使用的四种方式
- Samba服务 —— 连接windows共享文件
- 视频传输专用无线网桥
- Mapped Statements collection does not contain value for
- JPA Advanced Mappings(映射)