hdoj 1014Uniform Generator
来源:互联网 发布:matlab矩阵绘制三维图 编辑:程序博客网 时间:2024/05/23 15:37
Uniform Generator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28885 Accepted Submission(s): 11500
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代码:#include<cstdio>#include<cstring>int main(){int STEP,MOD;int seed[100010],book[100010];while(scanf("%d%d",&STEP,&MOD)!=EOF){memset(book,0,sizeof(book));seed[0]=0;book[0]=1;for(int i=1;i<MOD;i++){seed[i]=(seed[i-1]+STEP)%MOD;book[seed[i]]=1;}int flag=1;for(int i=1;i<=MOD-1;i++){if(book[i]==0){flag=0;break;}}if(flag){printf("%10d%10d Good Choice\n\n",STEP,MOD);}else{printf("%10d%10d Bad Choice\n\n",STEP,MOD);}}return 0;}
阅读全文
0 0
- HDOJ 1014 Uniform Generator
- 【HDOJ】1014 -> Uniform Generator
- hdoj 1014 Uniform Generator
- HDOJ-1014 Uniform Generator
- HDOJ 1014 Uniform Generator
- hdoj 1014 Uniform Generator
- HDOJ 1014 Uniform Generator
- Hdoj 1014 Uniform Generator
- 【HDOJ】【1014】Uniform Generator
- hdoj 1014Uniform Generator
- HDOJ 1014 Uniform Generator
- hdoj 1014 Uniform Generator
- hdoj.1014 Uniform Generator 20140809
- HDOJ 1014 Uniform Generator(公约数问题)
- hdoj 1014 uniform generator(水题)
- HDOJ Uniform Generator
- ACM--公约数为1--HDOJ 1014--Uniform Generator--水
- 1014 Uniform Generator
- Java异常封装(自己定义错误码和描述,附源码)
- [bzoj]2179: FFT快速傅立叶
- Nginx 配置文件(nginx.conf)
- js笔记3之变量的复制,参数传递与垃圾回收机制
- tomcat配置优化
- hdoj 1014Uniform Generator
- JAVA的面向对象特性
- Linux下虚拟地址映射
- 设计模式七大原则
- Nginx 配置域名 .conf 文件
- bzoj1703[Usaco2007 Mar]Ranking the Cows 奶牛排名
- Lingo数据
- vim快捷键介绍
- 一步一步写算法(之排序二叉树)