poj 2891 Strange Way to Express Integers 一元线性同余方程组
来源:互联网 发布:2016电影采集网站源码 编辑:程序博客网 时间:2024/05/22 06:09
Description
Choose k different positive integers a1, a2, …, ak. For some non-negative m, divide it by every ai (1 ≤ i ≤ k) to find the remainder ri. If a1, a2, …, ak are properly chosen, m can be determined, then the pairs (ai, ri) 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 ai, ri (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
28 711 9
Sample Output
31
Hint
All integers in the input and the output are non-negative and can be represented by 64-bit integral types.
Source
#include<cstdio>#include<string>#include<cstring>#include<iostream>#include<cmath>#include<algorithm>#include<vector>using namespace std;#define all(x) (x).begin(), (x).end()#define for0(a, n) for (int (a) = 0; (a) < (n); (a)++)#define for1(a, n) for (int (a) = 1; (a) <= (n); (a)++)#define mes(a,x,s) memset(a,x,(s)*sizeof a[0])#define mem(a,x) memset(a,x,sizeof a)#define ysk(x) (1<<(x))typedef long long ll;typedef pair<int, int> pii;const int INF =0x3f3f3f3f;int N;ll exgcd(ll a,ll b,ll &X,ll &Y){ if(!b) { X=1,Y=0; return a; } ll ans=exgcd(b,a%b,X,Y); ll X1=X,Y1=Y; X=Y1; Y=X1-a/b*Y1; return ans;}void solve(){ ll a1,r1,a,b,c,d,x0,y0,a2,r2; cin>>a1>>r1; bool hasSolve=1; for(int i=1;i<N;i++) { cin>>a2>>r2; a=a1,b=a2,c=r2-r1; d=exgcd(a,b,x0,y0); if(c%d) hasSolve=0; if(hasSolve) { ll t=b/d; x0=(x0*(c/d)%t+t)%t; r1=a1*x0+r1; a1=a1*(a2/d); } } if(!hasSolve) puts("-1"); else printf("%lld\n",r1);}int main(){ std::ios::sync_with_stdio(false); while(cin>>N) solve(); return 0;}
- POJ 2891 Strange Way to Express Integers(解一元线性同余方程组)
- POJ 2891 Strange Way to Express Integers 解一元线性同余方程组
- POJ 2891 Strange Way to Express Integers(一元线性同余方程组模版题)
- POJ 2891 Strange Way to Express Integers(exgcd—解一元线性同余方程组)
- POJ 2891 Strange Way to Express Integers(一元线性同余方程组)
- poj 2891 Strange Way to Express Integers 一元线性同余方程组
- poj 2891 Strange Way to Express Integers(一元线性同余方程组)
- poj 2891 Strange Way to Express Integers(解线性同余方程组) + hdu 1573
- poj 2891 Strange Way To Express Integers(线性同余方程组)
- poj 2891 Strange Way to Express Integers(线性同余方程组求解)
- POJ 2891 Strange Way to Express Integers解线性同余方程组(中国剩余定理不互质版)
- POJ2891——Strange Way to Express Integers(一元线性同余方程组)
- POJ2891 Strange Way to Express Integers【一元线性同余方程组】
- POJ2891 Strange Way to Express Integers 一元线性同余方程组
- 【POJ2891】Strange Way to Express Integers-解一元线性同余方程组
- poj2891 Strange Way to Express Integers【解一元线性同余方程组模板】
- Strange Way to Express Integers(poj2891线性同余方程组)
- POJ2891 Strange Way to Express Integers 线性同余方程组
- 常用的正则表达式
- HDU 1711 Number Sequence (KMP)
- this关键字
- 关于IP地址
- 给定一本书,其中包含n页,计算出书的全部页码中用到了多少个数字0…9
- poj 2891 Strange Way to Express Integers 一元线性同余方程组
- Android项目之多功能新闻客户端(下)
- StarUML使用说明-指导手册
- 20161015
- 闭包
- LeetCode: 字符串转换到整数
- 1622-5 孔富晨 总结《2016年10月15日》 【连续总结第15天】
- Laravel控制器详解
- Intent 和 Intent 过滤器