Uniform Generator HUD1014

Problem Description

Computer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the form

seed(x+1) = [seed(x) + STEP] % MOD

where ‘%’ is the modulus operator.

Such a function will generate pseudo-random numbers (seed) between 0 and MOD-1. One problem with functions of this form is that they will always generate the same pattern over and over. In order to minimize this effect, selecting the STEP and MOD values carefully can result in a uniform distribution of all values between (and including) 0 and MOD-1.

For example, if STEP = 3 and MOD = 5, the function will generate the series of pseudo-random numbers 0, 3, 1, 4, 2 in a repeating cycle. In this example, all of the numbers between and including 0 and MOD-1 will be generated every MOD iterations of the function. Note that by the nature of the function to generate the same seed(x+1) every time seed(x) occurs means that if a function will generate all the numbers between 0 and MOD-1, it will generate pseudo-random numbers uniformly with every MOD iterations.

If STEP = 15 and MOD = 20, the function generates the series 0, 15, 10, 5 (or any other repeating series if the initial seed is other than 0). This is a poor selection of STEP and MOD because no initial seed will generate all of the numbers from 0 and MOD-1.

Your program will determine if choices of STEP and MOD will generate a uniform distribution of pseudo-random numbers.

Input

Each line of input will contain a pair of integers for STEP and MOD in that order (1 <= STEP, MOD <= 100000).

Output

For each line of input, your program should print the STEP value right- justified in columns 1 through 10, the MOD value right-justified in columns 11 through 20 and either “Good Choice” or “Bad Choice” left-justified starting in column 25. The “Good Choice” message should be printed when the selection of STEP and MOD will generate all the numbers between and including 0 and MOD-1 when MOD numbers are generated. Otherwise, your program should print the message “Bad Choice”. After each output test set, your program should print exactly one blank line.

Sample Input

3 5
15 20
63923 99999

Sample Output

     3         5    Good Choice

    15        20    Bad Choice

 63923     99999    Good Choice

思路：这道题我一开始一看数据，直接暴力AC（居然只有15ms），交完后看了评论发现是欧几里得题，心理一细想， 发现真的好像可以用欧几里得做法做， 其实只要知道裴蜀定理应该能想出来，a % b 的实质其实是 a + b * y (y 属于整数)，根据题意，a 可以无限的倍增，那么式子就变成了a * x + b * y，利用裴蜀定理得出结果。

#include <iostream>


using namespace std;


int gcd(int a, int b)
{
    if(!b) return a;
    
    return  gcd(b, a % b);
}

int main()
{
    
    int n, m;
    
    while(cin >> n >> m)
    {
        if(gcd(n, m) == 1) printf("%10d%10d    Good Choice\n\n", n, m);
        
        else printf("%10d%10d    Bad Choice\n\n",n, m);   
    }
    return 0;
}