POJ 2142 The Balance （拓展欧几里得）

Description

Ms. Iyo Kiffa-Australis has a balance and only two kinds of weights to measure a dose of medicine. For example, to measure 200mg of aspirin using 300mg weights and 700mg weights, she can put one 700mg weight on the side of the medicine and three 300mg weights on the opposite side (Figure 1). Although she could put four 300mg weights on the medicine side and two 700mg weights on the other (Figure 2), she would not choose this solution because it is less convenient to use more weights.
You are asked to help her by calculating how many weights are required.

Input

The input is a sequence of datasets. A dataset is a line containing three positive integers a, b, and d separated by a space. The following relations hold: a != b, a <= 10000, b <= 10000, and d <= 50000. You may assume that it is possible to measure d mg using a combination of a mg and b mg weights. In other words, you need not consider “no solution” cases.
The end of the input is indicated by a line containing three zeros separated by a space. It is not a dataset.
Output

The output should be composed of lines, each corresponding to an input dataset (a, b, d). An output line should contain two nonnegative integers x and y separated by a space. They should satisfy the following three conditions.
You can measure dmg using x many amg weights and y many bmg weights.
The total number of weights (x + y) is the smallest among those pairs of nonnegative integers satisfying the previous condition.
The total mass of weights (ax + by) is the smallest among those pairs of nonnegative integers satisfying the previous two conditions.

No extra characters (e.g. extra spaces) should appear in the output.
Sample Input

700 300 200
500 200 300
500 200 500
275 110 330
275 110 385
648 375 4002
3 1 10000
0 0 0
Sample Output

1 3
1 1
1 0
0 3
1 1
49 74
3333 1

题意

左右两个托盘，用x个a，和y个b，把d表示出来，输出x，y
也就是
左盘里放a，右盘里放b，d
  ax – by = d
左盘里放a，b，右盘里放d
  ax + by = d
左盘里放b，右盘里放a，d
  bx – ay = d
左盘里放a，b，右盘里放d
  bx + ay = d
后面两种，x其实就是问题要求的y，y就是问题要求的x。
因为求解的是满足x+y值最小，x * a + y * b的x，y。
所以第四种情况不能省略，

#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<ctime>
#define ll long long
#define ld long double
#define ull unsigned long long
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 100100;
int exgcd(int a,int b,int &x,int &y){
    if(b==0){
        x = 1;
        y = 0;
        return a;
    }
    int g = exgcd(b,a%b,y,x);
    y -= a/b * x;
    return g;
}
int main(void)
{
    int a,b,c;
    int minx,miny,minn;
    while(1){
        minx = miny = minn = inf;
        scanf("%d%d%d",&a,&b,&c);
        if(a==0&&b==0&&c==0)  break;
        int x,y;
        int g = exgcd(a,b,x,y);
        x = c*x/g;
        if(x>=0)    x = x%(b/g);
        else    x = x%(b/g)+(b/g);
        y = (a*x-c)/b;
        if(x>=0&&y>=0){
            minx = x;
            miny = y;
            minn = a*x+b*y;
        }
        y = (c-a*x)/b;
        if(x>=0&&y>=0){
            if(a*x+b*y<minn&&x+y<minx+miny){
                minx = x;
                miny = y;
            }
        }
        
        g = exgcd(b,a,x,y);
        x = c*x/g;
        if(x>=0)    x = x%(a/g);
        else    x = x%(a/g)+(a/g);
        y = (b*x-c)/a;
        if(x>=0&&y>=0){
            if(b*x+a*y<minn&&x+y<minx+miny){
                minx = y;
                miny = x;
                minn = b*x+a*y;
            }

        }
        y = (c-b*x)/a;
        if(x>=0&&y>=0){
            if(b*x+a*y<minn&&x+y<minx+miny){
                minx = y;
                miny = x;
            }
        }
        printf("%d %d\n",minx,miny);
    }
    return 0;
}