中国剩余定理(非互质)hdu3579 Hello Kiki ====注意刚好全部整除的情况
来源:互联网 发布:画江湖之换世门生知乎 编辑:程序博客网 时间:2024/05/16 07:49
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.
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
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
2214 575 56519 54 40 24 8011 2 36 20 76
Sample Output
Case 1: 341Case 2: 5996#include<cstdio>#include<iostream>using namespace std;#define ll long longll 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;elsecout<<m<<endl;}}return 0;}
1 0
- 中国剩余定理(非互质)hdu3579 Hello Kiki ====注意刚好全部整除的情况
- Hello Kiki(hdu3579+不互质的中国剩余定理)
- HDU3579中国剩余定理(不互质的情况)
- 中国剩余定理(不互质的情况)-HDU3579
- HDU 3579 Hello Kiki 中国剩余定理 不互质情况
- 【中国剩余定理-M不互质的情况】HDU Hello Kiki 2579
- HDU 3579 Hello Kiki(中国剩余定理)
- HDU 3579 Hello Kiki(拓展中国剩余定理)
- HDU3579 Hello Kiki(CRT非互质)
- HDOJ 题目3579 Hello Kiki(中国剩余定理,拓展的欧几里得)
- HDU 3579 Hello Kiki 解题报告(中国剩余定理 非互质)
- HDU 3579 Hello Kiki 中国剩余定理(合并方程
- hdoj-3579-Hello Kiki【中国剩余定理 & 除数不互质】
- 中国剩余定理 (非互质情况)
- Hdu 1573 X问题 + Hdu 3579 Hello Kiki (模线性方程组-非互质中国剩余定理)
- hdu3575(中国剩余定理,注意特殊情况处理)
- [HDU3579] Hello Kiki
- 中国剩余定理模板(互质的情况)
- BZOJ 3224 Tyvj 1728 普通平衡树——treap
- hibernate实现多条件组合的模糊查询
- java实现——2001计算两点间的距离
- Firefox在input标签padding上下边距过大时的bug现象
- MERGE语句用来合并UPDATE和INSERT语句,一张表的大数据操作,要同时进行增删改,提高性能
- 中国剩余定理(非互质)hdu3579 Hello Kiki ====注意刚好全部整除的情况
- Leetcode twosum
- 安装SQuirrel SQL Client连接Phoenix操作HBase
- jzoj 5001. 【NOI2017模拟3.4】Trie树 状压dp
- 利用摄像头拍照并保存
- 一个基于Behave框架的http接口测试实例
- C语言:顺序表
- Java常用设计模式
- 算法入门---java语言实现的冒泡排序小结