zoukankan      html  css  js  c++  java
  • uva-408 Uniform Generator

    简单的判断互质

     Uniform Generator 

    Computer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the form

    displaymath29

    where `` tex2html_wrap_inline31 " 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 andMOD-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 STEPand 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 ( tex2html_wrap_inline77 ).

    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
    


     1 #include <iostream>
     2 #include <cstdio>
     3 #include <limits.h>
     4 using namespace std;
     5 
     6 int ans=0;
     7 int gcd(int a,int b)
     8 {
     9     if(b==0)
    10     {
    11         ans=a;
    12         return 0;
    13     }
    14     if(a<b)
    15     {
    16         int temp;
    17         temp=a;
    18         a=b;
    19         b=temp;
    20     }
    21     gcd(b,a%b);
    22     return 0;
    23 }
    24 
    25 int main()
    26 {
    27     int S,M;
    28     while(scanf("%d %d",&S,&M)!=EOF)
    29     {
    30         gcd(S,M);
    31         if(ans==1)printf("%10d%10d    Good Choice
    
    ",S,M);
    32         else  printf("%10d%10d    Bad Choice
    
    ",S,M);
    33 
    34         ans=0;
    35     }
    36     return 0;
    37 }

  • 相关阅读:
    magic_quotes_gpc(魔术引号开关)
    获取文件绝对路径:__FILE__与 $_SERVER[SCRIPT_FILENAME''] 的 区别
    小程序wx:key中的关键字*this
    swiper 更改indicator-dots 属性 隐藏面板指示点
    B站视频下载
    makefile教程
    Qt 中配置 c99的问题
    C语言编译过程及相关文件
    go语言入门(10)并发编程
    go语言入门(9)文本文件处理
  • 原文地址:https://www.cnblogs.com/doubleshik/p/3381664.html
Copyright © 2011-2022 走看看