CF 573A(Bear and Poker-GCD)

A. Bear and Poker
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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.

Sample test(s)
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.



   把每个数除以总gcd,观察它们有无非2,3的因子




#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (100010)
typedef long long ll;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int a[MAXN],n;
int gcd(int a,int b){if (b==0) return a;return gcd(b,a%b);}
int main()
{
//	freopen("C.in","r",stdin);
//	freopen(".out","w",stdout);
	
	cin>>n;
	
	For(i,n)
		scanf("%d",&a[i]);
	int p=a[1];
	Fork(i,2,n) p=gcd(p,a[i]);
	
	For(i,n) a[i]/=p;
	For(i,n) 
	{
		while(a[i]%2==0) a[i]/=2;
		while(a[i]%3==0) a[i]/=3;
		if (a[i]^1) {
			puts("No");return 0;
		}
		
	}	
			
	puts("Yes");
	return 0;
}





  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
As an AI language model, I can provide you with some guidance on how to implement a Texas Hold'em poker game in Clojure. However, I cannot write the entire code for you. Here are the general steps you can follow: 1. Define the data structures for the game, such as the deck of cards, player hands, and the community cards. 2. Write functions to shuffle the deck, deal the cards, and determine the winner of the game. 3. Implement the game logic, including the betting rounds, the flop, the turn, and the river. 4. Create a user interface for the game, which can be either a command-line interface or a graphical interface. Here is some sample Clojure code to get you started: ```clojure (def suits [:hearts :diamonds :clubs :spades]) (def ranks [:2 :3 :4 :5 :6 :7 :8 :9 :10 :J :Q :K :A]) (defn make-deck [] (for [suit suits rank ranks] {:suit suit :rank rank})) (defn shuffle-deck [deck] (shuffle deck)) (defn deal-hand [deck] (take 2 deck)) (defn deal-flop [deck] (take 3 (drop 2 deck))) (defn deal-turn [deck] (take 1 (drop 5 deck))) (defn deal-river [deck] (take 1 (drop 6 deck))) (defn evaluate-hand [hand community-cards] ;; Implement the hand evaluation logic here ) (defn determine-winner [hands community-cards] (let [evaluated-hands (map #(evaluate-hand % community-cards) hands) max-hand (apply max evaluated-hands)] (nth hands (.indexOf evaluated-hands max-hand)))) (defn play-game [] (let [deck (make-deck) shuffled-deck (shuffle-deck deck) player-hands (for [_ (range 4)] (deal-hand shuffled-deck)) flop (deal-flop shuffled-deck) turn (deal-turn shuffled-deck) river (deal-river shuffled-deck) community-cards (concat flop turn river)] (determine-winner player-hands community-cards))) ;; Example usage: (play-game) ``` This is just a basic implementation, and you will need to add more features to make it a fully functional game. Good luck!

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值