poj 1597 Uniform Generator
2015-01-28 20:58
197 查看
Uniform Generator
Description
Computer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the form
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
Sample Output
Source
South Central USA 1996
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 5264 | Accepted: 2475 |
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
Source
South Central USA 1996
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <set> #include <queue> using namespace std; #define maxn 100005 #define inf 0x7ffffff int arr[maxn]; int n,m; int main() { while(scanf("%d %d",&n,&m) != EOF){ memset(arr,0,sizeof(arr)); int tmp = 0; for(int i = 0; i < m; i++){ arr[tmp] = 1; tmp = (tmp + n) % m; } bool flag = false; for(int i = 0; i < m; i++){ if(arr[i] == 0){ flag = true; break; } } if(!flag){ printf("%10d%10d Good Choice\n",n,m); }else{ printf("%10d%10d Bad Choice\n",n,m); } printf("\n"); } return 0; }
相关文章推荐
- POJ - 1597 英语阅读题..
- poj 1597(水模拟)
- POJ 1597 Uniform Generator
- ZOJ 1597 Circular Area(POJ 2546)(两个圆的位置关系)
- POJ 2546 & ZOJ 1597 Circular Area(求两圆相交的面积 模板)
- poj 1597 搜索NO,数论YES
- CodeForces 600D Area of Two Circles' Intersection 圆面积交 (POJ 2546, ZOJ 1597)
- poj 1019 Number Sequence && hdu 1597 find the nth digit(二分,模拟)
- poj1597 Uniform Generator
- 【POJ 1597】【数论】 Uniform Generator
- POJ 2546 & ZOJ 1597 Circular Area 两圆的面积交
- POJ 1597 Uniform Generator 笔记
- POJ 1597 find the nth digit (找规律)
- zoj 1597 || poj 2546 Circular Area(数学题)
- poj-1597
- POJ 1597 Uniform Generator 模拟
- POJ 1597 Function Run Fun
- poj 1597 Uniform Generator
- POJ 2546 & ZOJ 1597 Circular Area(求两圆相交的面积 模板)
- poj 1597 Uniform Generator【生成指定范围内所有随机数】