HDOJ 5551 Huatuo's Medicine (水)
来源:互联网 发布:python eval() 编辑:程序博客网 时间:2024/05/17 22:54
Huatuo's Medicine
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 28 Accepted Submission(s): 20
Problem Description
Huatuo was a famous doctor. He use identical bottles to carry the medicine. There are different types of medicine. Huatuo put medicines into the bottles and chain these bottles together.
However, there was a critical problem. When Huatuo arrived the patient's home, he took the chain out of his bag, and he could not recognize which bottle contains which type of medicine, but he remembers the order of the bottles on the chain.
Huatuo has his own solution to resolve this problem. When he need to bring 2 types of medicines, E.g.A and B , he will put A into one bottle and put B into two bottles. Then he will chain the bottles in the order of ′−B−A−B−′ . In this way, when he arrived the patient's home, he knew that the bottle in the middle is medicineA and the bottle on two sides are medicine B .
Now you need to help Huatuo to work out what's the minimal number of bottles needed if he want to bringN types of medicine.
However, there was a critical problem. When Huatuo arrived the patient's home, he took the chain out of his bag, and he could not recognize which bottle contains which type of medicine, but he remembers the order of the bottles on the chain.
Huatuo has his own solution to resolve this problem. When he need to bring 2 types of medicines, E.g.
Now you need to help Huatuo to work out what's the minimal number of bottles needed if he want to bring
Input
The first line of the input gives the number of test cases,T(1≤T≤100) .T lines follow. Each line consist of one integer N(1≤N≤100) , the number of types of the medicine.
Output
For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the minimal number of bottles Huatuo needed.
Sample Input
12
Sample Output
Case #1: 3
ac代码:
#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>#define MAXN 100100#define MOD 1000000007#define LL long long#define INF 0xfffffffusing namespace std;int main(){ int t,n; int cas=0; scanf("%d",&t); while(t--) { scanf("%d",&n); printf("Case #%d: %d\n",++cas,2*n-1); } return 0;}
0 0
- HDOJ 5551 Huatuo's Medicine (水)
- hdu 5551/Huatuo's Medicine
- HDOJ 5551 Huatuo's Medicine(qwb铜牌水题 做过的最水的)
- 【HDU 5551】【大水】Huatuo's Medicine
- HDU 5551 Huatuo's Medicine(水题)
- Huatuo's Medicine
- Huatuo's Medicine 【水题】
- Huatuo's Medicine HDU
- HDU5551-Huatuo's Medicine
- UESTC 1226 Huatuo's Medicine
- L - Huatuo's Medicine【ccpc】
- hdu5551 水题 Huatuo's Medicine
- 2015 CCPC Huatuo's Medicine
- 【简单题】CCPC Huatuo's Medicine L
- HDU 5551 Huatuo's Medicine(宇宙无敌炒鸡大水题)
- uestcoj Huatuo's Medicine 1226 (简单题)
- 【HDU5551 2015 CCPC 南阳国赛L】【水题】Huatuo's Medicine 药罐串线
- hdu5551Huatuo's Medicine(The 2015 China Collegiate Programming Contest )
- Codevs P1982 加密算法
- [leetcode 198]House Robber
- VM VirtualBox虚拟机共享文件夹(ubuntu)
- 语义分析的一些方法(下篇)
- 2015年10月份总结
- HDOJ 5551 Huatuo's Medicine (水)
- Chapter5-标准I/O库(补充)-「APUE读书笔记」
- java程序内存体现
- 【PAT】1053. Path of Equal Weight (30)
- 【读书笔记】程序员的自我修养总结(七)
- 在做App上线打包的时候遇到的问题
- 黑马程序员---IO流小结
- 杭电oj-1106-排序
- [王晓刚]深度学习在图像识别中的研究进展与展望