POJ 1597 Uniform Generator 模拟
2014-04-10 17:36
323 查看
Uniform Generator
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. 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 5 15 20 63923 99999 Sample Output 3 5 Good Choice 15 20 Bad Choice 63923 99999 Good Choice Source South Central USA 1996 |
#include <cstdio> #include <cstring> int main() { bool flag,arr[110000]; int a,i,m,n; while (scanf("%d%d",&m,&n)!=EOF){ memset(arr,false,sizeof(arr)); a=0; i=1; arr[0]=1; flag=true; while (flag && i<n){ i++; a=(a+m)%n; if (arr[a]) flag=false; arr[a]=true; } if (flag) printf("%10d%10d Good Choice\n\n",m,n); else printf("%10d%10d Bad Choice\n\n",m,n); } return 0; }
kdwycz的网站: http://kdwycz.com/
kdwyz的刷题空间:http://blog.csdn.net/kdwycz
相关文章推荐
- poj 1019 Number Sequence && hdu 1597 find the nth digit(二分,模拟)
- poj 1597(水模拟)
- POJ 1019 模拟也可以很经典
- poj 2632 模拟
- poj Pots(BFS)(路径记录)(模拟)
- poj 3325(模拟)
- poj3087 Shuffle'm Up 模拟
- POJ 2996 Help Me with the Game(模拟)
- poj 3629 Card Stacking 模拟
- poj 1028 Web Navigation(模拟)
- POJ-3087- Shuffle'm Up(字符串模拟)
- POJ 1013 Counterfeit Dollar 找假硬币 模拟
- poj 2414 Phylogenetic Trees Inherited 完全二叉树 状态压缩位运算模拟集合操作 动态规划
- POJ 2000 Gold Coins(模拟)
- POJ 2499Binary Tree(模拟+技巧)
- POJ 2993Emag eht htiw Em Pleh(模拟)
- POJ 2632 Crashing Robots(模拟)
- poj 2259 Team Queue (模拟)
- POJ 2260 Error Correction(模拟)
- poj 3087 直接模拟