/*************************************************************************
> File Name: 12169.cpp
> Author: gwq
> Mail: [email protected]
> Created Time: 2015年01月21日 星期三 20時08分53秒
************************************************************************/
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#define INF (INT_MAX / 10)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define pb push_back
#define sz(a) ((int)(a).size())
using namespace std;
typedef set<int> si;
typedef vector<int> vi;
typedef map<int, int> mii;
typedef long long ll;
typedef unsigned long long ull;
const double esp = 1e-5;
#define N 110
ll num[N];
void exgcd(ll a, ll b, ll &d, ll &x, ll &y)
{
if (!b) {
d = a;
x = 1;
y = 0;
} else {
exgcd(b, a % b, d, y, x);
y -= x * (a / b);
}
}
int main(int argc, char *argv[])
{
ll n;
scanf("%lld", &n);
for (ll i = 1; i <= n; ++i) {
scanf("%lld", &num[2 * i - 1]);
}
for (ll a = 0; a <= 10000; ++a) {
ll d, x, y, t, b;
exgcd(a + 1, 10001, d, x, y);
t = num[3] - a * a * num[1];
if (t % d) {
continue;
}
x *= t / d;
y *= t / d;
b = x;
ll flag = 0;
for (ll i = 2; i <= 2 * n; ++i) {
ll tmp = (a * num[i - 1] + b) % 10001;
if (i % 2 == 0) {
num[i] = tmp;
} else {
if (num[i] != tmp) {
flag = 1;
break;
}
}
}
if (!flag) {
break;
}
}
for (ll i = 1; i <= n; ++i) {
printf("%lld\n", num[2 * i]);
}
return 0;
}
參考:http://blog.csdn.net/u013451221/article/details/38497029