HDU 1014:Uniform Generator【模拟】
来源:互联网 发布:崩坏3矩阵神格buff 编辑:程序博客网 时间:2024/05/29 04:19
Uniform Generator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24185 Accepted Submission(s): 9576
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题意:就是给定两个数step, mod然后利用给定的公式求随机数,保证从0到mod减1范围内都均匀出现。
每一个数都出现一次。这样就均等分布了。就打印Good否则就Bad
就是枚举产生随机数,然后排序在比对,注意下输出的格式就OK了。还有就是注意格式。AC-code:#include<iostream>#include<cstdio>#include<algorithm>using namespace std;int main(){int n,m,i;int s[100005];while(cin>>n>>m){s[0]=0;for(i=1;i<m;i++)s[i]=(s[i-1]+n)%m;sort(s,s+m);for(i=0;i<m;i++)if(s[i]!=i)break;printf("%10d%10d",n,m);if(i==m)cout<<" Good Choice"<<endl<<endl;elsecout<<" Bad Choice"<<endl<<endl;}return 0;}
0 0
- HDU 1014 Uniform Generator 【模拟】
- HDU 1014:Uniform Generator【模拟】
- hdu 1014 Uniform Generator【模拟 && 欧几里得】
- hdu 1014 Uniform Generator
- HDU 1014 Uniform Generator
- HDU--1014--Uniform Generator
- hdu 1014 Uniform Generator
- hdu 1014 Uniform Generator
- HDU 1014 Uniform Generator
- HDU 1014 Uniform Generator
- Uniform Generator hdu 1014
- hdu 1014 Uniform Generator
- HDU 1014 Uniform Generator
- hdu 1014 Uniform Generator
- hdu 1014 Uniform Generator
- hdu 1014 Uniform Generator
- HDU 1014 Uniform Generator
- HDU 1014 Uniform Generator
- Protobuf语言指南
- 动态规划经典----跳台阶
- MFC-Toolbar(16位)
- C++作业2
- PHP编程效率的20个要点
- HDU 1014:Uniform Generator【模拟】
- 开始CSDN之旅~
- 引入第三方类库后,报错
- ZooKeeper目录节点形式CreateMode
- AllJoyn核心应用教程【第一章】:框架与概念
- Bundle versions string, short 和 Bundle version的区别
- 服务进程崩溃重启示例
- 理解矩阵(三)
- js中使用encodeURIComponent编码url后java后台的解码