Strange Way to Express Integers（中国剩余定理+不互质）

最新推荐文章于 2021-05-13 20:47:26 发布

寻找星空的孩子

最新推荐文章于 2021-05-13 20:47:26 发布

阅读量2.3k

点赞数 1

分类专栏： ACM-中国剩余定理 ACM-扩展欧几里德 ACM-数论 ACM-POJ（北京大学） ACM--数论专题文章标签： Strange Way to Expre poj2891 中国剩余定理数论

本文链接：https://blog.csdn.net/u010579068/article/details/45446347

版权

ACM-数论同时被 3 个专栏收录

61 篇文章 1 订阅

订阅专栏

ACM--数论专题

24 篇文章 31 订阅

订阅专栏

ACM-扩展欧几里德

17 篇文章 0 订阅

订阅专栏

Strange Way to Express Integers

Time Limit:1000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 2891

Appoint description:

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.

题意：给你k组数。x%M[i]=A[i];

思路：中国剩余定理，扩展欧几里德

不会的可以参考：http://blog.csdn.net/u010579068/article/details/45422941

转载请注明出处：http://blog.csdn.net/u010579068

题目链接：http://poj.org/problem?id=2891

#include<stdio.h>
#define LL __int64

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

LL M[55000],A[55000];


LL China(int r)
{
    LL dm,i,a,b,x,y,d;
    LL c,c1,c2;
    a=M[0];
    c1=A[0];
    for(i=1; i<r; i++)
    {
        b=M[i];
        c2=A[i];
        exgcd(a,b,d,x,y);
        c=c2-c1;
        if(c%d) return -1;//c一定是d的倍数，如果不是，则，肯定无解
        dm=b/d;
        x=((x*(c/d))%dm+dm)%dm;//保证x为最小正数//c/dm是余数，系数扩大余数被
        c1=a*x+c1;
        a=a*dm;
    }
    if(c1==0)//余数为0，说明M[]是等比数列。且余数都为0
    {
        c1=1;
        for(i=0;i<r;i++)
            c1=c1*M[i]/gcd(c1,M[i]);
    }
    return c1;
}
int main()
{
    int n;

    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0;i<n;i++)
        {
            scanf("%I64d%I64d",&M[i],&A[i]);
        }
        if(n==1){ printf("%I64d\n",A[0]);continue;}
        LL ans=China(n);
        printf("%I64d\n",ans);

    }
    return 0;
}