HDU 1014 Uniform Generator【公约数】
2016-05-13 20:39
411 查看
Uniform Generator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24901 Accepted Submission(s): 9836
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
Each line of input will contain a pair of integers for STEP and MOD in that order (1 <= STEP, MOD <= 100000).
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
3 5 15 20 63923 99999
[align=left]Sample Output[/align]
3 5 Good Choice 15 20 Bad Choice 63923 99999 Good Choice
翻译题意:判断两数最大公约数是否为1(互质),是的话就bad,不是的话就good
之前做过关于公约数公倍数的总结http://blog.csdn.net/qq_24653023/article/details/46831057
#include<stdio.h> int GCD(int a,int b) { return a%b?GCD(b,a%b):b; } int main (void) { int a,b; while(~scanf("%d%d",&a,&b)) { if(GCD(a,b)==1) { printf("%10d%10d Good Choice\n\n",a,b); } else printf("%10d%10d Bad Choice\n\n",a,b); } return 0; }
相关文章推荐
- 【百度之星】-IP聚合
- 数据库性能优化之SQL语句优化
- 人月神话阅读笔记02
- 薛定谔猫的疑问
- 战略游戏_ssl1230_树形dp
- Introduction to replication 翻译
- C# 按钮添加事件
- 数据库utf-8
- 第十一周项目3.1—警察和厨师
- Bluemix使用与其他云平台对比
- 街拍白连衣裙美女
- Eclipse下for语句中自动生成的FOCUSED_STATE_SET
- HTML5培训第14节课堂笔记(列表滑动删除的实现、侧滑菜单的生成)
- Hibernate学习之注解学习
- C#信号 Send
- Java的运行机制
- 免费的编程中文书籍索引
- iOS-UITableView的优化(纯手打原创)
- hdu 2680(最短路)
- DAG 动态规划 矩阵嵌套