Codeforces 347C - Alice and Bob

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/a1s4z5/article/details/52981692

每一回合挑选集合中的两个数x,y, 满足|xy|不在集合中,然后把|xy|加到集合里。给出集合最初的n个数问是否先手必胜。


游戏结束的时候最小的数就是这n个数的gcd,最大的数就是一开始给出的集合的最大的数。

游戏结束的时候的集合的大小就是结束时

这样就可以得出游戏进行的步数,然后就可以得到结果了


#include<bits/stdc++.h>
using namespace std;

const int maxn = 120;

int arr[maxn];

int main(){
    int n;
    cin>>n;
    for(int i = 0;i<n;i++) cin>>arr[i];
    int v = arr[0];
    for(int i = 1;i<n;i++) v = __gcd(v,arr[i]);
    int siz = *max_element(arr,arr+n) / v - n;
    cout<<((siz&1)?"Alice":"Bob")<<endl;
    return 0;
}
阅读更多

Alice and Bob

04-06

"Alice and Bob take turns choosing one of the numbers, and replace it with one of its positive factor but not itself. The one who makes the product of all numbers become 1 wins."nnAlice and Bob meet again this week, they played the game as description above last week. But Bob is so stupid that he had to spend lots of time on picking up "one of the number's factor but not itself". So Alice puts up a new game which needn't deal with the number. Here comes the problem.nnAlice and Bob take turns choosing one of the toys to move on the map, at the beginning of the game, they have M toys to choose. At each turn, they must choose one toy on the map, and make it move, the toy which the player chooses to move would not stay in the same place as last turn. There are N places on the map, naming 1, 2, 3, ..., N-1, N, the initial places of M toys are among these 1, 2, 3, ..., N-1 places, except the place N. Each of the M toys has a distinct initial place. If two different toys arrive at the same place, the operation is also valid. Finally, the place N is the terminal place. After the toy is moved to the place N, it will be eliminated from the map. Of course the eliminated toys cannot be moved again. And notice that we assume Alice takes the first turn. The one who has no toys to move is the loser. Notice that even there are toys remaining on the map, it has the possibility that the player cannot move any toys forward. The player would lose in this situation. See the Case 2 in the Sample Input section.nnThe map is assured to be a directed acyclic graph and the map would not change in the game. As the one of the cleverest programmers in the world, you are asked to place the toys on the map (That means that you decide the value of M and the initial places of these M toys). So, you want to know that who will win in your arrangement, assuming both of them are clever enough to play this game. The number of the edges between places is no more than 100000.nnInputnnThere are multiple test cases. Each case begins with an integer N (1 ≤ N ≤ 10000) in one line. In the following N-1 lines, ith(1≤ i ≤N-1) line describe the places where place naming i can arrive. "Ci p1 p2 ... pCi" implies that the number of places i can arrive totally Ci places, p1, p2, ..., pCi respectively.nnThen input comes with an integer Q in one line. In the fowllowing Q(1≤ Q ≤ 100) lines, it containes an integer M(1≤ M ≤ N-1) and the name of M distinct places, which are the initial places of M toys at the beginning of the game.nThere would not be any empty lines between cases.nnOutputnnFor each case, the output begins with "Case c:" in one line, where c indicates the case number. Then print exactly one line for each query in each test case. If the winner would be Alice, print "Alice", otherwise print "Bob".nnSample Inputnn4n2 2 3n1 4n1 4n3n1 1n1 2n2 1 2n4n2 2 3n1 4n0n2n1 3n2 3 1n10n1 2n1 3n1 4n1 5n1 6n1 7n1 8n1 9n1 10n3n1 1n5 1 2 3 4 5n9 1 2 3 4 5 6 7 8 9nSample OutputnnCase 1:nBobnAlicenAlicenCase 2:nBobnAlicenCase 3:nAlicenAlicenAlice

没有更多推荐了,返回首页