hdu 5551/Huatuo's Medicine
来源:互联网 发布:男子遭遇网络诈骗 编辑:程序博客网 时间:2024/05/18 01:09
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 medicine A 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 bring N types of medicine.
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
1
2
Sample Output
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 medicine A 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 bring N types of medicine.
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
1
2
Sample Output
Case #1: 3
题意:给n种瓶子,把瓶子绑在绳子上,求用最少瓶子就能识别每一个瓶子的类别的办法。输出最小的瓶子数。
刚开始还不相信这是水题,后面a了发现真的是水题。
#include <iostream>#include<stdio.h>using namespace std;int main(){ int T,n; cin>>T; for(int t=1;t<=T;t++) { scanf("%d",&n); cout<<"Case #"<<t<<": "<<(n-1)*2+1<<endl; } return 0;}
0 0
- hdu 5551/Huatuo's Medicine
- Huatuo's Medicine HDU
- 【HDU 5551】【大水】Huatuo's Medicine
- HDU 5551 Huatuo's Medicine(水题)
- HDOJ 5551 Huatuo's Medicine (水)
- Huatuo's Medicine
- Huatuo's Medicine 【水题】
- HDU5551-Huatuo's Medicine
- HDU 5551 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
- HDOJ 5551 Huatuo's Medicine(qwb铜牌水题 做过的最水的)
- uestcoj Huatuo's Medicine 1226 (简单题)
- 【HDU5551 2015 CCPC 南阳国赛L】【水题】Huatuo's Medicine 药罐串线
- hdu5551Huatuo's Medicine(The 2015 China Collegiate Programming Contest )
- 这只是一个测试博客Visual Studio Ultimate 2013,vs2013.5_ult_chs.iso,vs2013.5_ult_enu.iso
- Hi3516A开发--ethtool安装和使用
- 设计模式(18)------备忘录模式
- 设计模式(19)------观察者模式
- Robot Framework自动化测试--安装篇
- hdu 5551/Huatuo's Medicine
- CVPR2016目标检测新进展
- Python实现最小二乘法
- 构建高性能web之路------mysql读写分离实战
- Activity的生命周期测试
- Hadoop 数据节点DataNode异常
- openvswitch的原理和常用命令
- JavaScript程序运行顺序分析
- 全面学习java nio