# 1597

Uniform Generator
 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 1764 Accepted: 802

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

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

Sample Output

Source
South Central USA 1996

*********************************************************************

*********************************************************************

Source Code

 Problem: 1597 User: xcl119xcl Memory: 72K Time: 0MS Language: C++ Result: Accepted
• Source Code
#include<stdio.h>
int main()
{
long stp,mod,n;
while(scanf("%ld%ld",&stp,&mod)!=-1){
printf("%10ld%10ld    ",stp,mod);
n=stp>mod?mod:stp;
for(;n>1;n--)
if(stp%n==0&&mod%n==0)
break;//判断stp和mod是否互素
if(n==1)
printf("Good Choice/n/n");
else
}
return 0;
}

         3         5    Good Choice

63923     99999    Good Choice

3 5
15 20
63923 99999

     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.

#### UVa 1597 - Searching the Web（模拟）

2015-03-23 17:21:32

#### UVa1597 Searching the Web

2014-09-26 23:02:28

#### POJ - 1597 英语阅读题..

2012-02-20 10:53:44

#### Uva1597 -Searching the Web

2016-10-11 14:03:15

#### hdu 1597 二分查找

2015-02-09 20:35:57

#### 1597: [Usaco2008 Mar]土地购买 斜率优化

2017-05-27 21:20:13

#### UVa:1597 - Searching the Web

2015-03-25 13:24:27

#### [刷题]算法竞赛入门经典(第2版) 5-10/UVa1597 - Searching the Web

2016-09-22 22:26:44

#### HDU 1597（二分法）

2016-06-05 17:09:26

#### 5-10 UVA 1597 Searching the Web在Web中搜索

2016-01-25 12:16:15