Romantic(扩展欧几里得算法)

转载 2015年07月08日 13:17:53

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;
        }
    }
}


欧几里得算法与其扩展 Romantic

欧几里得算法长用于求最小公倍数和最大公因子gcd gcd(a,b)=gcd(b,a%b). int gcd(int a,int b) { return b==0?a:gcd(b,a%b); }...

[数论]HDU 2669 Romantic 扩展欧几里得算法

传送门:Romantic Romantic Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (J...

HDU 2669 Romantic 扩展欧几里得模板题@

Romantic Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total S...

hdoj2669Romantic【扩展欧几里得】

Romantic Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total S...

hdoj 2669 Romantic 【扩展欧几里得 求解最小非负解】

Romantic Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total S...

hdu 2669 Romantic(线性同余,扩展欧几里得)

Romantic Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total...
  • acm_cxq
  • acm_cxq
  • 2016年06月15日 20:06
  • 276

【HDU】2669 - Romantic(扩展欧几里得)

点击打开题目 Romantic Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/...
  • wyg1997
  • wyg1997
  • 2016年08月01日 17:30
  • 134

HDU 2669 Romantic 扩展欧几里得

点击打开链接 Romantic Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Jav...

HDU 2669 Romantic(扩展欧几里得)

这题无限T.TT.

hdu 2669 Romantic (扩展欧几里得)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2669 题意:求线性方程a*x + b*y = c的一组整数解,其中c=1,并要求x非负。 解题方案:扩...
  • mr_zj_
  • mr_zj_
  • 2017年03月31日 15:48
  • 101
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Romantic(扩展欧几里得算法)
举报原因:
原因补充:

(最多只允许输入30个字)