HDOJ 1014

Uniform Generator Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10390    Accepted Submission(s): 4106 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

基本思路：就是先一直遍歷計算step值，在出現重複的值時就推出循環，而後調用allOnes函數來判斷下這mod個值出現的次數是否都是1，若是不是就是bad

 1 #include<iostream>
 2 #include<string>
 3 #include<iomanip>
 4 using namespace std;  5  
 6 int p[100000];  7  
 8 bool allOnes(int mod){  9     for(int i=0;i<mod;i++) 10         if(p[i]==0 || p[i]>1) 11             return false; 12     return true; 13 } 14  
15 int main() 16 { 17     int step,mod; 18     while(cin>>step>>mod) 19  { 20  
21         memset(p,0,sizeof(p)); 22         for(int i=0;p[0]==0||i!=0;i=(i+step)%mod) 23             p[i]++; 24         cout<<setiosflags(ios::right)<<setw(10)<<step; 25         cout<<setiosflags(ios::right)<<setw(10)<<mod; 26         if(allOnes(mod)) 27             cout<<setw(4)<<""<<"Good Choice\n"<<endl; 28         else
29             cout<<setw(4)<<""<<"Bad Choice\n"<<endl; 30  } 31     return 0; 32 }

源自：http://www.cnblogs.com/fgfgfffg/archive/2012/01/12/2320944.html