181.cpp

平时acm训练时ac的源代码

/*
181. X-Sequence
Accepted 31 ms 61 kb 
*/

#include <stdio.h>

int main(void)
{
	long *A, ap, bt, gm, M, s1, loca;
	long K, i, j;
	A = new long[1001];
	scanf("%ld %ld %ld %ld %ld %ld", &A[0], &ap, &bt, &gm, &M, &K);
	if (0!=K)
	{
		A[0] = A[0]%M;
		loca = 0;
		for (i=1; i<=K; i++)
		{
			A[i] = ((ap*A[i-1]*A[i-1])%M+(bt*A[i-1]+gm)%M)%M;;
			for (j=0;A[j]!=A[i] && j<i; j++);
			if (j!=i && A[j]==A[i])
			{
				loca = j;
				s1 = i-j;
				break;
			}
		}
		if ((i-1)==K)
		{
			printf("%ld", A[K]);
		}
		else if (0==(K-loca)%s1)
		{
			printf("%ld", A[loca]);
		}
		else
		{
			printf("%ld", A[(K-loca)%s1+loca]);
		}
	}
	else
	{
		printf("%ld", A[0]);
	}
	delete A;
	return 0;
}