HDU1014-Uniform Generator
来源:互联网 发布:淘宝卖家 编辑:程序博客网 时间:2024/06/05 17:18
Uniform Generator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27483 Accepted Submission(s): 10915
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.
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 515 2063923 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 <string>#include <cstring>#include <algorithm>#include <cmath>#include <queue>#include <stack>#include <vector>#include <set>#include <map>using namespace std;#define LL long longint main(){ int a,b; int x[100005]; while(~scanf("%d %d",&a,&b)) { x[0]=0; for(int i=1;i<b;i++) x[i]=(x[i-1]+a)%b; sort(x,x+b); int i; for(i=0; i<b; i++) if(x[i]!=i) break; printf("%10d%10d",a,b); if(i==b) printf(" Good Choice\n\n"); else printf(" Bad Choice\n\n"); } return 0;}
0 0
- HDU1014 Uniform Generator
- HDU1014 ( Uniform Generator )
- hdu1014 Uniform Generator
- HDU1014:Uniform Generator
- hdu1014 Uniform Generator
- hdu1014 Uniform Generator
- hdu1014 Uniform Generator--哈希表水题
- hdu1014 Uniform Generator
- HDU1014-Uniform Generator
- HDU1014 Uniform Generator(模拟)
- hdu1014 Uniform Generator
- Uniform Generator (hdu1014数论随即数)
- HDU1014--Uniform Generator HDU(112)
- HDU1014 - Uniform Generator (gcd的应用)
- HDU1014 POJ1597 UVALive5492 UVA408 ZOJ1314 Uniform Generator【随机函数+水题】
- Uniform Generator
- Uniform Generator
- Uniform Generator
- Python轻松入门-03字符串介绍
- Ajax请求servlet成功但返回错误
- 反编译软件ILSpy的使用教程
- 设计模式之简单工厂模式
- hashmap java用法
- HDU1014-Uniform Generator
- tomcat and PHP
- github在linux上的使用
- Plan 2017
- 小博老师解析Java核心技术 ——AJAX第三弹
- Find a way (双重BFS)
- Web系统大规模并发处理
- 函数式编程初探
- 利用栈实现中缀表达式转后缀表达式