SWUST OJ 99:Euclid‘s Game_starts with two unequal positive numbers (m,n and -CSDN博客

本文链接：https://blog.csdn.net/qq_50983179/article/details/120970954

题目描述

Starts with two unequal positive numbers (M,N and M>N) on the board. Two players move in turn. On each move, a player has to write on the board a positive number equal to the difference of two numbers already on the board; this number must be new, i.e., different from all the numbers already on the board. The player who cannot move loses the game. Should you choose to move first or second in this game?

According to the above rules, there are two players play this game. Assumptions A write a number on the board at first, then B write it.

Your task is write a program to judge the winner is A or B.

输入

Two unequal positive numbers M and N , M>N (M<1000000)

输出

A or B

样例输入

3 1

样例输出

C++代码实现：

解题思路：

只需要求出所给两个数的最大公因子，然后用两个数中最大的数除以这个最大公因子，所得的数就是所有能写的数字的个数。

那么随后要做的就是来判断A和B，谁可以赢（A先写）。当能写的数字个数为奇数的时候，A赢；为偶数时，B赢。就把判断输赢的问题转换成判断所能写数字个数奇偶性的问题。

#include<iostream>
#include<cstdio>
using namespace std;

int gcd(int M, int N) {  // 求最大公因数 
    return N ? gcd(N, (M % N)) : M;
}

int main() {
    int M, N, num;
    cin>>M>>N;
    num = M / gcd(M, N);
    printf("%c\n", num % 2 ? 'A' : 'B');
    return 0;
}