数学·Exgcd·UVA12169 Disgruntled Judge

重点在推式子，实际是个扩展欧几里得。

题目中给我们T，x1, x3, x5, x7......奇数项，让我们根据Xi = (a*Xi-1 +b) % 10001求出偶数项

但是，问题是a和b都不知道，我们可以通过枚举a（0~10001），来求解b。方法是：

有X2 = （a *X1 +b）%10001;

X3 = (a *X2 + b) % 10001;

可以得出

X3 = (a*a*X1 + (a+1)*b)%10001;

X3 + k * 10001 - a * a * X1 = (a+1) *b;

(a + 1) * b - 10001 * k = X3 - a * a * X1;

此时，可以明显的看出我们只需要通过枚举a，利用Exgcd解出b，并判断C是否可以整除gcd(A,B)即可 .

其中

A = 10001；

B = a +1；

C =    X3 - a * a * X1;

#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <queue>
#include <bitset>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <fstream>
#include <cstdlib>
#include <sstream>
#include <cstring>
#include <iostream>
#include <algorithm>
#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;
#define   maxn          10000+10
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   clr(x,y)      memset(x,y,sizeof(x))
#define   rep(i,n)      for(int i=0;i<(n);i++)
#define   repf(i,a,b)   for(int i=(a);i<=(b);i++)
#define   pii           pair<int,int>
//#define   mp            make_pair
#define   FI            first
#define   SE            second
#define   IT            iterator
#define   PB            push_back
#define   Times         10
typedef   long long     ll;
typedef   unsigned long long ull;
typedef   long double   ld;

const double eps = 1e-10;
const double  pi = acos(-1.0);
const  ll    mod = 1e9+7;
const  int   inf = 0x3f3f3f3f;
const  ll    INF = (ll)1e18+300;

int gcd(int a, int b) {
    if (!b) {
        return a;
    }
    else {
        return gcd(b, a%b);
    }
}

void exgcd(ll a, ll b, ll &d, ll &x, ll &y) {
    if (!b) {
        d = a;
        x = 1;
        y = 0;
        return;
    }
    else {
        exgcd(b, a%b, d, y, x);
        y -= x * (a/b);
    }
}

ll X[maxn];

int main() {
    int T;
    std::ios::sync_with_stdio(false);
    cin >> T;
//    scanf("%d")
    for (int i = 1; i <= 2*T; i+=2) {
        cin >> X[i];
    }
    for (int a = 0; a < 10001; a ++) {
        ll k, b, d;
        ll c = (X[3] - a * a * X[1]);
        ll A = 10001;
        ll B = a + 1;
        exgcd(B, A, d, b, k);
        if (c % d) {
            continue;
        }
        //cout << c <<" " << d <<endl;
        b = b * c /d;
        int flag = 1;
        for (int i = 2; i <= 2*T; i ++) {
            flag = 1;
            ll temp = (a * X[i-1] + b) % 10001;
            if (i % 2) {
                if (temp != X[i]) {
                    flag = 0;
                    break;
                }
            }
            else {
                X[i] = temp;
            }
        }
        if (flag) {
            break;
        }
    }
    for (int i = 2; i <= 2*T; i +=2) {
        cout << X[i] << endl;
    }
    return 0;
}