sgu181：X-Sequence(求循环结)

题意：
题目大意：定义无穷数列{Xi}：
1.X0=A;
2.xi = (alpha * xi-1^2 + beta * xi-1 + gamma) mod M,  i >= 1. 
已知 A, alpha, beta, gamma, M, K.
求 Xk.
输入：A (1 <= A <= 10000), alpha (0 <= alpha <= 100), beta (0 <= beta <= 100), gamma (0 <= gamma <= 100), M (1 <= M <= 1000), k (0 <= k <= 10^9)。所有的数为整型。


分析：
就是要找循环节嘛，如果不想用long long的话就中间取模吧。
最坑的是x0输出不用取模...

#include <cstdio>
#include <iostream>
using namespace std;
const int MAXM = 1009;
int hash[MAXM] = {0};
int A, alpha, beta, gamma, M, k; 
int l;
int ans[MAXM];
int main()
{
	int now;
	cin >> A >> alpha >> beta >> gamma >> M >> k;
	if(k == 0)
	{
		cout << A << endl;
		return 0;	
	}
	l = 1, now = A%M;
	while(1)
	{
		hash[now] = l;
		ans[l] = now;
		now = (now*now%M*alpha%M+now*beta%M+gamma)%M;
		if(hash[now]) break;		
		l++;
	}
	if(k+1 < hash[now]) cout << ans[k+1] << endl;
	else cout << ans[(k+1-hash[now])%(l-hash[now]+1)+hash[now]] << endl;
	return 0;
}