UVA 12169 Disgruntled Judge

 

我该怎么说这道题呢。。。说简单其实也简单，就枚举模拟，开始卡了好久，今天看到这题没a又写了遍，看似会超时的代码交上去a了，果然实践是检验真理的唯一标准。。。

 

 

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

const int mod = 10001 ;

int main (){
    int x[50005];
    int n;
    while (~scanf ("%d",&n)){
        for (int i=1;i<2*n;i+=2)
            scanf ("%d",&x[i]);
        int a,b;
        int flag;
        for (a=0;a<=10000;a++){
            for (b=0;b<=10000;b++){
                int temp;
                temp=(a*x[1]+b)%mod;
                temp=(a*temp+b)%mod;
                if (temp==x[3])
                    break ;
            }
            //b=(x[3]-((a*a)%mod)*x[1]%mod)%mod/(a%mod+1);
            flag=0;
            for (int i=2;i<=2*n;i++){
                int temp=(a*x[i-1]+b)%mod;
                if (i%2&&temp!=x[i]){
                    flag=1;
                    break ;
                }
                x[i]=temp;
            }
            if (!flag)
                break ;
        }
        for (int i=2;i<=2*n;i+=2)
            printf ("%d\n",x[i]);
    }
    return 0;
}