【水题】HDU1014Uniform Generator
来源:互联网 发布:淘宝数据包转换ecshop 编辑:程序博客网 时间:2024/06/05 15:37
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1014
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<iostream>#include<cmath>#include<cstring>#include<cstdio>#include<algorithm>using namespace std;int main(){ int step,mod; while(cin>>step>>mod){ int N=100005; int random[N]={0}; for(int i=1;i<mod;i++) random[i]=(random[i-1]+step)%mod; sort(random,random+mod); bool flag=true; for(int i=0;i<mod;i++){ if(random[i]!=i) flag=false; } if(flag) printf("%10d%10d Good Choice\n\n",step, mod); else printf("%10d%10d Bad Choice\n\n",step, mod); } return 0;}/*题目的大意:给定两个数step, mod,利用给定的公式求随机数, 保证从0到mod减1范围内每一个数都出现一次。 这样就均等分布了。就打印Good否则就Bad*/
0 0
- 【水题】HDU1014Uniform Generator
- HDU1014uniform generator
- HDU1014Uniform Generator(基础题)
- Generator
- generator
- Generator
- generator
- Generator
- generator
- Generator
- Generator
- generator
- generator
- generator
- Generator
- Generator
- HDU 1014 Uniform Generator 水题
- hdu 1014 Uniform Generator(水题)
- 百度之星热身赛
- extern 和static学习
- java RMI
- 下拉刷新+上拉加载+xml解析
- 优秀工程师系列:选择与努力
- 【水题】HDU1014Uniform Generator
- ajax获取数据,应该返回json用js拼接 还是在后台拼接HTML完再返回
- android studio打包apk 百度地图不显示的问题
- 2013年第四届蓝桥杯C/C++程序设计本科B组决赛 空白格式化(代码填空)
- Android 推送和统计最优轮循(心跳策略)探究实践
- IDEA 上一个好用的安卓模拟器
- 从服务器端返回的状态码汇总
- system on systemverilog
- array rotation