POJ-2891-Strange Way to Express Integers(解线性同余方程)
来源:互联网 发布:淘宝会员名大全霸气 编辑:程序博客网 时间:2024/06/06 19:09
Strange Way to Express Integers
Time Limit: 1000MS Memory Limit: 131072K
Description
Elina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is described as following:
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
2
8 7
11 9
Sample Output
31
这是线性同余方程的模板题
#include <cstdio>typedef long long ll;void gcd(ll a,ll b,ll &q,ll &x,ll &y){ if(b==0) { x=1; y=0; q=a; } else { gcd(b,a%b,q,x,y); int tem=x; x=y; y=tem-a/b*y; }}int main(){ int k; while(~scanf("%d",&k)) { ll a1,r1,a2,r2,a,b,c; ll q,x,y; bool flag=1; scanf("%lld%lld",&a1,&r1); for(int i = 1;i < k;i ++) { scanf("%lld%lld",&a2,&r2); a=a1;b=a2;c=r2-r1; gcd(a,b,q,x,y); if(c%q!=0) flag=0; ll tem=b/q; x=(x*(c/q)%tem+tem)%tem; r1=a1*x+r1; a1=a1*(a2/q); } if(flag) printf("%lld\n",r1); else printf("-1\n"); } 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 解一元线性同余方程组
- poj 2891 Strange Way to Express Integers(解线性同余方程组) + hdu 1573
- POJ 2891 Strange Way to Express Integers(exgcd—解一元线性同余方程组)
- POJ 2891 Strange Way to Express Integers解线性同余方程组(中国剩余定理不互质版)
- poj2891 Strange Way to Express Integers 解线性同余方程的应用
- POJ2891 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(一元线性同余方程组模版题)
- 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(一元线性同余方程组)
- Strange Way to Express Integers(poj2891线性同余方程组)
- POJ2891 Strange Way to Express Integers 线性同余方程组
- 一份呕心沥血整理的bug list
- Hbase集群安装配置
- 多线程、同步代码块
- opencv cvMat数据类型
- linux初学者-pxe装机篇
- POJ-2891-Strange Way to Express Integers(解线性同余方程)
- 刘二白的求学路上①
- MYSQL学习笔记(二十四)安全管理
- 如何查看连接自己wifi 的设备数目以及详细信息
- 类加载器
- Tpshop学习(7)-支付宝支付集成
- C语言中位操作用法
- 关于Maven添加hibernate-validator依赖后项目报错的解决方案
- MYSQL学习笔记(二十五)数据库维护