HDU 5610 Baby Ming and Weight lifting(枚举)
来源:互联网 发布:朱高炽 知乎 编辑:程序博客网 时间:2024/06/05 08:25
Baby Ming and Weight lifting
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1439 Accepted Submission(s): 525
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 respectivelya 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 weightedC (the barbell must be balanced), he want to know how to do it.
Baby Ming prepare to use this two kinds of barbell disks to make up a new one weighted
Input
In the first line contains a single positive integer T , indicating number of test case.
For each test case:
There are three positive integera,b , and C .
1≤T≤1000,0<a,b,C≤1000,a≠b
For each test case:
There are three positive integer
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 ofa and b barbell disks are needed. (If there are more than one answer, print the answer with minimuma+b )
Otherwise, print two numbers to indicating the numbers of
Sample Input
21 2 61 4 5
Sample Output
2 2Impossible
Source
BestCoder Round #69 (div.2)
Recommend
hujie | We have carefully selected several similar problems for you: 5674 5673 5672 5671 5669
把每种情况都枚举一遍。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){int t,m,n,i,j,k,l,sum,minn,maxx,num,flag,a,ans1,ans2;scanf("%d",&t);while(t--){scanf("%d%d%d",&m,&n,&sum);if(sum%2){printf("Impossible\n");continue;}else{minn=min(n,m); maxx=max(n,m);}if(maxx*2>sum)//不能用大的 {if(sum%minn)printf("Impossible\n");else{if(sum/minn%2)printf("Impossible\n");else{num=sum/minn; if(minn==m) printf("%d 0\n",num); else printf("0 %d\n",num);}} } else { flag=0; l=sum/maxx; for(i=l;i>=0;i--) { if(flag) break; if((sum-i*maxx)%minn==0) { if(flag) break; a=(sum-i*maxx)/minn; for(j=i;j>=0;j--) { if(flag) break; for(k=0;k<=a;k++) { if(k*minn+j*maxx==sum/2)//如果能构成一半就可以,比较机智的一个地方 { ans1=i; ans2=a; flag=1; } } } } } if(flag==0) printf("Impossible\n"); if(flag==1) { if(minn==m) printf("%d %d\n",ans2,ans1); else printf("%d %d\n",ans1,ans2); } }}return 0;}
0 0
- HDU 5610 Baby Ming and Weight lifting(枚举)
- HDU 5610: Baby Ming and Weight lifting
- hdu 5610 Baby Ming and Weight lifting
- HDU 5610 Baby Ming and Weight lifting
- hdu 5610 Baby Ming and Weight lifting(思维,逻辑)
- HDU 5610 Baby Ming and Weight lifting(模拟)
- HDU 5610 Baby Ming and Weight lifting(水~)
- BestCoder Baby Ming and Weight lifting 枚举
- HDOJ 5610 Baby Ming and Weight lifting(枚举)
- HDU 5610 Baby Ming and Weight lifting(贪心)
- hdu 5610 /BC 69A Baby Ming and Weight lifting
- HDOJ 5610 Baby Ming and Weight lifting
- HDOJ 5610-Baby Ming and Weight lifting
- HDOJ 5610 Baby Ming and Weight lifting
- hdoj-5610-Baby Ming and Weight lifting
- Baby Ming and Weight lifting
- hdoj Baby Ming and Weight lifting 5610 (暴力&转换)
- hdoj 5610 Baby Ming and Weight lifting 【暴力】【水题】
- 从零开始学习ExtJs6系列教程三【登录Demo:Login】
- cacti安装记录 第四阶段cacti的基本使用(3)setting and thresholds (邮件和阀值报警)
- Cannot change network to bridged: There are no un-bridged host network adapters解决方法
- python numpy包的数组与矩阵一些差异
- .NSKernAttribute
- HDU 5610 Baby Ming and Weight lifting(枚举)
- 将数据库中一张表中数据复制到另一张表
- 初学java集合-map—API
- SQL UPDATE 语句
- 从此这里就是我的技术博客
- iOS之性能优化
- 常见的iOS对动画的操作
- 快速认识和使用浏览器跟踪Http服务及Http服务调试工具
- Swift-简单值