Alice and Bob
来源:互联网 发布:淘宝现代热水器怎么样 编辑:程序博客网 时间:2024/05/16 23:47
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 ofn 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 integersx 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 containsn 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.
//不多少, 找规律题, 设所有数最小公约数为gcd, 个数为n, 最大值为Max。 能移动次数 = Max / gcd - n;#include <iostream>#include <cstdio>#include <algorithm>#define N 120using namespace std;int main(){ int n; int a[N]; scanf("%d", &n); int gcd; scanf("%d", &a[0]); gcd = a[0]; int Max = a[0]; for(int i = 1; i < n; i++) { scanf("%d", &a[i]); gcd = __gcd(a[i], gcd); Max = max(Max, a[i]); } int ans = Max / gcd - n; printf("%s\n", ans % 2 ? "Alice" : "Bob"); return 0;}
- Alice and Bob
- 2683. Alice and Bob
- 1798. Alice and Bob
- hdu4268 Alice and Bob
- HDU4268 Alice and Bob
- Alice, Bob and Chocolate
- hdu4268 Alice and Bob
- A:Alice and Bob
- hdu4111 Alice and Bob
- Alice and Bob
- 1798[Bob and Alice]
- Alice and Bob 数学题
- Alice and Bob
- XTU_1168 Alice and Bob
- SOJ.Alice and Bob
- UPC2222: Alice and Bob
- F:Alice and Bob
- Alice and Bob
- Android内存共享、进程间高性能IO、手动实现 Binder IPC、Aidl例子
- SpringMvc @RequestParam注解全面解析
- HTML小功能
- SpringMVC的Date与String互转
- 单链表快速排序
- Alice and Bob
- 程序设计第一要务——让用户感到“爽”
- html有关知识问答
- 简单的ImageLoader和导入Glide来操作图片
- 2017春招互联网产品经理笔试题整理|腾讯,阿里,京东,网易,头条,去哪儿,携程,人人
- 做硬件调试的菜鸟感悟
- request 获取服务根目录地址
- 多重背包的单调队列优化
- makefile文件