POJ 2142 The Balance（exgcd）

嗯...

题目链接：http://poj.org/problem?id=2142

AC代码：

 #include<cstdio>
 #include<iostream>

 using namespace std;

 inline int _abs(int x){
     if(x < ) return -x;
     return x;
 }

 inline void exgcd(int a, int b, int &g, int &x, int &y){
     if(!b) { g = a; x = ; y = ;}
     else { exgcd(b, a % b, g, y, x); y -= x * (a / b);}
 }

 inline void work(int a, int b, int c, int &g, int &x, int &y){
     exgcd(a, b, g, x, y);
     x *= c / g;
     int t = b / g;
     x = (x % t + t) % t;
     y = _abs((a * x - c) / b);
 }

 int main(){
     int a, b, c, x1, g, y1, x2, y2;
     while(~scanf("%d%d%d", &a, &b, &c)){
         if(!a && !b && !c) break;
         work(a, b, c, g, x1, y1);
         work(b, a, c, g, x2, y2);
         if(x1 + y1 < x2 + y2) printf("%d %d\n", x1, y1);
         else printf("%d %d\n", y2, x2);
     }
     return ;
 }

AC代码