POJ 2142 The Balance 扩展欧几里得

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <cstdio>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
const int N=1e3+20;
const int inf=2e8;
int a,b,d;
int x,y;
int gcd(int a,int b)
{
	if(b==0)
	{
		x=1,y=0;
		return a;
	}
	ll D=gcd(b,a%b);	
	ll t=y;
	y=x-a/b*y;
	x=t;
	return D;
}
 
int main()
{
	while(cin>>a>>b>>d&&(a+b+d))
	{
		int x1,y1;
		int D=gcd(a,b);
		x=x*d/D;
		int t=b/D;
		//通解 x=x0+t1*i, x带回ax+by=c 求出y 
		x=(x%t+t)%t;//ax+by=c x在左边 
		y=abs((d-a*x)/b);

		x1=x,y1=y;
		D=gcd(b,a);
		x=x*d/D;
		t=a/D;
		x=(x%t+t)%t;
		y=abs((d-b*x)/a);
		
		if(x1+y1<x+y)
			cout<<x1<<‘ ‘<<y1<<endl;
		else
			cout<<y<<‘ ‘<<x<<endl;
	}	
	return 0;
}