hdu 3579:Hello Kiki (线性同余方程组求正整数解)

最新推荐文章于 2019-09-23 19:40:40 发布

Hacker_vision

最新推荐文章于 2019-09-23 19:40:40 发布

阅读量686

点赞数

分类专栏：数论文章标签：线性同余方程组

本文链接：https://blog.csdn.net/u012717411/article/details/43032059

版权

数论专栏收录该内容

29 篇文章 0 订阅

订阅专栏

Hello Kiki

Problem Description

Hello Kiki is such a lovely girl that she loves doing counting in a different way. For example, when she is counting X coins, she count them N times. Each time she divide the coins into several same sized groups and write down the group size Mi and the number of the remaining coins Ai on her note.
One day Kiki's father found her note and he wanted to know how much coins Kiki was counting.

Input

The first line is T indicating the number of test cases.
Each case contains N on the first line, Mi(1 <= i <= N) on the second line, and corresponding Ai(1 <= i <= N) on the third line.
All numbers in the input and output are integers.
1 <= T <= 100, 1 <= N <= 6, 1 <= Mi <= 50, 0 <= Ai < Mi

Output

For each case output the least positive integer X which Kiki was counting in the sample output format. If there is no solution then output -1.

Sample Input

  
  
   
   2
2
14 57
5 56
5
19 54 40 24 80
11 2 36 20 76

Sample Output

  
  
   
   Case 1: 341
  
  
  
  
   
   Case 2: 5996

解题思路：参考poj 2891 Strange Way To Express Integers(线性同余方程组)，题目链接

http://blog.csdn.net/u012717411/article/details/43016705

注意0<=A[i]，A[i]可均为0，即X可能为零，这在许多问题中是不会出现的，在这里是个坑。。。。。要特判一下

参考代码：

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
#include 
       
       
         #include 
        
          #include 
         
           using namespace std; typedef long long ll; const int maxn=1000000+10; ll A[100],M[100],x,y,a,b,m; ll extended_gcd(ll a,ll b,ll &x,ll &y) { if(b==0) {x=1;y=0;return a;} ll d=extended_gcd(b,a%b,y,x); y-=a/b*x; return d; } ll solve() { int n;cin>>n; for(int i=1;i<=n;i++) cin>>M[i]; for(int i=1;i<=n;i++) cin>>A[i]; for(int i=2;i<=n;i++){ a=M[1];b=M[i];m=A[i]-A[1]; ll d=extended_gcd(a,b,x,y); if(m%d) return -1; x=((x*m/d)%(b/d)+(b/d))%(b/d); A[1]=x*M[1]+A[1]; M[1]=(M[1]*M[i])/d; } ll ans=A[1];if(A[1]==0) ans+=M[1]; return ans; } int main() { // freopen("input.txt","r",stdin); int T;cin>>T; int count=0; while(T--){ cout<<"Case "<<++count<<": "< 
          
            <

Hacker_vision

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
hdu 3579:Hello Kiki (线性同余方程组求正整数解)

Hello KikiProblem DescriptionHello Kiki is such a lovely girl that she loves doing counting in a different way. For example, when she is counting X coins, she count them N times. Each time she div
复制链接

扫一扫