CF 346A(Alice and Bob-Python,sort)
2013-09-27 23:29
309 查看
A. Alice and Bob
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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).
Sample test(s)
input
output
input
output
input
output
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.
因为最后凑出来的一定是d,2d,...,nd
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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).
Sample test(s)
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.
因为最后凑出来的一定是d,2d,...,nd
def gcd(a,b): if (b==0): return a else: return gcd(b,a%b) n=input() a=map(int,raw_input().split()) a.sort() g=reduce(gcd,a) print (['Bob','Alice'][(max(a)/g-n)&1])
相关文章推荐
- (中等) CF 585C Alice, Bob, Oranges and Apples,矩阵+辗转相除。
- [CodeForces 346A]Alice and Bob[数学]
- CF 6 C. Alice, Bob and Chocolate
- codeforces-346A-Alice and Bob【数论】
- cf C. Alice and Bob
- Alice and Bob (CodeForces - 346A )
- CF_6C_Alice,BobAndChocolate
- hdu 4371 Alice and Bob
- HDU 4371 Alice and Bob
- HDU-#5054 Alice and Bob
- hdu-4111-Alice and Bob
- 湘潭邀请赛——Alice and Bob
- ZOJ Problem Set - 3666 Alice and Bob(SG)
- codeforces 6C - Alice, Bob and Chocolate
- hdu 3660 Alice and Bob's Trip
- Sicily 13289. Alice and Bob
- 【HDOJ 4268】 Alice and Bob (排序+二分)
- HDU 4268 Alice and Bob [贪心]
- cf - #346 C-Tanya and Toys
- CF 454B(Little Pony and Sort by Shift-序列位移后单调性判断及最小位移[水])