数论

数论&找规律

description：

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.

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).

解题思路：

最终都会变为以公差为d的等差数列，d就是这几个数的最大公约数，所以总共移动的歩数就是 Max/d-num Max是最大的数，num是总共多少个数

Code

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int gcd(int a,int b){
    int temp;
    while(a%b){
        temp=a%b;
        a=b;
        b=temp;
    }
    return b;
}
int main(){
    int a[300],num,Max=-1;
    while(scanf("%d",&num)!=EOF){
        Max=-1;
        for(int i=0;i<num;i++){
            scanf("%d",&a[i]);
            Max=Max>a[i]?Max:a[i];
        }       
        int Gcd=gcd(a[0],a[1]);
        for(int i=2;i<num;i++){
            Gcd=gcd(Gcd,a[i]);
        }
        int cnt=Max/Gcd-num;
        cnt%2==0?printf("Bob\n"):printf("Alice\n");
    }
    return 0;
}