UVa 12169 Disgruntled Judge(扩展欧几里得算法的应用)

12169 - Disgruntled Judge

Time limit: 3.000 seconds   

    Once upon a time, there was an NWERC judge with a tendency to create slightly too hard problems. As a result, his problems were never solved. As you can image, this made our judge somewhat frustrated.This year, this frustration has culminated, and he has decided that rather than spending a lot of time constructing a well-crafted problem, he will simply write some insanely hard problem statement and just generate some random input and output les. After all, why bother having proper test data if nobody is going to try the problem anyway?Thus, the judge generates a test case by simply letting the input be a random number, and letting the output be another random number. Formally, to generate the data set with T test cases, the judge generates 2T random numbers between 0 and 10 000, and then writes T, followed by these quence  to the input le, and the sequence  to the output le. The random number generator the judge uses is quite simple. He picks three numbers , a, and b between 0 and 10 000 (inclusive), and then for i from 2 to 2T lets  You may have thought that such a poorly designed problem would not be used in a contest of such high standards as NWERC. Well, you were wrong.

Input
       On the rst line one positive number: the number of test cases, at most 100. After that per test case:

       • One line containing an integer n (0 ≤ n ≤ 10000): an input test case.
        The input le is guaranteed to be generated by the process described above.
Output

Per test case:

     • One line with an integer giving the answer for the test case.

     If there is more than one output le consistent with the input le, any one of these is acceptable.

Sample Input

3

17

822

3014

Sample Output

9727

1918

4110

       ps: 枚举A的值[0， 10000]（因为地推公式按10001取模, 如果大于10000就会重复之前的现象。比如：0和10001，用递推公式推出来的值都是一样的）。因为：

        
         整理为：
            
        从而将问题转换为扩展欧几里得算法的问题(扩展欧几里得算法戳我)，求出b,然后根据递推公式判断是否符合原来的数列，如果不符合说明不是这个数列的解。

#include<iostream>
#define ll long long
using namespace std;
void ex_gcd(ll a, ll b, ll &d, ll &x, ll &y)
{//扩展欧几里得算法
    if (!b)
        {d = a; x = 1; y = 0;}

    else
    {
        ex_gcd(b, a % b, d, y, x);
        y -= x * (a / b);
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll T;
    ll _in[105];//保存原来x1,x3...x(2T-1)的数组
    ll ans[205];//保存结果
    while(cin>>T)
    {
        bool flag = 1;
        for(int i = 0; i < T; i++)cin>>_in[i];
        ans[0] = _in[0];
        int index = 1;
        for(int a = 0; a <= 10000; a++)
        {
            //Ax + By = C
            ll c = _in[1] - a * a * _in[0]; //C
            ll _a = a + 1;//A
            ll b = -10001;//B
            ll d, _x, _y;
            ex_gcd(_a, b, d, _x, _y);
            if(c % d)continue;
                ll x = _x * (c / d);
            for(int i = 1; i < 2 * T; i++)
            {
                ans[i] = (a * ans[i - 1] + x) % 10001;
                if(i % 2 == 0)
                {
                    if(_in[index] == ans[i]){
                        flag = 1;
                        index++;
                    }
                    else {
                        flag = 0;
                        index = 1;
                        break;
                    }
                }
            }
            if(flag){
                break;
            }
        }
        for(int i = 1; i < 2 * T; i += 2)
        {
            cout<<ans[i]<<endl;
        }
    }
    return 0;
}