POJ 2891 Strange Way to Express Integers

Strange Way to Express Integers

Time Limit: 1000MS		Memory Limit: 131072K
Total Submissions: 14791		Accepted: 4849

Description

Elina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is described as following:

Choose k different positive integers a₁, a₂, …, a_k. For some non-negative m, divide it by every a_i (1 ≤ i ≤ k) to find the remainder r_i. If a₁, a₂, …, a_k are properly chosen, m can be determined, then the pairs (a_i, r_i) can be used to express m.

“It is easy to calculate the pairs from m, ” said Elina. “But how can I find m from the pairs?”

Since Elina is new to programming, this problem is too difficult for her. Can you help her?

Input

The input contains multiple test cases. Each test cases consists of some lines.

• Line 1: Contains the integer k.
• Lines 2 ~ k + 1: Each contains a pair of integers a_i, r_i (1 ≤ i ≤ k).

Output

Output the non-negative integer m on a separate line for each test case. If there are multiple possible values, output the smallest one. If there are no possible values, output -1.

Sample Input

2
8 7
11 9

Sample Output

31

Hint

All integers in the input and the output are non-negative and can be represented by 64-bit integral types.

Source

POJ Monthly--2006.07.30, Static

中国剩余定理：

由于这道题目里面的ai、ri之间不满足两两互质的性质，所以不能用中国剩余定理直接求解。
不过，我们可以模仿中国剩余定理的做法来解决这个问题。
如果只有一个方程：x mod a0 = r0。那么，显然x的最小正值为a0+r0。
根据模的性质，我们容易得知，x+a0*k均为该方程的解。(k为正整数)
如果多了一个方程：x mod a1 = r1。那么，我们为了使之间求得的解x0=a0+r0能够同时满足这两个方程，只好令x0=x0+a0*k，显然这样做x0仍然满足第一个方程。这时候我 们相当于要求解这样一个模方程：(x0+a0*k) mod a1 = r1。这个方程我们可以用拓展欧几里得算法求得k的值。这样，只要令x0变成x0+a0*k，就能同时满足这两个方程了。
推而广之，对于方程x mod ai = ri，假如我们之前求得的解为X，那么我们要令X变成X+k*LCM(a0,a1,a2...ai-1)，使得它满足这个方程。k我们可以用拓展欧几里得 算法求解，LCM可以在每一次更新，这样就能在接近O(klogk)的时间复杂度内解决这个问题了。
无解的判断：若某个(X+k*LCM) mod ai = ri无整数解，那么原方程组无解。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define LL __int64 
using namespace std;
int flag;
LL d,result;
LL e_gcd(LL a,LL b,LL &x,LL &y)  
{  
    if(b==0)  
    {  
        x=1;  
        y=0;  
        return a;  
    }  
    LL ans=e_gcd(b,a%b,x,y);  
    LL temp=x;  
    x=y;  
    y=temp-a/b*y;  
    return ans;  
}  
void fun(LL a,LL b,LL n)
{
   LL x,y;
   d=e_gcd(a,n,x,y);     
   if(b%d!=0)
      flag =1;
   result=(x*(b/d)%n+n)%n;
}
int main()
{
	int k,i,j;
	LL a1,r1,a2,r2;
	while(scanf("%d",&k)!=EOF)
	{
		flag=0;
		scanf("%I64d%I64d",&a1,&r1);
		k--;
		while(k--)
		{
		     scanf("%I64d%I64d",&a2,&r2);
		     fun(a1,r2-r1,a2);
             r1+=a1*result;
             a1=a1*a2/d;
             r1=(r1%a1+a1)%a1;
		}
		if(flag)
		  printf("-1\n");
		else
		  printf("%I64d\n",r1);
	}
	return 0;
}