Codeforces 574C Bear and Poker【思维】
来源:互联网 发布:疯狂java讲义第5版 编辑:程序博客网 时间:2024/05/16 01:02
Limak is an old brown bear. He often plays poker with his friends. Today they went to a casino. There aren players (including Limak himself) and right now all of them have bids on the table.i-th of them has bid with size ai dollars.
Each player can double his bid any number of times and triple his bid any number of times. The casino has a great jackpot for making all bids equal. Is it possible that Limak and his friends will win a jackpot?
First line of input contains an integer n (2 ≤ n ≤ 105), the number of players.
The second line contains n integer numbersa1, a2, ..., an (1 ≤ ai ≤ 109) — the bids of players.
Print "Yes" (without the quotes) if players can make their bids become equal, or "No" otherwise.
475 150 75 50
Yes
3100 150 250
No
In the first sample test first and third players should double their bids twice, second player should double his bid once and fourth player should both double and triple his bid.
It can be shown that in the second sample test there is no way to make all bids equal.
题目大意:
给你N个数,每个数都可以进行无限次数的*2或者是*3.
问最终能否使得所有数都相等。
思路:
逆向思维,向上乘,我们不如改变成向下除,乘除等价,我们只要将所有数都无脑/2直到不能除为止开始/3.直到不能除为止。
那么剩下的这个序列如果所有数都相等,那么就是Yes,否则就是No
Ac代码:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[100505];int main(){ int n; while(~scanf("%d",&n)) { for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } for(int i=1;i<=n;i++) { while(a[i]%2==0)a[i]/=2; while(a[i]%3==0)a[i]/=3; } int flag=0; sort(a+1,a+1+n); for(int i=2;i<=n;i++) { if(a[i]!=a[i-1])flag=1; } if(flag==0)printf("Yes\n"); else printf("No\n"); }}
- Codeforces 574C Bear and Poker【思维】
- CodeForces 574C - Bear and Poker
- Codeforces Round #318 C - Bear and Poker
- Codeforces Round #318-(C. Bear and Poker)
- Bear and Poker CodeForces
- Codeforces Round #318 (Div. 2) C - Bear and Poker
- Codeforces 639C Bear and Polynomials 【思维】
- CodeForces #318 (div1) A.Bear and Poker
- Codeforces 573 A. Bear and Poker
- Codeforces Round #318 Bear and Poker(数学题)
- Codeforces-573A-Bear and Poker
- codeforces 573A Bear and Poker
- Codeforces 574D Bear and Blocks【思维】
- Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2)C. Bear and Poker(gcd模拟)
- Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2)C Bear and Poker
- Codeforces Round #405 C. Bear and Different Names (思维)
- Codeforces Round #405 C.Bear and Different Names【思维】
- Codeforces 658C Bear and Forgotten Tree 3【思维】
- bzoj 4516: [Sdoi2016]生成魔咒 后缀数组
- HTML学习(II)
- 《计算机网络》第4章 介质访问控制子层
- 【编译工具】CMake【梳理】(编辑中)
- Spark实践的阶段性总结
- Codeforces 574C Bear and Poker【思维】
- Wait Queue等待队列
- call方法和apply方法的区别
- 【CQBZOJ 2856】[线段树]原子核研究
- Cookie持久化方案——PersistentCookieStore源码解读。
- C4top-直捣黄龙(dijkstra-最短路数目+多重条件判断)
- Android中常用的开发网站
- 装系统
- UBUNTU16常用命令