HDU-5610 Array（枚举）

最新推荐文章于 2021-06-08 19:13:52 发布

满赋诸机

最新推荐文章于 2021-06-08 19:13:52 发布

阅读量582

点赞数

分类专栏： HDU 其他文章标签： hdu 枚举

本文链接：https://blog.csdn.net/idealism_xxm/article/details/50616188

版权

HDU 同时被 2 个专栏收录

115 篇文章 1 订阅

订阅专栏

其他

65 篇文章 0 订阅

订阅专栏

Baby Ming and Weight lifting

http://acm.hdu.edu.cn/showproblem.php?pid=5610

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

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 <cstdio>

int T,a,b,c,na,nb,mxn,i;
int main() {
    scanf("%d",&T);
    while(T--) {
        scanf("%d%d%d",&a,&b,&c);
        if(c&1) {
            printf("Impossible\n");
            continue;
        }
        na=nb=0x3f3f3f3f;
        c>>=1;
        mxn=c/a;
        for(i=0;i<=mxn;++i)
            if((c-a*i)%b==0&&i+(c-a*i)/b<na+nb) {//如果能凑成c，且总数小于目前总数，则更新答案
                na=i;
                nb=(c-a*i)/b;
            }
        if(na==0x3f3f3f3f)
            printf("Impossible\n");
        else
            printf("%d %d\n",na<<1,nb<<1);
    }
    return 0;
}