Sicily 1300. Teacher’s Number

最新推荐文章于 2016-01-17 11:09:33 发布

Nightonke

最新推荐文章于 2016-01-17 11:09:33 发布

阅读量681

点赞数

分类专栏： sicily 文章标签： sicily

本文链接：https://blog.csdn.net/u012925008/article/details/44458087

版权

sicily 专栏收录该内容

413 篇文章 0 订阅

订阅专栏

1300. Teacher’s Number

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

A teacher and his students play a number game. He divides his students into two groups and each group has k persons. At first, he asks each of the students in Group 1 to tell an integer, and the i^th (1≤i≤k) student tells number b_i. Then, he appoints each of the students in Group 2 a positive integer, the i^th (1≤i≤k) student appointed number mi and the greatest common divisor of every pair of numbers m_iand m_j (1≤i<j≤k) is one.

When each student has his own number, the teacher tells them, “Attention, everybody! I find an interesting thing. I have a nonnegative integer, and I find that when I subtract my number with b_i, the difference happens to be divided exactly by m_i. That happens with every pair of numbers b_i and m_i. Now can anyone of you tell me what my number is?”

The students think for a long time and fail to solve the problem .Can you help them? The answer may not be unique. To simplify the problem, you only need to find the smallest one.

Input

The input text file contains several test cases. In each case, the first line is an integer k (k<30), the number of students in each group. The second line contains k integers, b₁, b₂… b_k，the numbers chosen by the students in Group 1. The third line contains k positive integers, m₁, m₂…, m_k, the numbers appointed to the students in Group 2.

The file ends with k=0.

Output

For each case, output one line containing the teacher’s number.

Sample Input

31 2 32 3 50

Sample Output

Problem Source

ZSUACM Team Member

// Problem#: 1300
// Submission#: 3263835
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <stdio.h>
#include <iostream>
#include <math.h>
using namespace std;
long k;
long long b[32],m[32];
 
//满足负数求mod
long long mod(long long a ,long long b)
{return (a%b+b)%b;}
 
//求解ax+by=gcd(a,b),扩展欧几里得
void Mgcd(long long a,long long b,long long &d,long long &x,long long &y)
{
    if(b==0){d=a;x=1;y=0;return;}
    Mgcd(b,a%b,d,y,x);y-=x*(a/b);
}
//求解ux mod m = 1
long long Inv(long long u ,long long m )
{long long d,x,y;Mgcd(u,m,d,x,y);return mod(x,m);}
 
 
bool same()
{
    long i;for( i=2 ; i<=k ; i++ )
    {if( b[i]!=b[i-1] ) return false;}
    return true;
}
 
//中国剩余定理
long long China()
{
    long i;long long M=1,x=0;
    for(i=1;i<=k;i++)M*=m[i];
    if(same()){return mod(b[1],M);}/这是判断余数是否全相等，全相等则直接可得出答案
 
    for(i=1;i<=k;i++)b[i]=mod(b[i],m[i]);将b[]变为正整数
 
    for( i=1 ; i<=k ; i++ )
    {x+=b[i]*(M/m[i])*Inv(M/m[i],m[i]);}
   
    return x%=M;
}
int main()
{
    long i;
   
    while(scanf("%ld",&k),k>0)
    {
        for(i=1;i<=k;i++)cin >> b[i];
        for(i=1;i<=k;i++)cin >> m[i];
        printf("%lld\n",China());
    }
    return 0;
}