HDU 2669 Romantic(扩展欧几里得)

最新推荐文章于 2019-07-20 00:43:48 发布

置顶 sky_miange

最新推荐文章于 2019-07-20 00:43:48 发布

阅读量747

点赞数

CC 4.0 BY-SA版权

分类专栏：扩展欧几里得文章标签： ACM算法 algorithm 扩展 namespace typedef

本文链接：https://blog.csdn.net/sky_miange/article/details/44786925

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

0 篇文章

订阅专栏

本文介绍了一道关于扩展欧几里得算法的题目，详细解析了如何通过该算法解决特定类型的数学问题，即寻找两个非负整数使得它们的线性组合等于1。文章提供了完整的代码实现，并解释了算法背后的数学原理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Romantic

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

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女生专场公开赛——谁说女子不如男

这题有毒，，定义要__int64 输出输入要cout,cin。。

扩展欧几里得的裸题。

扩展欧几里德: 给一个线性方程X*a+Y*b=m，给出a,b,m让求解X和Y。

首先，只有m%gcd(a,b)==0 时该线性方程才有解。

假使a=k1 *gcd(a,b),b=k2 * gcd(a,b);

那么方程左边就等于(X*k1+Y*k2)*gcd(a,b),所以仅当m能被gcd(a,b)整除时方程才有解。

为了求上述方程的解，我们不妨先来求方程a*X+b*Y=gcd(a,b)的解,设d=m/gcd(a,b);

所以a*(d*X)+b*(d*y)=d*gcd(a,b)=m,求出这个方程的解原方程的解也就求出了。

根据欧几里德有gcd(a,b)=gcd(b,a%b)

所以a*X+b*Y=gcd(a,b)=gcd(b,a%b)=b*X1+(a%b)*Y1;

令k=a/b , r=a%b

a=b*k+r;

得出X=Y1 , Y=X1-Y1*(a/b);

#include "string"
#include "iostream"
#include "cstdio"
#include "cmath"
#include "set"
#include "queue"
#include "vector"
#include "cctype"
#include "sstream"
#include "cstdlib"
#include "cstring"
#include "stack"
#include "ctime"
#include "algorithm"
#define pa pair<int,int>
#define Pi M_PI
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef long long ll;
__int64 EXgcd(__int64 a,__int64 b,__int64& x,__int64& y)
{
    if(b==0)
    {
        x=1;
        y=0;
        return a;
    }
    __int64 r=EXgcd(b,a%b,x,y);
    __int64 t=x;
    x=y;
    y=t-a/b*y;
    return r;
}
int main()
{
    __int64 a,b,x,y,Gcd;
    while(cin>>a>>b)
    {
        Gcd=EXgcd(a,b,x,y);
        if(Gcd==1)//为一才有解
        {
            while(x<0)
            {
                x+=b;
                y-=a;
            }
            cout<<x<<" "<<y;
        }
        else
            cout<<"sorry";
        cout<<endl;
    }
    return 0;
}