POJ 2142: 扩展欧几里得算法

——扩展欧几里得算法
原题传送门

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.

Data

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, b, and d. 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	

a <= 10000 b <= 10000 d <= 50000

思路

这是一道扩展欧几里得(exgcd)的题目.
先讲一下扩展欧几里得算法:

扩展欧几里得算法

又称ECGCD，是当今最伟大鬼畜的求GCD(最大公约数)的算法之一.
所谓一般的GCD,就是这么写的

int gcd(int a,int b)
{
   
	//具体情况具体实现
	return (b==