Codeforces Round #201 (Div. 1) / 346A Alice and Bob (数论&想法题)
来源:互联网 发布:淘宝实时访客其他来源 编辑:程序博客网 时间:2024/05/22 16:08
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following moves. During each move, either Alice or Bob (the player whose turn is the current) can choose two distinct integers x and y from the set, such that the set doesn't contain their absolute difference |x - y|. Then this player adds integer |x - y| to the set (so, the size of the set increases by one).
If the current player has no valid move, he (or she) loses the game. The question is who will finally win the game if both players play optimally. Remember that Alice always moves first.
The first line contains an integer n (2 ≤ n ≤ 100) — the initial number of elements in the set. The second line contains n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the elements of the set.
Print a single line with the winner's name. If Alice wins print "Alice", otherwise print "Bob" (without quotes).
22 3
Alice
25 3
Alice
35 6 7
Bob
Consider the first test sample. Alice moves first, and the only move she can do is to choose 2 and 3, then to add 1 to the set. Next Bob moves, there is no valid move anymore, so the winner is Alice.
思路:
两个观察:
1. 数组6,8,10的结果和数组3,4,5的结果相同——求n个数的最大公约数
2. 数组3,5,7(最大公约数为1)的最终结果为1,2,3,4,5,6,7——移动次数 = 最大数 - n
综上得:移动次数 = 最大数/gcd - n
完整代码:
/*30ms,0KB*/#include<cstdio>#include<algorithm>using namespace std;int num[105];int gcd(int a, int b){return b ? gcd(b, a % b) : a;}int main(void){int n, temp = 0;scanf("%d", &n);for (int i = 0; i < n; ++i){scanf("%d", &num[i]);temp = max(temp, num[i]);}int maxn = temp;for (int i = 0; i < n - 1; ++i)for (int j = i + 1; j < n; ++j){int k = gcd(num[i], num[j]);temp = gcd(temp, k); ///求n个数的gcd}int movetimes = maxn / temp - n; ///移动次数 = 最大数/gcd - 数的个数puts(movetimes & 1 ? "Alice" : "Bob");return 0;}
- Codeforces Round #201 (Div. 1) / 346A Alice and Bob (数论&想法题)
- codeforces-346A-Alice and Bob【数论】
- Codeforces Round #201 (Div. 1) A. Alice and Bob(数学)
- Codeforces Round #201 (Div. 2) C. Alice and Bob
- Codeforces Round #201 (Div. 2) C. Alice and Bob ( 数学
- Codeforces Round #6——C. Alice, Bob and Chocolate(想法题)
- [CodeForces 346A]Alice and Bob[数学]
- CodeForces 346A Alice and Bob
- CodeForces 346A Alice and Bob
- Codeforces Round #201 (Div. 2) 347C Alice and Bob(脑洞)
- Codeforces Beta Round #6 (Div. 2 Only) C. Alice, Bob and Chocolate
- Codeforces Round #325 (Div. 2) E. Alice, Bob, Oranges and Apples
- Alice and Bob (CodeForces
- Alice and Bob CodeForces
- A:Alice and Bob
- CF 346A Alice and Bob
- Codeforce 346A. Alice and Bob
- 【博弈】Alice and Bob CodeForces
- 从一道题谈C++中构造函数调用构造函数
- Clash of Clans(COC)资源打包相关技巧探密
- 百度PC客户端研发 2014校招秋季笔试题
- js正则表达式进行格式校验
- apache开启gzip的方法
- Codeforces Round #201 (Div. 1) / 346A Alice and Bob (数论&想法题)
- CODE 40: Restore IP Addresses
- 九度OnlineJudge之1029:魔咒词典
- PHP循环函数使用介绍之PHP基础入门教程
- Working Practice-别再卧室里工作
- 30 Useful Linux Commands for System Administrators【很基础的命令】
- eclipse运行 Maven Test命令时控制台输出乱码的解决办法
- 精通JAVA的25个标准
- 多线程编程