杭电 ACM 1014
来源:互联网 发布:淘宝网怎么删除差评 编辑:程序博客网 时间:2024/05/22 14:28
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10985 Accepted Submission(s): 4337
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
Recommend
JGShining
题很简单,就是计算0 - mod-1 的和,然后与一个周期内的所有数的和相比,若相等就是Good Choice 否则 Bad Choice。有一点要注意的是输出格式,Goode choice 或 Bad choice 是左对齐到25行,所以在上面两个输出之后要输出四个空格。
代码:
#include<stdio.h>
int random(int step, int mod, int x)
{
return (x + step)%mod;
}
int main(void)
{
int sum;
int step, mod;
int i, head, next, x;
while(scanf("%d %d", &step, &mod) != EOF)
{
if(mod == 0)
break;
sum = 0;
for(i = 0;i < mod;i++)
{
sum += i;
}
head = random(step, mod, 0);
sum -= head;
x = head;
while(head != (next = random(step, mod, x)))
{
x = next;
sum -= next;
}
/*
printf("%10d%10d ",step,mod);
if(!sum)
printf("Good Choice\n\n");
else
printf("Bad Choice\n\n");
*/
printf("%10d%10d", step, mod);
printf(" ");
if(sum)
printf("Bad Choice\n\n");
else
printf("Good Choice\n\n");
}
return 0;
}
- 杭电 ACM 1014
- 杭电acm 1014
- 杭电ACM HDU 1014
- 奋战杭电ACM(DAY9)1014
- 杭电 ACM 1014
- 杭电 acm 1014 Uniform Generator
- 杭电ACM 1012 1013 1014
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电acm 1010
- 杭电 acm 1045
- 杭电ACM-1010
- 杭电ACM 1172
- 杭电ACM 1174
- 杭电ACM 1175
- 杭电ACM 分类
- 杭电ACM分类
- 杭电acm 1000
- 黑马程序员--Nutla-全文检索千亿数据检索框架
- 从程序制作到构架制作(转)
- 数据分析与处理之二(Leveldb 实现原理)
- 存储器简介
- MTK 平台上如何给 camera 添加一种 preview size
- 杭电 ACM 1014
- 各种触发模式在数据采集系统中的应用
- 黑马程序员--Java算法
- zoj2510活动安排
- Opencv中的ROI介绍
- 减小Sybase ASA数据库的数据和事务日志文件大小及分离的方法
- 复习之路 冒泡排序
- java语言基础之代码块详解
- 黑马程序员--Hadoop Wordcount