UVA-350 Pseudo-Random Numbers
2016-08-10 03:53
337 查看
UVA-350 Pseudo-Random Numbers
题意:给Z,I,M,L,求经过多少次 newL = ( z*l + i ) mod m 之后 newL会出现重复。
解题思路:暴力模拟,要注意最开始的 L 不一定就在newL的变化之中。
Sample Input
7 5 12 45173 3849 3279 1511
9111 5309 6000 1234
1079 2136 9999 1237
0 0 0 0
Sample Output
Case 1: 6Case 2: 546
Case 3: 500
Case 4: 220
//UVA-350 Pseudo-Random Numbers #include <iostream> #include <cstdio> #include <cstring> using namespace std; int main () { int z, i, m, l; int value = 1; int n[10010]; while (scanf("%d %d %d %d",&z,&i,&m,&l) != EOF && (z+i+m+l) != 0) { int num = 0; memset(n,0,sizeof(n)); l = ( z * l + i ) % m; //没有这一句,第三个样例过不了,加上这一句,ac了 while (n[l] == 0) { n[l] = 1; l = ( z * l + i ) % m; num++; } printf("Case %d: %d\n",value++,num); } return 0; }
相关文章推荐
- UVA 350 Pseudo-Random Numbers 伪随机数(简单)
- UVa 350 - Pseudo-Random Numbers
- uva 350 Pseudo-Random Numbers(模拟)
- UVa 350 - Pseudo-Random Numbers
- UVA 350 Pseudo-Random Numbers
- UVa 350 - Pseudo-Random Numbers
- UVA350 Pseudo-Random Numbers
- UVa 350 - Pseudo-Random Numbers
- UVA, 350 Pseudo-Random Numbers(改进)
- UVA 350 - Pseudo-Random Numbers
- UVA - 350 Pseudo-Random Numbers
- UVa 350: Pseudo-Random Numbers
- UVA - 350 Pseudo-Random Numbers
- Uva - 350 Pseudo-Random Numbers
- UVA 350 (暑假-数论 -E - Pseudo-Random Numbers)
- Uva-350 Pseudo-Random Numbers
- UVa 350 - Pseudo-Random Numbers
- UVA 350 - Pseudo-Random Numbers(水)
- UVA 350-Pseudo-Random Numbers
- UVA350 Pseudo-Random Numbers