杭电1014Uniform Generator
来源:互联网 发布:淘宝一元商品怎么赚钱 编辑:程序博客网 时间:2024/06/04 19:01
Uniform Generator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22054 Accepted Submission(s): 8678
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<stdio.h>#include<string.h>#include<algorithm>using namespace std;int ac(long a,long b){for(long i=2;i<=a;i++)if(a%i==0&&b%i==0)return 0;return 1;}int main(){long a,b;while(scanf("%ld%ld",&a,&b)!=EOF){if(ac(a,b))printf("%10ld%10ld Good Choice\n\n",a,b);elseprintf("%10ld%10ld Bad Choice\n\n",a,b);}}
0 0
- 杭电 1014 Uniform Generator
- 杭电1014 Uniform Generator
- 杭电1014Uniform Generator
- 杭电 1014 Uniform Generator
- 杭电 1014 Uniform Generator
- 杭电1014Uniform Generator
- 杭电OJ 1014:Uniform Generator
- 杭电 acm 1014 Uniform Generator
- 杭电1014 ——Uniform Generator
- 杭电OJ—— 1014 Uniform Generator
- *杭电1014——Uniform Generator(数学题)
- 杭电OJ—— 1014 Uniform Generator
- 杭电OJ(HDOJ)1014题:Uniform Generator(数论,最大公约数)
- 1014 Uniform Generator
- hdu 1014 Uniform Generator
- HDU 1014 Uniform Generator
- HDU--1014--Uniform Generator
- HDOJ 1014 Uniform Generator
- 2015年9月20日
- Java多种排序算法
- Python 标准库——functools
- 软件测试基础 个人小结(一)
- iOS性能优化大全
- 杭电1014Uniform Generator
- poj 2031--Building a Space Station(prim)
- 触屏tab选项卡
- 架构师之路
- 用Eclipse编写三角形
- 关于java回调函数的理解
- Digit Generator, ACM/ICPC Seoul 2005, UVa1583
- [error handle][mysql]mysql汉字乱码
- 代码变成可执行程序期间,编译器做了那些事?