exgcd通解

最新推荐文章于 2024-06-02 15:41:05 发布

木落淮南，雨晴雲夢

最新推荐文章于 2024-06-02 15:41:05 发布

阅读量346

点赞数 1

分类专栏：洛谷

原文链接：https://blog.csdn.net/lcl1234567890lcl/article/details/117535740

版权

洛谷专栏收录该内容

29 篇文章 1 订阅

订阅专栏

CF7C Line

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
#define int long long
//#define double long double
#define re int
#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
#define P pair < int , int >
#define mk make_pair
using namespace std;
const int mod=998244353;
const int M=1e8+5;
const int N=5e5+5;//?????????? 4e8
int a,b,c;
int exgcd(int a,int b,int &x,int &y)
{
	if(!b){x=1,y=0;return a;}
	int d=exgcd(b,a%b,x,y);
	int z=x;x=y;y=z-y*(a/b);
	return d;
}
void solve()
{
	cin>>a>>b>>c;
	c=-c;//
	int x,y;
	int d=exgcd(a,b,x,y);
	if(c%d!=0)  puts("-1");
	else  cout<<c/d*x<<" "<<c/d*y<<endl;//c=0的情况
}
signed main()
{
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
//    	printf("Case #%d: ",index);
        solve();
//        puts("");
    }
    return 0;
}
/*







*/