Pseudorandom Sequence Period

题目描述：
Polycarpus has recently got interested in sequences of pseudorandom numbers. He learned that many programming languages generate such sequences in a similar way:
(for i ≥ 1). Here a, b, m are constants, fixed for the given realization of the pseudorandom numbers generator, r0 is the so-called randseed (this value can be set from the program using functions like RandSeed® or srand(n)), and denotes the operation of taking the remainder of division.

For example, if a = 2, b = 6, m = 12, r0 = 11, the generated sequence will be: 4, 2, 10, 2, 10, 2, 10, 2, 10, 2, 10, …

Polycarpus realized that any such sequence will sooner or later form a cycle, but the cycle may occur not in the beginning, so there exist a preperiod and a period. The example above shows a preperiod equal to 1 and a period equal to 2.

Your task is to find the period of a sequence defined by the given values of a, b, m and r0. Formally, you have to find such minimum positive integer t, for which exists such positive integer k, that for any i ≥ k: ri = ri + t.

Input
The single line of the input contains four integers a, b, m and r0 (1 ≤ m ≤ 105, 0 ≤ a, b ≤ 1000, 0 ≤ r0 < m), separated by single spaces.

Output
Print a single integer — the period of the sequence.

Examples
Input
2 6 12 11
Output
2
Input
2 3 5 1
Output
4
Input
3 6 81 9
Output
1

Note
The first sample is described above.

In the second sample the sequence is (starting from the first element): 0, 3, 4, 1, 0, 3, 4, 1, 0, …

In the third sample the sequence is (starting from the first element): 33, 24, 78, 78, 78, 78, …

题目描述：
本体就是给我们一个柿子，在然我们根据他给我们的数据来寻找他的循环是多少，就是他多少个数位一个循环，
博主开始本打算以map为主体来操作的，但是我们知道map他自己有一个排序功能，会把我们的数据顺序打乱，因此我就只用map来记录每个值是否一斤出现过，并且用数组来进行主要操作，详情请看代码：

#include <iostream>
#include <cstdio>
#include <map>

using namespace std;

const int maxn = 1e5+10;
map<int,int>mp;
int A[maxn];

int main () {
	int a,b,m,ri,r,i = 1;

	cin >> a >> b >> m >> A[0];
	
	mp[A[0]] = 1;//将第一个数的值标记为出现了一次
	while(i) {//用循环找每次运算的值
		A[i] = (a*A[i-1] + b)%m;
		if(mp[A[i]]) {
			mp[A[i]] = -1;//如果有值再次之前已经出现过就将其标记为循环开始，并且直接去退出
			break;
		}
		mp[A[i]] = 1;//如果这个数在此之前没出现过就标记为出现一次
		i++;
	}
	
	bool f = 0;
	int ans = 0;
	for(int j = 0;j < i;j++) {//此处只能到i-1，因为A[i]已经开始了下一轮循环
		if(mp[A[j]] == -1)//如果找到循环开始点就可以开始计数
			f = 1;
		if(f)
			ans++;
	}
	cout << ans << "\n";
	return 0;
}