中国剩余定理(非互质)hdu3579 Hello Kiki ====注意刚好全部整除的情况
2017-03-06 20:43
330 查看
Hello Kiki
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3578 Accepted Submission(s): 1334
Problem Description
One day I was shopping in the supermarket. There was a cashier counting coins seriously when a little kid running and singing "门前大桥下游过一群鸭,快来快来 数一数,二四六七八". And then the cashier put the counted coins back morosely and count again...
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
#include<cstdio> #include<iostream> using namespace std; #define ll long long ll g; void exgcd(ll a,ll b,ll& x,ll& y){ if(b==0){ g=a; x=1; y=0; } else{ exgcd(b,a%b,y,x); y-=x*(a/b); } } int main(){ ll n,a,m,mm[10],aa[10],k1,k2,c,T; cin>>T; for(int i=1;i<=T;i++){ int flag=1; cin>>n; for(int i=1;i<=n;i++) cin>>mm[i]; for(int i=1;i<=n;i++) cin>>aa[i]; cout<<"Case "<<i<<": "; a=aa[1]; m=mm[1]; //m*k1+a=m[i]*k2+a[i] for(int i=2;i<=n;i++){ c=aa[i]-a; exgcd(m,mm[i],k1,k2); if(c%g){ flag=0; cout<<-1<<endl; break; } k1=k1*c/g; k1=(k1+mm[i]/g)%(mm[i]/g); a=k1*m+a; m=m*mm[i]/g; } if(flag) { a=(a+m)%m; if(a) cout<<a<<endl; else cout<<m<<endl; } } return 0; }
相关文章推荐
- Hello Kiki(中国剩余定理——不互质的情况)
- HDU 3579 Hello Kiki(拓展中国剩余定理)
- X问题 HDU - 1573 (中国剩余定理)(非互质情况)
- HDU 3579 Hello Kiki(中国剩余定理)
- 中国剩余定理 (非互质情况)
- HDU3579Hello Kiki(中国剩余定理)(不互质的情况)
- HDU3579:Hello Kiki(解一元线性同余方程组)
- HDU3579中国剩余定理(不互质的情况)
- hdu3575(中国剩余定理,注意特殊情况处理)
- 中国剩余定理(互质与不互质的情况)
- 中国剩余定理(不互质的情况)-HDU3579
- hdu 3579 Hello Kiki 不互质的中国剩余定理
- hdu 1573(中国剩余定理非互质情况)
- HDU 1573 X问题 (非互质情况下的中国剩余定理)
- hdu1573中国剩余问题定理模数非互质的的情况
- POJ3579(Hello Kiki 中国剩余定律,同余方程)
- poj 1006 Biorhythms(中国剩余定理)
- 51nod1079(中国剩余定理)
- 中国的全部(省,市)的数据库
- 中国剩余定理