The Balance (poj 2142)

原创 2018年04月15日 12:09:21
The Balance
Time Limit: 5000MS Memory Limit: 65536K
Total Submissions: 8014 Accepted: 3505

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

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>

using namespace std;

long long extgcd(long long a,long long b,long long& x,long long& y)
{
    long long d=a;
    if(b!=0){
        d=extgcd(b,a%b,y,x);
        y-=(a/b)*x;
    }
    else{
        x=1,y=0;
    }
    return d;
}

long long abc(long long a)
{
    if(a<0)
        return -a;
    else
        return a;
}

int main()
{
   long long a,b,d;
   while(cin>>a>>b>>d){
        if(a==0&&b==0&&d==0)
            break;
        long long x,y,x1,y1;
        long long g=extgcd(a,b,x,y);
        if(d%g!=0){
            cout<<"no solution"<<endl;
            continue;
        }
        else{
            x1=x*d/g;
            y1=y*d/g;
            a/=g,b/=g;
            long long x2=(x1%b+b)%b;//将x化为最小正整数。
            long long y2=y1-(x2-x1)*a/b;
            long long y3=(y1%a+a)%a;//将y化为最小正整数。
            long long x3=x1-(y3-y1)*b/a;
            long long minx=x3,miny=y3;
            //cout<<minx<<' '<<miny<<endl;
            if(abc(x2)+abc(y2)<abc(x3)+abc(y3)){
                minx=x2,miny=y2;
            }
            cout<<abc(minx)<<' '<<abc(miny)<<endl;
        }
   }
   return 0;
}

POJ 2142 The Balance 扩展欧几里得

题意:有两种类型的砝码,每种的砝码质量a和b给你,现在要求称出质量为d的物品,要求a的数量x和b的数量y最小,以及x+y的值最小。 思路:是扩展欧几里得的应用。设ax + by = 1,求出x和...
  • wmn_wmn
  • wmn_wmn
  • 2012-07-30 09:07:12
  • 2639

POJ2142 The Balance(扩展欧几里德)

The Balance Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 5016   Accepted: 2197...
  • u013021513
  • u013021513
  • 2015-07-28 10:10:44
  • 1504

POJ2142 The Balance(扩展欧几里得算法)

The Balance Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 6473   Accepted: 2849...
  • H_Fighter
  • H_Fighter
  • 2017-04-01 11:57:43
  • 281

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

The Balance Description Ms. Iyo Kiffa-Australis has a balance and only two kinds of weights to measu...
  • wust_xhj
  • wust_xhj
  • 2015-07-17 13:47:50
  • 1146

POJ2142_The Balance_扩展欧几里得

The Balance Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 6456   Accepted: 2840...
  • yuege38
  • yuege38
  • 2017-03-23 00:03:55
  • 358

POJ 2142 && HDU 1356 The Balance(一元线性同余方程)

Description 给出两种质量的砝码,和一件物品,问要多少砝码能称出物品,砝码的个数满足两种砝码的数量和尽量小,如果还有多解满足两种砝码的总质量最少 Input 多组用例,每组用例包括三个...
  • V5ZSQ
  • V5ZSQ
  • 2015-09-03 08:54:18
  • 677

POJ 2142-The Balance(扩展欧几里德)

题目地址:POJ 2142 题意:有两种类型的砝码质量分别为a和b,要求称出质量为d的物品,要求a的数量x和b的数量y的和x+y最小,若有多个x+y的值,取ax+by最小的。 思路:我们应该求ax...
  • u013486414
  • u013486414
  • 2015-08-25 20:25:42
  • 701

poj 2142

http://hi.baidu.com/5l2_/blog/item/a0381951b5738a1e367abef0.html 这个文章写的很好。。。我只是照办人家的。。。。TT 自己想不到的。。。...
  • water_glass
  • water_glass
  • 2011-09-04 18:23:37
  • 668

poj 2142 The Balance

本题是求ax + by = c 的一组解,要求|x| + |y| 尽可能小,若存在相等,则使a * |x| + b * |y| 尽可能小;如果x b0, |x|  + |y| = |x0 + (b/...
  • Hearthougan
  • Hearthougan
  • 2014-01-05 18:07:21
  • 495

POJ 2142 The Balance(扩展欧几里德)

The Balance Description Ms. Iyo Kiffa-Australis has a balance and only two kinds of weight...
  • qq_26658823
  • qq_26658823
  • 2016-08-19 23:35:53
  • 247
收藏助手
不良信息举报
您举报文章:The Balance (poj 2142)
举报原因:
原因补充:

(最多只允许输入30个字)