HDU 1014 Uniform Generator

最新推荐文章于 2019-02-26 21:30:00 发布

PinkP1G

最新推荐文章于 2019-02-26 21:30:00 发布

阅读量360

点赞数

CC 4.0 BY-SA版权

分类专栏： HDU 文章标签： HDU 数论

本文链接：https://blog.csdn.net/q779160073/article/details/47106283

HDU 专栏收录该内容

19 篇文章

订阅专栏

本文探讨了伪随机数生成器的工作原理及其在计算机模拟中的应用，重点关注通过选择合适的参数来实现均匀分布的策略。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Uniform Generator

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21533 Accepted Submission(s): 8438

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.

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

题目大意
给你函数 seed(x+1) = [seed(x) + STEP] % MOD
这是一个伪随机数的函数
给你两个数STEP和MOD问你通过运行上面这个函数是否可以使得seed（i）包含0到MOD-1这些数

思路数论，只有满足a,b互为质数的时候就是好的

可以直接使用最大公约数模板
int gcd(int a, int b){
while(b^=a^=b^=a%=b);
return a;
}

这个可以通过位运算直接得到两数的最大公约数，当公约数为1的时候就可以了

#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
using namespace std;
#define maxn 100010
#define inf 0xffffff

int gcd(int a, int b){
while(b^=a^=b^=a%=b);
     return a;
}

int main()
{
    int Step,Mod;
    while(cin>>Step>>Mod)
    {
        if(gcd(Step,Mod) == 1)
            printf("%10d%10d    Good Choice\n\n",Step,Mod);
        else
            printf("%10d%10d    Bad Choice\n\n",Step,Mod);

    }
    return 0;
}