hdu 1014 Uniform Generator(数论推理)
来源:互联网 发布:21cn邮箱数据哪里有卖 编辑:程序博客网 时间:2024/06/03 07:58
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1014
Uniform Generator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21990 Accepted Submission(s): 8641
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 <cstdio>#include <algorithm>using namespace std;int gcd(int a,int b){ return b?gcd(b,a%b):a;}int main(){ //freopen("cin.txt","r",stdin); int step,mod; while(cin>>step>>mod){ int a=step,b=mod; if(a<b) swap(a,b); printf("%10d%10d",step,mod); printf(" "); if(gcd(step,mod)==1) puts("Good Choice"); else puts("Bad Choice"); puts(""); } 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
- 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
- HDU 1014 Uniform Generator
- HDU 1014 Uniform Generator
- 乘法逆元
- 1046. Shortest Distance (20)
- C++多态
- 黑马程序员【andriod】JAVA基础学习笔记三——JAVA的几种引用学习总结
- hibernate 的不同 join 的实际含义
- hdu 1014 Uniform Generator(数论推理)
- C# 关键字列表
- 什么是Hadoop 它能做什么
- 构建需求响应式亿级商品详情页
- UICollectionViewCell 多选知识点总结
- 冒泡算法的实现
- 更改基于对话框程序左角上的图标以及.exe文件图标
- Codeforces Round #316 (Div. 2) E. Pig and Palindromes
- 使用EasyBCD完美实现Windows7与Linux双系统