HDOJ 题目2669 Romantic(拓展的欧几里得,模板)
2014-10-18 22:41
387 查看
Romantic
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3149 Accepted Submission(s): 1243
Problem Description
The Sky is Sprite.
The Birds is Fly in the Sky.
The Wind is Wonderful.
Blew Throw the Trees
Trees are Shaking, Leaves are Falling.
Lovers Walk passing, and so are You.
................................Write in English class by yifenfei
![](http://acm.hdu.edu.cn/data/images/C175-1002-1.jpg)
Girls are clever and bright. In HDU every girl like math. Every girl like to solve math problem!
Now tell you two nonnegative integer a and b. Find the nonnegative integer X and integer Y to satisfy X*a + Y*b = 1. If no such answer print "sorry" instead.
Input
The input contains multiple test cases.
Each case two nonnegative integer a,b (0<a, b<=2^31)
Output
output nonnegative integer X and integer Y, if there are more answers than the X smaller one will be choosed. If no answer put "sorry" instead.
Sample Input
77 51
10 44
34 79
Sample Output
2 -3
sorry
7 -3
Author
yifenfei
Source
HDU女生专场公开赛——谁说女子不如男
Recommend
lcy | We have carefully selected several similar problems for you: 2668 2671 2670 2672 2673
ac代码
#include<stdio.h> #include<string.h> __int64 exgcd(__int64 a,__int64 b,__int64 &x,__int64 &y) { if(b==0) { x=1; y=0; return a; } else { __int64 d=exgcd(b,a%b,x,y); __int64 t=x; x=y; y=t-a/b*y; return d; } } int main() { __int64 a,b,x,y; while(scanf("%I64d%I64d",&a,&b)!=EOF) { __int64 d=exgcd(a,b,x,y); if(1%d) printf("sorry\n"); else { while(x<0) { x+=b; y-=a; } printf("%I64d %I64d\n",x,y); } } }
相关文章推荐
- HDU 2669 Romantic 拓展欧几里得模板题
- HDOJ-----2669---Romantic扩展欧几里得
- hdu 2669 Romantic 扩展欧几里得求线性方程模板题
- hdoj 2669 Romantic 【扩展欧几里得 求解最小非负解】
- HDOJ 题目3579 Hello Kiki(中国剩余定理,拓展的欧几里得)
- HDU 2669 Romantic(拓展欧几里得)
- hdoj 2669 Romantic 【扩展欧几里得 求解最小非负解】
- HDOJ 题目1573 X问题(中国剩余定理,拓展欧几里得)
- HDOJ 题目1576 A/B(拓展欧几里得求乘法逆元)
- HDU 2669 Romantic 扩展欧几里得
- HDOJ 题目1083Courses(二分图匹配,匈牙利算法模板)
- HDOJ 题目1521排列组合(指数型母函数,模板)
- 扩展欧几里得 Romantic (HDU - 2669)
- 拓展欧几里得模板
- HDU-2669 拓展欧几里得
- HDOJ题目2544最短路(最短路径,floyd,模板)
- HDU 1576 A/B(拓展欧几里得,模板题)
- HDOJ 题目1561 The more, The Better(树状dp,模板)
- hdoj-【2669 Romantic】
- hdu 2669 Romantic (扩展欧几里得)