A. Bear ***and Poker***
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?
Input
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.
Output
Print "Yes" (without the quotes) if players can make their bids become equal, or "No" otherwise.
AI 代码解读
题目大意：给你一个数m,同时有m个数arr[i]，如果每个数能够翻倍或者是翻三倍能够使所有的数相等就输出YES，否则输出NO。
解题思路：就是看，每个数除以2或者3看最后的结果是不是相等就行了
上代码：
/*
2015 - 9 - 1 晚上
Author: ITAK
今日的我要超越昨日的我，明日的我要胜过今日的我，
以创作出更好的代码为目标，不断地超越自己。
*/
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 5;
int arr[maxn];
int Judge(int x)
{
while(x%2==0)
x/=2;
while(x%3==0)
x/=3;
return x;
}
int main()
{
int m;
while(~scanf("%d",&m))
{
for(int i=0; i<m; i++)
scanf("%d",&arr[i]);
///cout<<Judge(m)<<endl;
int ans = Judge(arr[0]);
bool flag = false;
for(int i=1; i<m; i++)
{
if(ans != Judge(arr[i]))
{
flag = true;
break;
}
}
if(flag)
puts("NO");
else
puts("YES");
}
return 0;
}
AI 代码解读
