uva350 - Pseudo-Random Numbers
来源:互联网 发布:php api接口开发 框架 编辑:程序博客网 时间:2024/05/16 05:39
Computers normally cannot generate really random numbers, but frequently are used to generate sequences of pseudo-random numbers. These are generated by some algorithm, but appear for all practical purposes to be really random. Random numbers are used in many applications, including simulation.
A common pseudo-random number generation technique is called the linear congruential method. If the last pseudo-random number generated was L, then the next number is generated by evaluating ( , where Z is a constant multiplier, 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 first random number (usually called the seed) is 4, then we can determine the next few pseudo-random numbers are follows:
As you can see, the sequence of pseudo-random numbers generated by this technique repeats after six numbers. It should be clear that the longest sequence that can be generated using this technique is limited by the modulus, M.
In this problem you will be given sets of values for Z, I, M, and the seed, L. Each of these will have no more than four digits. For each such set of values you are to determine the length of the cycle of pseudo-random numbers that will be generated. But be careful: 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 the input 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 numbers before the sequence is repeated.
Sample Input
7 5 12 45173 3849 3279 15119111 5309 6000 12341079 2136 9999 12370 0 0 0
Sample Output
Case 1: 6Case 2: 546Case 3: 500Case 4: 220
#define LOCAL#include <cstdio>#include <iostream>#include <cstring>using namespace std;const int maxn = 100000;int arry[maxn];bool check(int L, int j){for(int i = 0; i < j; ++ i){if(arry[i] == L){return false;}}return true;}int main(){#ifdef LOCAL freopen("data3.in", "r", stdin); freopen("data3.out", "w", stdout);#endifint L, I, M, Z;int casee = 1;while(scanf("%d %d %d %d", &Z, &I, &M, &L) != EOF&& Z != 0 && I != 0 && M != 0 && L !=0){int j = 0;int cnt = 0;L = (Z * L + I) % M; ///But be careful: the cycle might not begin with the seed! (very important!)arry[j++] = L;cnt++;L = (Z * L + I) % M; ///able optimizewhile(check(L, j)){arry[j++] = L;cnt++;L = (Z * L + I) % M;//printf("L = %d\n", L);}printf("Case %d: %d\n",casee++, cnt);}return 0;}
- UVa350 Pseudo-Random Numbers
- Pseudo-Random Numbers UVA350
- uva350 - Pseudo-Random Numbers
- UVA350 Pseudo-Random Numbers
- UVA350 Pseudo-Random Numbers
- 350 - Pseudo-Random Numbers
- 350 - Pseudo-Random Numbers
- 350 - Pseudo-Random Numbers
- Pseudo-Random Numbers
- Pseudo-Random Numbers
- 350 - Pseudo-Random Numbers
- UVA Pseudo-Random Numbers
- Pseudo-Random Numbers
- Pseudo-Random Numbers
- Pseudo-Random Numbers
- uva 350 - Pseudo-Random Numbers
- uva 350 - Pseudo-Random Numbers
- uva-350 - Pseudo-Random Numbers
- ACTIVITI 源码研究之命令模式执行
- mysql (master/slave)复制原理及配置
- 优秀程序员必备的六个好习惯
- Java Web学习之JSP基本知识篇
- Visual Studio使用技巧
- uva350 - Pseudo-Random Numbers
- Linux进程间通信——使用信号量
- 关于LWIP断开网线后重连问题(热插拔问题)
- POJ 2524 Ubiquitous Religions 并查集
- 缓存替换算法笔记 ——2Q
- 花生壳发布网站直接将网址绑定到具体的项目上——jboss版
- destoon实现调用热门关键字的方法
- 汉澳师攻城
- JNDI在tomcat中的配置