【HDOJ】1356 The Balance

扩展欧几里得的应用。

 /* 1356 */
 #include <iostream>
 #include <sstream>
 #include <string>
 #include <map>
 #include <queue>
 #include <set>
 #include <stack>
 #include <vector>
 #include <deque>
 #include <bitset>
 #include <algorithm>
 #include <cstdio>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <climits>
 #include <cctype>
 #include <cassert>
 #include <functional>
 #include <iterator>
 #include <iomanip>
 using namespace std;
 //#pragma comment(linker,"/STACK:102400000,1024000")

 #define sti                set<int>
 #define stpii            set<pair<int, int> >
 #define mpii            map<int,int>
 #define vi                vector<int>
 #define pii                pair<int,int>
 #define vpii            vector<pair<int,int> >
 #define rep(i, a, n)     for (int i=a;i<n;++i)
 #define per(i, a, n)     for (int i=n-1;i>=a;--i)
 #define clr                clear
 #define pb                 push_back
 #define mp                 make_pair
 #define fir                first
 #define sec                second
 #define all(x)             (x).begin(),(x).end()
 #define SZ(x)             ((int)(x).size())
 #define lson            l, mid, rt<<1
 #define rson            mid+1, r, rt<<1|1

 int a, b, d;

 int e_gcd(int n, int m, int& x, int& y) {
     if (m == ) {
         x = ;
         y = ;
         return n;
     }

     int ret = e_gcd(m, n%m, y, x);
     y -= n/m*x;

     return ret;
 }

 void solve() {
     int x, y;
     bool flag = false;

     if (a < b) {
         swap(a, b);
         flag = true;
     }

     int g = e_gcd(a, b, x, y);
     int mn = 1e9;
     int mn_ = 1e9;
     a /= g;
     b /= g;
     x = d/g*x;
     y = d/g*y;
     int Beg = -x/b-;
     int End = y/a+;
     int xx, yy;
     int tmp, tmp_;
     int ansx = , ansy = ;

     rep(i, Beg, End+) {
         xx = abs(x+b*i);
         yy = abs(y-a*i);
         tmp = xx + yy;
         tmp_ = a*xx + b*yy;
         if (tmp < mn) {
             mn = tmp;
             mn_ = tmp_;
             ansx = xx;
             ansy = yy;
         } else if (tmp==mn && tmp_<mn_) {
             mn_ = tmp_;
             ansx = xx;
             ansy = yy;
         }
     }

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

 int main() {
     ios::sync_with_stdio(false);
     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif

     while (scanf("%d %d %d",&a,&b,&d)!=EOF) {
         if(a== && b== && d==)
             break;
         solve();
     }

     #ifndef ONLINE_JUDGE
         printf("time = %d.\n", (int)clock());
     #endif

     return ;
 }