hdu1014 Uniform Generator
来源:互联网 发布:传奇盛世翅膀数据67 编辑:程序博客网 时间:2024/06/06 05:19
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>int test[100000];void sort(int*a,int left,int right){ if(left>=right) return; int i=left; int j=right; int key=a[left]; while(i<j) { while(i<j&&key<=a[j]) j--; a[i]=a[j]; while(i<j&&key>=a[i]) i++; a[j]=a[i]; } a[i]=key; sort(a,left,i-1); sort(a,i+1,right);}int main(){ int STEP,MOD,i,t; while(scanf("%d%d",&STEP,&MOD)!=EOF) { test[0]=0; for(i=0;i<MOD;i++) test[i+1]=(test[i]+STEP)%MOD; sort(test,0,MOD-1); t=1; for(i=0;i<MOD;i++) { if(test[i]!=i) { t=0; break; } } if(t) printf("%10d%10d Good Choice\n\n",STEP,MOD); else printf("%10d%10d Bad Choice\n\n",STEP,MOD); } return 0;}1 PE:in column25
2 quicksort
#include<stdio.h>int gcd(int a,int b){ return (b>0)?gcd(b,a%b):a;}int main(){ int k,STEP,MOD; while(scanf("%d%d",&STEP,&MOD)!=EOF) { k=gcd(STEP,MOD); if(k==1) printf("%10d%10d Good Choice\n\n",STEP,MOD); else printf("%10d%10d Bad Choice\n\n",STEP,MOD); } return 0;}relatively prime
#include<stdio.h>#include<string.h>int a[100005];int main(){ int STEP,MOD,i,k; while(scanf("%d%d",&STEP,&MOD)!=EOF) { memset(a,0,sizeof(a)); a[0]=1; k=0; for(i=1;i<MOD;i++) { k=(k+STEP)%MOD; if(a[k]) break; a[k]=1; } if(i==MOD) printf("%10d%10d Good Choice\n\n",STEP,MOD); else printf("%10d%10d Bad Choice\n\n",STEP,MOD); } return 0;}simulate
阅读全文
0 0
- HDU1014 Uniform Generator
- HDU1014 ( Uniform Generator )
- hdu1014 Uniform Generator
- HDU1014:Uniform Generator
- hdu1014 Uniform Generator
- hdu1014 Uniform Generator
- hdu1014 Uniform Generator--哈希表水题
- hdu1014 Uniform Generator
- HDU1014-Uniform Generator
- HDU1014 Uniform Generator(模拟)
- hdu1014 Uniform Generator
- Uniform Generator (hdu1014数论随即数)
- HDU1014--Uniform Generator HDU(112)
- HDU1014 - Uniform Generator (gcd的应用)
- HDU1014 POJ1597 UVALive5492 UVA408 ZOJ1314 Uniform Generator【随机函数+水题】
- Uniform Generator
- Uniform Generator
- Uniform Generator
- 关于Ztree的一些使用心得
- 定时任务调度工具之Timer(一)
- 如何学习php
- 【慕课网_性能优化之MySQL优化_学习】【01】
- 设计模式之MVP模式
- hdu1014 Uniform Generator
- centos7安装Apache虚拟主机
- Linux查看CPU和内存(一)----top命令
- R----kmeans
- 高并发基础之Atomic(三)
- window , document的那些事、、、、最好的回答
- 数值的整数次方
- Android数据绑定框架DataBinding,堪称解决界面逻辑的黑科技
- Python调用MATLAB脚本