[POJ 2142]The Balance(扩展欧几里得)

最新推荐文章于 2020-08-20 08:22:25 发布

qpswwww

最新推荐文章于 2020-08-20 08:22:25 发布

阅读量602

点赞数

分类专栏： ACM-ICPC

本文链接：https://blog.csdn.net/qpswwww/article/details/39582459

版权

ACM-ICPC 专栏收录该内容

55 篇文章 0 订阅

订阅专栏

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

The Balance

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 4326		Accepted: 1891

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

Source

Japan 2004

/*
    题目大意：求ax+by=n的x和y的最小正整数解
    转化为求a(x/n)+b(y/n)=1的解
*/
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>

using namespace std;

int gcd(int a,int b)
{
    if(b==0) return a;
    return gcd(b,a%b);
}

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

int main()
{
    int a,b,n;
    while(scanf("%d%d%d",&a,&b,&n)&&(a!=0||b!=0||n!=0))
    {
        int x,y;
        int gcdab=gcd(a,b); //先让a和b互质
        a/=gcdab;
        b/=gcdab;
        n/=gcdab;
        gcdab=extendGCD(a,b,x,y); //现在的x还是x/n，y还是y/n
        //方案1：以x为主，将x转化为最小正数，y跟着变
        int newx=((x*n)%b+b)%b; //x化为最小正数
        int newy=(n-a*newx)/b;
        if(newy<0) newy=-newy;
        //方案2：以y为主：将y转化为最小正数，x跟着变
        y=((y*n)%a+a)%a; //y化为最小正数
        x=(n-b*y)/a;
        if(x<0) x=-x;
        //现在从方案1、2中选一个x+y最小的方案
        if(x+y>newx+newy)
            x=newx,y=newy;
        printf("%d %d\n",x,y);
    }
    return 0;
}