【POJ 2891 Strange Way to Express Integers】+ 扩展欧几里德
来源:互联网 发布:sas 优化案例 编辑:程序博客网 时间:2024/06/14 04:13
Strange Way to Express Integers
Time Limit: 1000MS Memory Limit: 131072K
Total Submissions: 14741 Accepted: 4827
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
扩展欧几里德~还可以用来求线性方程即方程组~还是太菜~(=-=)
AC代码 :
#include<cstdio>typedef long long LL;LL EXGCD(LL a,LL b,LL &x,LL &y){ if(!b){ x = 1; y = 0; return a; } LL ans = EXGCD(b,a % b,y,x); y -= a / b * x; return ans;}int main(){ LL n,a,b,c1,c2,x,y,v; while(scanf("%lld",&n) != EOF){ scanf("%lld %lld",&a,&c1); bool ok = false; for(int i = 1 ; i < n ; i++){ scanf("%lld %lld",&b,&c2); if(ok) continue; LL d = EXGCD(a,b,x,y),c = c2 - c1; if(c % d){ ok = true; continue; } c /= d; v = b / d; x = ((x * c) % v + v) % v; c1 += a * x; a = a / d * b; c1 %= a; } if(ok) printf("-1\n"); else printf("%lld\n",c1); } return 0;}
- 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 (扩展欧几里德)
- poj 2891 Strange Way to Express Integers 扩展欧几里得运用
- POJ 2891 Strange Way to Express Integers(扩展GCD)
- 【POJ 2891】Strange Way to Express Integers(扩展欧几里得)
- POJ 2891 Strange Way to Express Integers 扩展gcd
- POJ Strange Way to Express Integers 2891(扩展欧几里得)
- 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
- poj 2891 Strange Way to Express Integers
- POJ 2891 Strange Way to Express Integers
- Vojnici
- Dubbo中使用高效的Java序列化(Kryo和FST)
- Log4j.properties 属性详解
- MapReduce开发的基础知识
- [LeetCode]Unique Binary Search Trees
- 【POJ 2891 Strange Way to Express Integers】+ 扩展欧几里德
- JHipster入门
- 串行通讯之.NET SerialPort
- haproxy+keepalived+mycat+mysql (读写分离)
- 排序用法 order by asc desc
- 关于Python pip 安装第三方模块失败
- 《C++ Primer》读书笔记-第五章 语句
- 相机的Angle of View, Field of view && Focal length
- iOS下将照片保存到相册的三种方法