A. Bear and Poker
来源:互联网 发布:手机淘宝1元秒杀入口 编辑:程序博客网 时间:2024/04/29 08:23
Limak is an old brown bear. He often plays poker with his friends. Today they went to a casino. There are n 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 numbers a1, 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.
解题说明:此题要求一组数中的元素乘以2或者乘以3后得到的数都一样,其实就是判断这些数除去2和3这些因子后剩下的因子都是一样的即可。
#include<stdio.h>#include <string.h>#include<iostream>#include<algorithm>using namespace std;int main(){int i, ans = 1, n, a[100002];scanf("%d", &n);for(i=0; i<n; i++){scanf("%d", a+i);while(a[i]%2 == 0){a[i] /= 2;}while(a[i]%3 == 0){a[i] /= 3;}}for(i = 1; i < n; i++){if (a[i-1] != a[i]){ans = 0;break;}}if (ans == 1){printf("Yes\n");}else{printf("No\n");}return 0;}
- A. Bear and Poker
- CF 573A(Bear and Poker-GCD)
- CodeForces #318 (div1) A.Bear and Poker
- Codeforces 573 A. Bear and Poker
- coderforce 573A Bear and Poker
- Codeforces-573A-Bear and Poker
- codeforces 573A Bear and Poker
- Bear and Poker
- Bear and Poker CodeForces
- CodeForces 574C - Bear and Poker
- Codeforces Round #318 C - Bear and Poker
- Codeforces Round #318-(C. Bear and Poker)
- Codeforces Round #318 Bear and Poker(数学题)
- Codeforces 574C Bear and Poker【思维】
- Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1) A. Bear and Poker gcd
- A. Bear and Raspberry
- A. Bear and Elections
- A. Bear and Game
- CentOS下安装配置LAMP(Linux+Apache+MySQL+PHP)
- UI多线程编程小练习--卖票系统
- 欢迎使用CSDN-markdown编辑器
- 创建String类型的数组,动态初始化数组
- opencv学习笔记(二)—显示图像
- A. Bear and Poker
- 文章标题
- Tsung简易教程-CentOS版
- 自定义控件的四种模式
- JAVA创建TXT,并写入数据
- 自学Java系列 笔记1 java的基本语法2
- 数字对象(NSNumber)常用的方法
- 倒推序列,如b[i]0 1 0(前面有几个数比b[i] 大)推a[i]2 1 3 ,树状数组 SPOJ 227 Ordering the Soldiers
- leetCode4.1.2(Longest Valid Parentheses)