拓展欧几里得算法模板

#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#define inf 0x3f3f3f3f
#define mem(a,x) memset(a,x,sizeof(a))

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

inline ll in()
{
ll res=0;char c;
while((c=getchar())<'0' || c>'9');
while(c>='0' && c<='9')res=res*10+c-'0',c=getchar();
return res;
}

ll e_gcd(ll a,ll b,ll &x,ll &y)
{
if(b==0)
{
x=1;
y=0;
return a;
}
ll ans=e_gcd(b,a%b,x,y);
ll tmp=x;
x=y;
y=tmp-a/b*y;
return ans;
}
ll cal(ll a,ll b,ll c)
{
ll x,y;
ll gcd=e_gcd(a,b,x,y);
if(c%gcd!=0)return -1;
x*=c/gcd;
b/=gcd;
if(b<0)b=-b;
ll ans=x%b;
if(ans<=0)ans+=b;
return ans;
}

int main()
{
ll a,b;
while(~scanf("%I64d%I64d",&a,&b))
{

ll ans=cal(a,b,1);
if(ans==-1)puts("sorry");
else printf("%I64d %I64d\n",ans,(1-ans*a)/b);
}
return 0;
}