杭电ACM OJ 1014 Uniform Generator 大数值下 一开始用递归做StackOverFlow 后来用for循环就好了

Uniform Generator

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 30505    Accepted Submission(s): 12163

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
  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  

   
   翻译：
   
   seed(x+1) = [seed(x) + STEP] % MOD 3就是step，5就是mod。初始值seed（0）可以任意设，这里设为0 
  
  
  
  

   
   执行这个公式mod次，如果得出来的值是从0到mod均匀分布的（即0到mod的每个值都出现了一次）这样的就是goodchoice
  
  
  
  

   
   

  
  
  
  

   
   核心：题目不难，但是问题在于用递归的情况下，并且测试第三组数据的时候，5000-6000次左右会StackOverFlow。我换了好几种数据类型，最高也就执行了7000次。后来以为主线程受不了了，就开了子线程还是不行，就明白了消耗内存过大，这个方法被判定为死循环了。最后我决定采用for循环来做。
  
  
  
  


  
  
  
  

   
   
public class UniformGenerator1014{

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

    //3         5        Good Choice
    //15        20       Bad Choice
    //63923     99999    Good Choice

    private static int step = 63923;
    private static int mod = 99999;

    private static int[] result = new int[100010];

    public static void main(final String[] args) throws Exception{

        result[0] = 0;

        for (int i = 1; i < mod; i ++) {
            result[i] = (result[i - 1] + step) % mod;
        }

        //冒泡排序
        int temp;
        for (int i = 0; i < mod - 1; i ++) {
            for (int j = 0; j < mod - i - 1; j ++) {
                if (result[j] > result[j + 1]) {
                    temp = result[j];
                    result[j] = result[j + 1];
                    result[j + 1] = temp;
                }
            }
        }

        int i;
        for (i = 0; i < mod; i ++) {
            if (result[i] != i) {
                break;
            }
        }

        if (i == mod) {
            System.out.println("Good");
        } else {
            System.out.println("Bad");
        }
    }
}