HDU 1014 Uniform Generator

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

 

Source

South Central USA 1996

 

题目大意就是 给你两个数 step mod

seed从0开始每次加step并%mod

问 是否所有seed都在0-mod-1之中

 

这题一开始没有想得高深算法 直接模拟就过了

 

后来发现只要step和mod互素 那么就是good choice

 

#include<cstdio>
#include<iostream>
#define MAXN 100010

using namespace std;

int step,mod;

bool vis[MAXN],flag=false;

int main() {
    while(~scanf("%d %d",&step,&mod)) {
        int seed=0,ans=0,p=0;
        flag=false;
        fill(vis,vis+MAXN+1,false);
        do {
            if(p>=MAXN) break;
            p++;
            seed=(seed+step)%mod;
            if(!vis[seed]) {
                vis[seed]=true;
                ans++;
            }
        }while(ans<mod);
        for(int i=1;i<mod;i++)
          if(!vis[i]) {
              flag=true;
              printf("%10d%10d    Bad Choice
",step,mod);
              printf("
");
              break;
          } 
        if(!flag) printf("%10d%10d    Good Choice
",step,mod),printf("
");
    }
    return 0;
} 

#include<cstdio>
#include<iostream>

using namespace std;

int step,mod;

inline int gcd(int a,int b) {
    if(b==0) return a;
    else return gcd(b,a%b);
}

int main() {
    while(~scanf("%d %d",&step,&mod)) {
        if(gcd(step,mod)==1) 
          printf("%10d%10d    Good Choice
",step,mod),printf("
");
        else printf("%10d%10d    Bad Choice
",step,mod),printf("
");
    }
    return 0;
}