UVa 12169(基础模运算)

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=1e4+10;
int ans[N],T;
void solve() {
    for(int A=0;A<1e4;A++) 
        for(int b=0;b<1e4;b++) {
            bool flag = true;
            for(int i=2;i<=T*2;i+=2) {
                ans[i] = (A*ans[i-1] + b) % 10001;
                if(i+1 <= T*2 && ans[i+1] != (A*ans[i] + b) % 10001) {flag=0;break;}
            }
        if(flag) return;
    }
}
int main() {
    scanf("%d",&T);
    memset(ans,0,sizeof(ans));
    for(int i=1;i<2*T;i+=2) 
        scanf("%d",&ans[i]);
    solve();
    for(int i=2;i<=T*2;i+=2) printf("%d\n",ans[i]);
    return 0;
}