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.
4 75 150 75 50
Yes
3 100 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(混着乘),问这n个数最后能否变为一个数。
思路:如果这n个数乘2和乘3后是同一个数,那么它们除2除3后也是同一个数,即他们是由同一个数经过这些操作的到的。比如样例给的75、150、50。这三个数是由25经过这些变换得来的。每个数相差几个乘2或乘3的操作。所以它们经过变换后一定可以变为同一个数。我们用set的去重功能来判断最后是否是同一个数。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
using namespace std;
set<int>a;
int n;
int main()
{
int i,j,k,t;
while(cin>>n)
{
for(i=0;i<n;i++)
{
scanf("%d",&k);
while(k%2==0)k/=2;
while(k%3==0)k/=3;
a.insert(k);
}
if(a.size()==1)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
return 0;
}