POJ 2891 Strange Way to Express Integers 解题报告（中国剩余定理）

最新推荐文章于 2020-11-11 11:34:36 发布

原创最新推荐文章于 2020-11-11 11:34:36 发布 · 899 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#中国剩余定理

ACM 同时被 3 个专栏收录

224 篇文章

订阅专栏

数学

96 篇文章

订阅专栏

扩展欧几里得

6 篇文章

订阅专栏

本文提供了解决利用不同正整数表达非负整数的算法，通过中国剩余定理简化计算过程。重点介绍了如何从配对中找到原始整数，并强调了避免长整数溢出的重要性。

Strange Way to Express Integers

Time Limit: 1000MS		Memory Limit: 131072K
Total Submissions: 9349		Accepted: 2826

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

Hint

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

解题报告；中国剩余定理。要注意的是不要超出long long。以前的模板一直WA，估计是中间超了。仿照别人的写了个新的。

模线性方程的合并可以自己推导出来，还是自己来一遍比较好。代码如下：

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

typedef long long LL;
const int maxn = 10000;
LL mi[maxn];
LL ai[maxn];
int cas=1;

void gcd(LL a,LL b,LL &d,LL &x,LL &y)
{
    if(b==0)
    {
        d=a;
        x=1;
        y=0;
    }
    else
    {
        gcd(b,a%b,d,y,x);
        y-=x*(a/b);
    }
}

LL china_2(LL n,LL m[],LL a[])
{
    LL aa = a[0];
    LL mm = m[0];

    for(int i=1;i<n;i++)
    {
        LL sub=(a[i]-aa);

        LL d,x,y;
        gcd(mm,m[i],d,x,y);
        if(sub%d) return -1;

        LL newM = m[i]/d;
        newM = (sub/d*x%newM+newM)%newM;

        aa = mm*newM + aa;
        mm = mm*m[i]/d;
    }
    aa = (aa+mm)%mm;
    if(aa==0) aa=mm;
    return aa;
}

void work(int n)
{
    for(int i=0;i<n;i++) scanf("%lld %lld", mi+i, ai+i);

    printf("%lld\n", china_2(n, mi, ai));
}

int main()
{
    int n;
    while(~scanf("%d", &n))
        work(n);
}