HDU 2669 Romantic

最新推荐文章于 2024-09-25 22:03:46 发布

原创最新推荐文章于 2024-09-25 22:03:46 发布 · 551 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#扩展欧几里德算法

HDU 同时被 2 个专栏收录

38 篇文章

订阅专栏

扩展欧几里德算法

8 篇文章

订阅专栏

本文介绍了一道关于扩展欧几里德算法的题目，要求对于给定的两个正整数a和b，找到非负整数X和任意整数Y，使得X*a + Y*b = 1。如果不存在这样的X和Y，则输出特定提示。

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

Sample Output

  
   2 -3
sorry
7 -3

Author

yifenfei

Source

HDU女生专场公开赛——谁说女子不如男

Recommend

lcy | We have carefully selected several similar problems for you: 2668 2674 2671 2670 2672

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

扩展欧几里德算法模板题~

还是特殊情况~

千年难遇的一次A~

#include<cstdio>

int extended_euclid(int a,int b,int &x,int &y)
{
	if(b==0)  //即gcd(a,b)=a 
	{
		x=1;y=0;
		return a;
	}
	int n=extended_euclid(b,a%b,x,y);  //最大公约数相等  
	int k=x;
	x=y;
	y=k-static_cast<int> (a/b)*y;
	return n;
}

int main() //ax+by=c 
{
	int t,a,b,x,y;
	while(scanf("%d%d",&a,&b)==2)
	{
		int n=extended_euclid(a,b,x,y);
		if(n!=1)
		{
			printf("sorry\n");continue; //c不是最大公约数时无解  
	    }
		while(x<0)
		{
			x+=b;y-=a;
		}
		printf("%d %d\n",x,y);
	}
	return 0;
}