poj_2142--扩展欧几里德算法
来源:互联网 发布:微信群发软件 编辑:程序博客网 时间:2024/06/17 16:51
The Balance
Time Limit:5000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uMs. 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.
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.
No extra characters (e.g. extra spaces) should appear in the output.
- 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 200500 200 300500 200 500275 110 330275 110 385648 375 40023 1 100000 0 0
Sample Output
1 31 11 00 31 149 743333 1
Source
Japan 2004
#include <iostream>#include <math.h>using namespace std;void ex(long long a,long long b,long long &x,long long &y){ if(b==0) { x=1; y=0; return; } ex(b,a%b,x,y); long long tmp=x; x=y; y=tmp-(a/b)*y;}long long gcd(long long a,long long b){ if(b==0) return a; return gcd(b,a%b);}int main(){ long long a,b,c,x,y,d; while(cin>>a>>b>>c) { if(a==0&&b==0&&c==0) break; d=gcd(a,b); a=a/d; b/=d; c/=d; ex(a,b,x,y); x=x*c; y=y*c; long long tx,ty; tx=(x%b+b)%b; ty=(c-tx*a)/b; y=(y%a+a)%a; x=(c-y*b)/a; if(fabs(tx)+fabs(ty)<fabs(x)+fabs(y)) { x=fabs(tx); y=fabs(ty); } cout<<fabs(x)<<" "<<fabs(y)<<endl; } //cout << "Hello world!" << endl; return 0;}
0 0
- poj_2142--扩展欧几里德算法
- 欧几里德算法 & 扩展欧几里德算法
- 欧几里德和扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德与扩展欧几里德算法
- 欧几里德算法及扩展欧几里德
- 欧几里德与扩展欧几里德算法
- 数值优化(Numerical Optimization)学习系列-概述
- Linux软件包安装4——源码包安装以及脚本安装包Webmin实现web管理
- HDU 2019 数列有序!
- 数据库回顾(二)—存储过程
- Android 坐标与宽高研究getLeft() getTop() getRight()和getBottom()
- poj_2142--扩展欧几里德算法
- c(API) 对文件内容的增删查改
- Android Studio如何更改JDK和SDK的路径?
- ERP实施项目的周期
- linux编程学习3-ISO C标准定义的头文件
- 第12周项目1- 教师兼干部类
- Internal Sorting: Distribution counting: Sorting by counting
- 判断整数序列是不是二元查找树的后序遍历结果
- java中重写、重载、多态几个概念区别分析