HDOJ 5610 Baby Ming and Weight lifting

最新推荐文章于 2016-07-18 17:54:26 发布

非常可乐（이녕）

最新推荐文章于 2016-07-18 17:54:26 发布

阅读量431

点赞数

分类专栏：题思维文章标签： HDOJ

本文链接：https://blog.csdn.net/wyjwyl/article/details/50576721

版权

题同时被 2 个专栏收录

47 篇文章 0 订阅

订阅专栏

思维

16 篇文章 0 订阅

订阅专栏

Baby Ming and Weight lifting

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 446 Accepted Submission(s): 174

Problem Description

Baby Ming is fond of weight lifting. He has a barbell pole(the weight of which can be ignored) and two different kinds of barbell disks(the weight of which are respectively

a and

b ), the amount of each one being infinite.

Baby Ming prepare to use this two kinds of barbell disks to make up a new one weighted

C (the barbell must be balanced), he want to know how to do it.

Input

In the first line contains a single positive integer

T , indicating number of test case.

For each test case:

There are three positive integer

a,b , and

C .

1≤T≤1000,0<a,b,C≤1000,a≠b

Output

For each test case, if the barbell weighted

C can’t be made up, print Impossible.

Otherwise, print two numbers to indicating the numbers of

a and

b barbell disks are needed. (If there are more than one answer, print the answer with minimum

a+b )

Sample Input

Sample Output

  
  
   
   2 2
Impossible

有一句话，叫自作自受

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int main()
{
    int t,a,b,c,aa,bb;
    scanf("%d",&t);
    while(t--)
    {
        aa=bb=0;
        scanf("%d%d%d",&a,&b,&c);
        if(c&1)
        {
            printf("Impossible\n");
            continue;
        }
        if(c==0)
        {
            printf("0 0\n");
            continue;
        }
        int n=c/2;
        int flag=0;
        if(a>b)
        {
            flag=1;
            int tem=a;
            a=b;
            b=tem;
        }
        if(a>n)
            printf("Impossible\n");
        else
        {
            if(b>n)
            {
                if(n%a==0)
                {
                    if(!flag)
                        printf("%d 0\n",(n/a)*2);
                    else
                        printf("0 %d\n",(n/a)*2);
                }
                else
                    printf("Impossible\n");
            }
            else
            {
                if(n%b==0)
                {
                    if(!flag)
                        printf("0 %d\n",(n/b)*2);
                    else
                        printf("%d 0\n",(n/b)*2);
                }
                else
                {
                    int i=n/b;
                    int rec=0;
                    for(;i>=0;--i)
                    {
                        int tem=n-i*b;
                        if(tem>0&&tem%a==0)
                        {
                            rec=1;
                            if(!flag)
                                printf("%d %d\n",(tem/a)*2,i*2);
                            else
                                printf("%d %d\n",i*2,(tem/a)*2);
                            break;
                        }
                    }
                    if(!rec)
                        printf("Impossible\n");
                }
            }
        }
    }
    return 0;
}