Time Limit: 1000MS | Memory Limit: 131072K | |
Total Submissions: 19893 | Accepted: 6711 |
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 a1, a2, …, ak. For some non-negative m, divide it by every ai (1 ≤ i ≤ k) to find the remainder ri. If a1, a2, …, ak are properly chosen, m can be determined, then the pairs (ai, ri) 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 ai, ri (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
列等式发现m%ai=ri同余的那个三个横杠不会写。。。
就是中国剩余定理,解同余方程求m的值,但是这个是有特判的,直接用之前的没有特判的模板是wa的
直接给代码把:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll a[100005],r[100005];
int n;
ll exgcd(ll a,ll b,ll &x,ll &y)
{
if(b==0)
return x=1,y=0,a;
ll tmp=exgcd(b,a%b,y,x);
y-=a/b*x;
return tmp;
}
ll solve()
{
ll M=a[1],R=r[1],x,y,d;
for(int i=2; i<=n; i++)
{
d=exgcd(M,a[i],x,y);
if((R-r[i])%d!=0)
return -1;
x=(R-r[i])/d*x%a[i];
R-=x*M;
M=M/d*a[i];
R%=M;
}
return (R%M+M)%M;
}
int main()
{
while(~scanf("%d",&n))
{
for(int i=1; i<=n; i++)
scanf("%lld%lld",&a[i],&r[i]);
printf("%lld\n",solve());
}
return 0;
}