poj2891(一元线性同于方程组)
来源:互联网 发布:诺言是什么软件 编辑:程序博客网 时间:2024/04/29 09:34
Description
Choose k different positive integers a1, a2,…, ak. For some non-negative m, divide it by everyai (1 ≤ i ≤ k) to find the remainder ri. Ifa1, 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 findm 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.
解一元线性方程组:
x(mod a1)=r1(mod a1)
x(mod a2)=r2(mod a2)
.....
xn(mod an)=rn (mod an);
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;typedef long long ll;void exgcd(ll a,ll b,ll &d,ll &x,ll &y){ if(!b){d=a;x=1;y=0;} else { exgcd(b,a%b,d,y,x); y-=x*(a/b); }}int main(){ int n; ll a1,a2,r1,r2,m; while(scanf("%lld",&n)!=EOF) { ll a,b,c,d,x0,y0; bool ifhave=true; scanf("%lld%lld",&a1,&r1); for(int i=1;i<n;i++) { scanf("%lld%lld",&a2,&r2); a=a1,b=a2,c=r2-r1; exgcd(a,b,d,x0,y0); if(c%d!=0) { ifhave=false; } ll t=b/d; x0=(x0*(c/d)%t+t)%t; r1=a1*x0+r1; a1=a1*(a2/d); } if(!ifhave) printf("-1\n"); else { m=r1; printf("%lld\n",m); } } return 0;}
- poj2891(一元线性同于方程组)
- 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 线性同余方程组
- HDU1573 一元线性同余方程组
- 解一元线性同余方程组模板
- 求解一元线性同余方程组模版
- 解一元线性同余方程组
- 一元线性同余方程组【数论
- Biorhythms(一元线性同余方程组)
- 同余问题(3)一元线性同余方程组
- 一元线性同余方程&&一元线性m同余方程组(模板)
- POJ 2891 解一元线性同余方程组
- hdu 4634 Swipe Bo 搜索
- WH_KEYBOARD和WH_KEYBOARD_LL的区别
- accdb格式和mdb格式的转换
- uva 401
- 排序之归并排序
- poj2891(一元线性同于方程组)
- 快播引起资源管理器停止工作并重启的问题
- post/get 提交form中的数据会刷新页面!
- C#5种方式生成缩略图
- UNIX网络编程——select函数的并发限制和 poll 函数应用举例
- UserControl调用Umbraco的Data Types
- ARM gdbserver gdb 基于2.4的内核
- VS2010中CMFCToolBar的用法
- Android System.loadLibrary及JNI_OnLoad简介