关闭

Romantic(扩展欧几里得算法)

138人阅读 评论(0) 收藏 举报
分类:

Romantic

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3507    Accepted Submission(s): 1423


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.
 

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


#include<cstdio>
#include<iostream>
#define ll long long
using namespace std;
ll exGcd(ll a,ll b,ll &x,ll &y)
{
	if(b==0)
	{
		x=1;
		y=0;
		return a;// 此时a是最开始(a,b)的最大公约数,那么  gcd(a,b)*1+ 0*0=gcd(a,b),肯定对的,在这里,我认为,y可以为任何值都对
	}

	ll d=exGcd(b,a%b,y,x);
	y-=a/b*x;
	return d;//返回最大公约数
}
int main()
{
   ll n,m,x,y;
    while(cin>>n>>m)
    {
        if(exGcd(n,m,x,y)==1)//根据表达式他们返回的最大公约数必须为1
        {
            while(x<0)
            {
                //依然是找通解,但是这里明确规定x非负数,y随便!
                x+=m;
                y-=n;
            }
            cout<<x<<" "<<y<<endl;
        }
        else
        {
            cout<<"sorry"<<endl;
        }
    }
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场