uva 12169 暴力

#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 * 2 + 5;
const int M = 10001;
int T, x[maxn];
void solve()
{
	for (int i = 0; i < M; i++)
		for (int j = 0; j < M; j++)
		{
			bool ok = 1;
			for (int l = 2; l <= T * 2; l += 2)
			{
				x[l] = (i * x[l - 1] % M + j) % M;
				if (x[l + 1] != (i * x[l] % M + j) % M && l != T * 2)
				{ok = 0; break;}
			}
			if (ok) return;
		}
}
int main(int argc, char const *argv[])
{
	while (cin >> T)
	{
		for (int i = 1; i <= T * 2 - 1; i += 2)
			cin >> x[i];
		solve();
		for (int i = 2; i <= T * 2; i += 2)
			cout << x[i] << endl;
	}
	return 0;
}

暴力事件O(T*a) 果断暴力，一个一个a不断试，就可以了