hdu1014
来源:互联网 发布:win7软件字体乱码 编辑:程序博客网 时间:2024/05/17 00:02
Uniform Generator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13462 Accepted Submission(s): 5286
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
1、暴力法
import java.util.Scanner;public class Main {/** * @param args */public static void main(String[] args) {int s=0,i,MOD,STEP;Scanner sc=new Scanner(System.in);while(sc.hasNext()){STEP=sc.nextInt();MOD=sc.nextInt();i=s=0;while(true){s=(s+STEP)%MOD;i++;if(s==0) break;}if(i==MOD){System.out.printf("%10d%10d Good Choice",STEP,MOD);System.out.println();}else{System.out.printf("%10d%10d Bad Choice",STEP,MOD);System.out.println();}System.out.println();}}}
2、只要STEP和MOD互质就可以
import java.math.BigInteger;import java.util.Scanner;public class Main {/** * @param args */public static void main(String[] args) {int s=0,i;BigInteger MOD,STEP;Scanner sc=new Scanner(System.in);while(sc.hasNext()){STEP=sc.nextBigInteger();MOD=sc.nextBigInteger();if(STEP.gcd(MOD).intValue()==1){System.out.printf("%10d%10d Good Choice",STEP,MOD);System.out.println();}else{System.out.printf("%10d%10d Bad Choice",STEP,MOD);System.out.println();}System.out.println();}}}
- hdu1014
- hdu1014
- hdu1014
- hdu1014
- hdu1014
- HDU1014
- HDU1014
- HDU1014
- HDU1014
- hdu1014(随机数)
- HDU1014 Uniform Generator
- HDU1014 ( Uniform Generator )
- hdu1014 Uniform Generator
- HDU1014:Uniform Generator
- hdu1014 Uniform Generator
- hdu1014 Uniform Generator
- hdu1014 Uniform Generator--哈希表水题
- hdu1014 Uniform Generator
- 使用FD_CLOEXEC实现close-on-exec,关闭子进程无用文件描述符
- check 约束
- js将long日期格式转换为标准日期格式实现思路
- 怎样学好hibernate!(http://edu.csdn.net/news/2012822/240ca26f0d7e.shtml)没事下载下来看哦
- Tri_integral Summer Training 4 总结(Hsinchu 2011)
- hdu1014
- 终于可以在centos下使用QQ啦!
- 面向程序员的数据库访问性能优化法则
- java获取系统属性
- checkbox全选与反选
- HttpWebRequest对象池 HTTP协议 HttpWebRequest和 Socket的一点总结
- mac下直接运行python脚本
- ALSA 接口编程实例——语音聊天
- 在socket创建的时候使用SOCK_CLOEXEC设置close-on-exec