Uniform Generator——求余

Uniform Generator

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

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

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

题意：给出STEP和MOD，根据公式算出结果，问是否能够取到0到m - 1的所有数。

解析：通过计算判断在0到m中是否有重复的出现，如果有重复出现，判断计算了多少次，如果等于m，即0-m分别出现了一次，否则，会陷入一个小循环，永远不会全部出现。。。。

这道题目一直TLE了5遍，找了好长时间，还以为是数组开小了，原来是清空数组的时候，每次都需要清空100000001个内存，自然会超时额。。。。。。。。。。

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int bj[100000001];
int main()
{
    int i,file;
    long long int n,m,k;
    while(~scanf("%lld%lld",&n,&m))
    {
        for(i = 0;i <= m;i++)
            bj[i] = 0;
        file = 1;
        k = 0;
        k = (k + n)%m;
        bj[k]++;
        while(1)
        {
            k = (k + n) % m;
            bj[k]++;
            if(bj[k] > 1)
            {
                break;
            }
            file++;
        }
        printf("%10lld%10lld",n,m);
        if(file == m)
            printf("    Good Choice\n\n");
        else
            printf("    Bad Choice\n\n");
    }
    return 0;
}