Pseudo-Random Numbers
Pseudo-Random Numbers |
Computers normally cannot generate really random numbers, but frequentlyare used to generate sequences of pseudo-random numbers. These are generatedby some algorithm, butappear for all practical purposes to be really random. Random numbersare used in many applications, including simulation.
A common pseudo-random number generation technique is called the linearcongruential method. If the last pseudo-random number generated was L,then the next number is generatedby evaluating ( , where Z is a constantmultiplier, I is a constant increment, and M is a constant modulus.For example, suppose Z is 7, I is 5, and M is 12. If the firstrandom number (usually called the seed) is 4, then we can determine thenext few pseudo-random numbers are follows:
As you can see, the sequence of pseudo-random numbers generated by thistechnique repeats after six numbers. It should be clear that the longestsequence that can be generated usingthis technique is limited by the modulus, M.
In this problem you will be given sets of values for Z, I, M, and theseed, L. Each of these will have no more than four digits. For each suchset of values you are to determine the lengthof the cycle of pseudo-random numbers that will be generated. But becareful: the cycle might not begin with the seed!
Input
Each input line will contain four integer values, in order, for Z, I, M,and L. The last line will contain four zeroes, and marks the end of theinput data. L will be less than M.
Output
For each input line, display the case number (they are sequentially numbered,starting with 1) and the length of the sequence of pseudo-random numbersbefore the sequence is repeated.
Sample Input
7 5 12 4 5173 3849 3279 1511 9111 5309 6000 1234 1079 2136 9999 1237 0 0 0 0
Sample Output
Case 1: 6 Case 2: 546 Case 3: 500 Case 4: 220
这题大意就是给予Z、L、I、M这四个数,不断利用题目中的公式求出值,直到该值重复出现,然后输出循环计算的次数。
PS:循环求出的值不一定就是初始值。
#include <iostream>
#include <cstring>
using namespace std;
const int N = 100000;
int s[N];
int main() {
int Z,I,M,L;
int cnt = 0;
while (cin >> Z >> I >> M >> L) {
if (Z + I + M + L == 0)
break;
cnt++;
memset(s,0,sizeof(s));
s[L] = 1;
int t = 1;
while (1) {
L = (Z * L + I) % M;
if (s[L])
break;
t++;
s[L] = t;
}
cout << "Case " << cnt << ": " << ++t-s[L] << endl;
}
return 0;
}