UVA 10104 - Euclid Problem
2013-04-06 21:26
309 查看
题目大意:AX+BY=D,D是A,B的最大公约数,要求出满足条件的X,Y,要求|X|+|Y| 最小,并且X<=Y 思路分析:扩展欧几里得模版题 AC Code:#include<cstdio> #include<iostream> #include<cstring> #include<cstdlib> using namespace std; typedef long long LL; void gcd(LL a,LL b,LL& d,LL& x,LL& y) { if(!b) { d=a; x=1; y=0; } else { gcd(b,a%b,d,y,x); y-=x*(a/b); } } int main() { LL a,b,d,x,y; while(cin>>a>>b) { gcd(a,b,d,x,y); cout<<x<<" "<<y<<" "<<d<<endl; } return 0; }
相关文章推荐
- uva 10104 Euclid Problem (数论-扩展欧几里德)
- UVa Problem 10104 Euclid Problem (欧几里德问题)
- uva 10104 Euclid Problem (数论-扩展欧几里德)
- UVA10104 Euclid Problem【扩展欧几里得算法】
- uva 10104 - Euclid Problem
- UVa 10104 - Euclid Problem
- uva10104 - Euclid Problem
- UVA, 10104 Euclid Problem
- UVa-10104-Euclid Problem
- UVa Problem Solution: 10104 - Euclid Problem
- PC/UVa 题号: 110703/1014 Euclid Problem
- 10104 - Euclid Problem
- UVa 524 Prime Ring Problem(素数环)
- UVA100- The 3n + 1 problem
- uva 10025 The ? 1 ? 2 ? ... ? n = k problem 给公式填加减号
- Problem on Group Trip UVALive - 7219
- UVA 101 The Blocks Problem
- Problem 034——UVa 136 - Ugly Numbers
- UVa 100 The 3n + 1 problem
- UVA - 100 - The 3n + 1 problem