NOIP 考前 数论复习

 1 #include <cstdio>
 2 #define LL long long
 3 LL a1,a2,r1,r2,x,y,n; 
 4 LL Extend_Gcd(LL a,LL b,LL &x,LL &y)
 5 {
 6     if (b==0) {x=1,y=0; return a;}
 7     LL Ret=Extend_Gcd(b,a%b,x,y);
 8     LL Tmp=x;
 9     x=y; y=(Tmp-a/b*y);
10     return Ret;
11 }
12 int main()
13 {
14     // freopen("c.in","r",stdin);
15     while (scanf("%lld",&n)!=EOF)
16     {
17         scanf("%lld%lld",&a1,&r1); bool Ok=true;
18         for (LL i=1;i<n;i++)
19         {
20             scanf("%lld%lld",&a2,&r2);
21             LL a=a1,b=a2,m=r2-r1;
22             LL d=Extend_Gcd(a,b,x,y);
23             if (m%d) Ok=false;
24             x=(((x*m/d))%(b/d)+(b/d))%(b/d);
25             r1=x*a1+r1;
26             a1=(a1*a2)/d;
27         }
28         if (Ok) printf("%lld\n",r1); else puts("-1");
29     }
30     return 0;
31 }