UVA 12169 Disgruntled Judge

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

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

 const int mod =  ;

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