hdu1014 Uniform Generator

给你一个产生随机数的函数，再给两个值 STEP和MOD，计算通过给出的两个值，判断这个随机数函数是否能产生0-MOD-1的所有数，如果是就是Good Choice,否则为Bad Choice。

题目很简单，只需要使用step和mod带入函数计算是否产生了0-mod的无序序列。
例如：3 5，seed（x+1）=（seed（x）+step）%mod
结果能够产生的序列为0 3 4 1 2，满足要求就是Good Choice

使用普通数组存储seed（x）的值，至于计算直接从seed（0）=0开始递推至mod-1，然后从生成的seed数组里面检查有没有重复的值。

ps：写到这里竟然发现我的程序是可以被hack的（好可怕）。。。改一下。。。。

在此还是有一个问题想和大家探讨下：
按照上面的做法，在不排序的情况，你们认为会不会每一个bad都出现至少2个0的情况？

我开始竟然蒙了，判断两个0的出现，然后奇妙的是竟然ac了。。。。。
我先测试下。。。。

Uniform Generator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21925 Accepted Submission(s): 8610

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

#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 100000
using namespace std;
int s[maxn];
int step,m;


void seed(){
    for(int i=1;i<m;i++)
        s[i]=(s[i-1]+step)%m;
}

int main(){
    while(scanf("%d%d",&step,&m)!=EOF){
        memset(s,0,sizeof(s));
        seed();
        bool flag=true;
        sort(s,s+m);
        for(int i=0;i<m;i++)
            if(s[i]!=i) flag=false;
        if(flag)
            printf("%10d%10d    Good Choice\n\n",step,m);
        else
            printf("%10d%10d    Bad Choice\n\n",step,m);
    }
    return 0;
}