zoukankan      html  css  js  c++  java
  • hd1004 Uniform Generator

    Uniform Generator


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




    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

    解:

    1. s与m是否互质

    2. 主要是格式控制

    #include <stdio.h>
    int gcd(int a, int b)
    {
    	if(b>a)
    	{
    		a=a^b;
    		b=a^b;
    		a=a^b;
    	}
    	int c = a % b;
    	while(c!=0)
    	{
    		a = b;
    		b = c;
    		c = a % b;
    	}
    	return b;
    }
    
    int main()
    {
    	int s,m;
    	while(~scanf("%d %d",&s,&m))
    	{
    		if(gcd(s,m)!=1)
    		printf("%10d%10d    Bad Choice
    
    ",s,m);
    		else
    			printf("%10d%10d    Good Choice
    
    ",s,m);
    	}
    	return 0;
    }

    1. 求gcd

    int gcd(int a, int b)

    {return b==0?x:gcd(b,a%b);}

    2. while中

    gcd(s,m)==1?printf... : printf...;

    3. 这样代码会更简洁点



    每天早上叫醒你的不是闹钟,而是心中的梦~
  • 相关阅读:
    VMware虚拟机Mac OS X无法调整扩展硬盘大小,更新xcode时出现磁盘空间不足
    打包时Xcode报:此证书的签发者无效Missing iOS Distribution signing identity
    iPhone私有API
    Xcode真机调试中"There was an internal API error"错误解决方法
    用C#通过反射实现动态调用WebService 告别Web引用
    MySQL、PostgreSQL、Ingres r3、MaxDB等开源数据库的详细比较
    jQuery Mobile 移动开发中的日期插件Mobiscroll使用说明
    SQL Server 2008|2012 阻止保存要求重新创建表的更改
    SQL Server如何启用xp_cmdshell组件
    Windows平台下利用APM来做负载均衡方案
  • 原文地址:https://www.cnblogs.com/vintion/p/4117064.html
Copyright © 2011-2022 走看看