hdu-2669
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了hdu-2669相关的知识,希望对你有一定的参考价值。
http://acm.hdu.edu.cn/showproblem.php?pid=2669
Romantic
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4235 Accepted Submission(s): 1771
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
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.
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
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)
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
扩展欧几里得模板题
1 #include<iostream> 2 #include<cstdio> 3 using namespace std; 4 #define ll __int64 5 6 ll x, y; 7 ll exgcd(ll a, ll b){ 8 if(b == 0){ 9 x = 1; 10 y = 0; 11 return a; 12 } 13 ll d = exgcd(b, a%b); 14 ll t = x; 15 x = y; 16 y = t-a/b*y; 17 return d; 18 } 19 20 int main(){ 21 ll a, b; 22 while(~scanf("%I64d%I64d",&a,&b)){ 23 //cout<<a<<b<<endl; 24 //ll g = 0; 25 ll g = exgcd(a, b); 26 if(g == 1){ 27 while(x < 0){ 28 x += b; 29 y -= a; 30 } 31 printf("%I64d %I64d\n",x,y); 32 } 33 else 34 printf("sorry\n"); 35 } 36 return 0; 37 }
以上是关于hdu-2669的主要内容,如果未能解决你的问题,请参考以下文章