POJ 2142 The Balance

#include <cstdio>

#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;

#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)

#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod %100000007

int a,b,d;

int exgcd(int a,int b,int &x,int &y)
{
if ( b == 0 )
{
x = 1;
y = 0;
return a;
}
int r = exgcd( b , a % b , x , y );
int t = x;
x = y;
y = t - a/b * y;
return r;
}

void slove(int a,int b,int d)
{
int x,y;
int gcd = exgcd( a , b , x , y );
x*=d/gcd;
y*=d/gcd;
int addx = b/gcd;
int addy = a/gcd;

int m1,m2;
int ansx,ansy;
m1 = m2 = inf;

x = ( x % addx + addx )% addx;
y = (d - a*x)/b;
ansx = x;
ansy = abs(y);
m1 = x + abs(y);
m2 = a*x + b*abs(y);

y = ( y % addy + addy )% addy;
x = (d - b*y)/a;

if ( abs(x) + abs(y) < m1 )
{
m1 = abs(x) + abs(y);
ansx = abs(x);
ansy = abs(y);
}
else if ( abs(x) + abs(y) == m1 && a*abs(x) + b*abs(y) < m2 )
{
ansx = abs(x);
ansy = abs(y);
}

printf("%d %d\n",ansx,ansy);
}

int main()
{
while( ~scanf("%d%d%d",&a,&b,&d) )
{
if ( a + b + d == 0 ) break;
slove(a,b,d);
}
return 0;
}