POJ 2142The Balance
来源:互联网 发布:苹果数据缓存 编辑:程序博客网 时间:2024/06/06 12:53
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.
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
扩展gcd的简单应用,枚举一下x,把最小的记下了就好了。
其实这个数据范围感觉暴力就好了,哈哈。
#include<set>#include<map>#include<ctime>#include<cmath>#include<stack>#include<queue>#include<bitset>#include<cstdio>#include<string>#include<cstring>#include<iostream>#include<algorithm>#include<functional>#define rep(i,j,k) for (int i = j; i <= k; i++)#define per(i,j,k) for (int i = j; i >= k; i--)#define loop(i,j,k) for (int i = j;i != -1; i = k[i])#define lson x << 1, l, mid#define rson x << 1 | 1, mid + 1, r#define fi first#define se second#define mp(i,j) make_pair(i,j)#define pii pair<int,int>using namespace std;typedef long long LL;const int low(int x) { return x&-x; }const double eps = 1e-4;const int INF = 0x7FFFFFFF;const int mod = 9973;const int N = 3e5 + 10;int a, b, c;int l, r;int exgcd(int a, int b, int &x, int &y){if (!b) { x = 1; y = 0; return a; }int g = exgcd(b, a%b, x, y);int z = x - a / b * y;x = y;y = z; return g;}int main(){while (scanf("%d%d%d", &a, &b, &c), a + b + c){int x, y, g = exgcd(a, b, x, y);x = c / g * x; y = c / g * y;int ans = (l = abs(x)) + (r = abs(y));for (int i = x; i <= ans; i += b / g){if (ans > abs(i) + abs((c - a * i) / b)){l = abs(i);r = abs((c - a * i) / b);ans = l + r;}else if (ans == abs(i) + abs((c - a * i) / b)){if (l*a + r*b > abs(i)*a + abs((c - a * i) / b)*b){l = abs(i);r = abs((c - a * i) / b);}}}for (int i = x; i >= -ans; i -= b / g){if (ans > abs(i) + abs((c - a * i) / b)){l = abs(i);r = abs((c - a * i) / b);ans = l + r;}else if (ans == abs(i) + abs((c - a * i) / b)){if (l*a + r*b > abs(i)*a + abs((c - a * i) / b)*b){l = abs(i);r = abs((c - a * i) / b);}}}printf("%d %d\n", l, r);}return 0;}
0 0
- poj - 2142 - The Balance
- POJ 2142 The Balance
- POJ 2142 The Balance
- POJ 2142 The Balance
- poj 2142 The Balance
- The Balance POJ 2142
- POJ 2142 The Balance
- poj 2142 The Balance
- POJ 2142:The Balance
- poj 2142 The Balance
- POJ 2142 The Balance
- poj 2142 The Balance
- POJ 2142 The Balance
- POJ 2142 The Balance
- POJ 2142 The Balance .
- POJ 2142The Balance
- POJ 2142 The Balance
- POJ 2142 The Balance 拓欧
- 网速和网络延迟的区别
- 【机房收费系统】菜单、MDI窗体等问题
- Ubuntu 16.04 安装 Apache, MySQL, PHP7
- MySQL---约束
- 洛谷 P1462 通往奥格瑞玛的道路
- POJ 2142The Balance
- openstack nova schduler服务分析 liberty版本
- 1QQ可以登陆,却不能访问网页 2www.baidu.com打不开,其他网页可以打开
- NYOJ 24
- 源码编译安装LAMP
- redis链表操作
- iOS开发——深拷贝与浅拷贝详解
- NYOJ 1030 Yougth's Game[Ⅲ](博弈加DP)
- TQ210——常见问题