杭电 ACM 1014
2014-06-07 17:42
423 查看
不学好英文还真不行啊!!……
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
//////////////////////////////////////////////////////////////
# include<stdio.h>
int main()
{
int m,n,t,m1,n1;
while(scanf("%d%d",&m,&n)!=EOF)
{
m1=m;
n1=n;
if(n>m)
{
t=m;
m=n;n=t;
}
while(n)
{
t=m%n;
m=n;n=t;
}
if(m==1)
printf("dd
Good Choice\n\n",m1,n1);
else
printf("dd
Bad Choice\n\n",m1,n1);
}
return 0;
}
//printf("dd+4个空格+Bad Choice\n\n",m1,n1);
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
//////////////////////////////////////////////////////////////
# include<stdio.h>
int main()
{
int m,n,t,m1,n1;
while(scanf("%d%d",&m,&n)!=EOF)
{
m1=m;
n1=n;
if(n>m)
{
t=m;
m=n;n=t;
}
while(n)
{
t=m%n;
m=n;n=t;
}
if(m==1)
printf("dd
Good Choice\n\n",m1,n1);
else
printf("dd
Bad Choice\n\n",m1,n1);
}
return 0;
}
//printf("dd+4个空格+Bad Choice\n\n",m1,n1);
相关文章推荐
- 杭电ACM 2050折线分割平面
- 杭电ACM 2048 神、上帝以及老天爷 …
- 杭电ACM 1465 不容易系列之一 递…
- ACM: 动态规划 poj 1014
- 杭电ACM 1239 简单的搜索类 Callin…
- 杭电 ACM 2002题(计算球的体积)
- 杭电ACM 1052(Tian Ji -- The Hor…
- 杭电ACM 2045不容易系列之(3)—— LE…
- 杭电ACM 2046 阿牛的EOF牛肉串
- 杭电ACM 2046 骨牌铺方格 递推类
- 杭电ACM 2000->2099 100道题 详细解题报告出炉
- ACM PKU 2729 -- Robocode (…
- ACM(Association for Computing Ma…
- acm 2035 人见人爱A^B
- PKU__ACM&nbsp;题目总结(转)
- 初级ACM 入门题(来自网上)
- The 36th ACM/ICPC Asia Regional …
- The 36th ACM/ICPC Asia Regional …
- ACMsteps 加油!!!
- poj&nbsp;1014&nbsp;Dividing(多重背包)