hdu 2769

这个题参照紫书的代码，暴力应该就ok了，谁知道还是出了很多问题。在一开始，就不明白题意，只能说很多字都很重要

比如：* One line containing an integer n (0 ≤ n ≤ 10000): an input testcase.  和   followed by the sequence x1, x3, x5, ..., x2T-1 to the input file, and the sequence x2, x4, x6, ..., x2T to the output file.

理解题之后发现并不简单，参考紫书可以暴力的原因是因为判断了 a  < mod && b < mod 。因为 xi = (a * xi - 1 + b) % mod。注xi - 1不是 x * i - 1。

贴两个个公式 (a + b)  mod n= ((a mod n) + (b mod n) )mod n

ab mod n = (a mod n) (b mod n) mod n//参考紫书

/*
ID: DickensTone
LANG: C++
PROB: namenum
*/
#include<iostream>
#include<cstdio>
using namespace std;
const int maxn = 100 + 5;
const int mod = 10001;
int num[maxn * 2];
int T;
void solve()
{
    //printf("yes\n");
    for(int a = 0; a < mod; a++)
    {
        for(int b = 0; b < mod; b++)
        {
            bool flag = true;
            for(int i = 2; i <= 2 * T; i = i + 2)
            {
                num[i] = (a * num[i - 1] + b) % mod;
                if(i + 1<= 2 * T && num[i + 1] != ((a * num[i] + b) % mod)) {flag = false; break;}
            }
            if(flag) return;
        }
    }
}
int main()
{
    //freopen("namenum.in","r",stdin);
    //freopen("namenum.out","w",stdout);

    while(scanf("%d", &T) == 1)
    {
        //printf("%d\n", T);
        for(int i = 1; i <= 2 * T - 1; i = i + 2)
            cin>>num[i];
        //printf("no\n");
        solve();
        for(int i = 2; i <= 2 * T; i = i + 2)
            cout<<num[i]<<endl;
    }
    return 0;
}