codeforces-346A-Alice and Bob【数论】
来源:互联网 发布:spss无法输入数据 编辑:程序博客网 时间:2024/05/02 01:47
codeforces-346A-Alice and Bob【数论】
time limit per test2 seconds memory limit per test256 megabytes
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.
Input
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.
Output
Print a single line with the winner’s name. If Alice wins print “Alice”, otherwise print “Bob” (without quotes).
input
2
2 3
output
Alice
input
2
5 3
output
Alice
input
3
5 6 7
output
Bob
Note
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.
题目链接:cf-346A
题目大意:A和B两个人进行游戏,每人轮流操作。
1.从这个序列中取两个数字,
2.这两个数字的差值temp原先并不存在在序列中。
3.将temp放进序列
最先无法进行操作的一方输。
题目思路:游戏结束的标志是无法取出两个数字,他们的差值不在序列中。也就是说,最终状态是一个首项等于公差的等差序列。求出这个等差数列的项数-n,就是游戏进行的回合。所以我们要先求出首项。设首项为d,接下来就是d+d,d+2d….后面几项都是首项的倍数,所以我们可以用gcd(a1,a2,a3…an)求出。ans = an / gcd(a1,a2..an) - n;
以下是代码:
#include <vector>#include <map>#include <set>#include <algorithm>#include <iostream>#include <cstdio>#include <cmath>#include <cstdlib>#include <string>#include <cstring>using namespace std;int a[100005];int main(){ int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a,a + n); int g = a[0]; for (int i = 1; i < n; i++) g = __gcd(a[i],g); int ans = a[n - 1] / g - n; if (ans % 2) cout << "Alice\n"; else cout << "Bob" << endl; return 0;}
- codeforces-346A-Alice and Bob【数论】
- [CodeForces 346A]Alice and Bob[数学]
- CodeForces 346A Alice and Bob
- CodeForces 346A Alice and Bob
- Codeforces Round #201 (Div. 1) / 346A Alice and Bob (数论&想法题)
- 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
- Alice, Bob and Chocolate CodeForces
- A. Alice and Bob----最大公约数
- CF 346A(Alice and Bob-Python,sort)
- ZOJ 3529 A Game Between Alice and Bob (数论+SG博弈)
- codeforces 6C - Alice, Bob and Chocolate
- CodeForces 347 C. Alice and Bob
- Codeforces 6C. Alice, Bob and Chocolate
- 两台Mysql数据库数据同步实现
- iOS des加密 16进制输出 代码
- Java中堆内存和栈内存详解
- NPOI2.2.0.0实例详解(二)—使用NPOI创建EXCEL
- 分享+ 在根视图scrollView里面添加子视图
- codeforces-346A-Alice and Bob【数论】
- 【设计模式】策略模式——以商场促销为例
- UI视图控件、视图嵌套、SubView、Tag 的使用
- netstat命令详解
- Build Settings中的变量@rpath,@loader_path,@executable_path
- 滚动指定UITableViewCell到顶部
- 欧几里得辗转相除法c实现
- spring 五个事务隔离级别和七个事务传播行为
- string和stringstream用法总结