The Balance POJ 2142

来源：互联网发布：mac book air能做什么编辑：程序博客网时间：2024/05/18 11:27
#include <iostream>#include <cmath>#include <cstring>#include <cstdio>using namespace std;typedef long long LL;const int INF = 100000000;LL fabs(LL a){    if( a < 0 )        return (-a);    else        return a;}void Ex_Gcd(LL a, LL b, LL &d, LL &x, LL &y){    if(b == 0)    {        x = 1;        y = 0;        d = a;        return ;//递归一定要有出口！    }    Ex_Gcd(b, a%b, d, x, y);    LL temp = x;    x = y;    y = temp - (a/b)*y;}int main(){    LL a, b, c;    while(scanf("%I64d %I64d %I64d", &a, &b, &c) != EOF)    {        if(a + b + c == 0)            break;        bool flag = false;        if(a < b)        {            LL temp = a;            a = b;            b = temp;            flag = true;        }        LL d, x0, y0;        Ex_Gcd(a, b, d, x0, y0);        x0 = x0 * (c/d);        y0 = y0 * (c/d);        LL t = y0 * d / a;        LL MinSum1 = INF, MinSum2, t0;        for(LL i = t-10; i <= t+10; ++i)        {            if(fabs(x0 + (b / d) * i) + fabs(y0 - (a / d) * i) < MinSum1)            {                t0 = i;                MinSum2 = a * fabs(x0 + (b / d) * i) + b * fabs(y0 - (a / d) * i);                MinSum1 = fabs(x0 + (b/d) * i) + fabs(y0 - (a/d) * i);            }            else if(fabs(x0 + (b / d) * i) + fabs(y0 - (a / d) * i) == MinSum1)            {                if(a * fabs(x0 + (b / d) * i) + b * fabs(y0 - (a / d) * i) < MinSum2)                {                    t0 = i;                    MinSum2 = a * fabs(x0 + b/d * i) + b * fabs(y0 - (a/d) * i);                }            }        }        if( !flag )            printf("%I64d %I64d\n", fabs(x0 + (b/d) * t0), fabs(y0 - (a/d) * t0));        else            printf("%I64d %I64d\n", fabs(y0 - (a/d) * t0), fabs(x0 + (b/d) * t0));    }    return 0;}/**输入样例：700 300 200500 200 300500 200 500275 110 330275 110 385648 375 40023 1 100000 0 0输出样例：1 31 11 00 31 149 743333 1*/
0 0