hdoj-【2669 Romantic】

最新推荐文章于 2016-11-27 04:40:15 发布

有梦就不怕痛

最新推荐文章于 2016-11-27 04:40:15 发布

阅读量414

点赞数

分类专栏：拓展欧几里得

本文链接：https://blog.csdn.net/Cai_Nia/article/details/52517574

版权

拓展欧几里得专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Romantic

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

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
   
   
   
   <span style="font-size:18px;">#include<cstdio>
#define LL __int64
void exgcd(LL a,LL b,LL &d,LL &x,LL &y)
{
	if(b==0)
	{
		y=0;
		d=a;
		x=1;
	}
	else
	{
		exgcd(b,a%b,d,y,x);
		y-=x*(a/b); 
	} 
} 
int main()
{
	LL a,b;
	while(scanf("%I64d%I64d",&a,&b)!=EOF)
	{
		LL x,y,d;
		exgcd(a,b,d,x,y);//d是a，b的最大公约的倍数 
		if(d!=1)
		{
			printf("sorry\n"); 
		} 
		else
		{
			x=x%b;
			LL ans=(x+b)%b;
			y=(1-ans*a)/b;
			printf("%I64d %I64d\n",ans,y);
		} 
	} 
}</span>