思路：水题....一直除3然后一直除2就好了
#include<bits\stdc++.h>
using namespace std;
const int maxn = 1e5+6;
int a[maxn];
int main()
{
int n;
cin >> n;
for(int i = 1;i<=n;i++)
cin >> a[i];
for (int i = 1;i<=n;i++)
{
while(a[i]%3==0)
a[i]/=3;
while(a[i]%2==0)
a[i]/=2;
}
int flag = 0;
for(int i = 1;i<n;i++)
if (a[i]!=a[i+1])
{
return puts("No");
}
puts("Yes");
}
C. Bear and Poker
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
Examples
input
4
75 150 75 50
output
Yes
input
3
100 150 250
output
No
Note
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.
