hdu5551Huatuo's Medicine(The 2015 China Collegiate Programming Contest )
2015-11-08 17:48
316 查看
Huatuo's Medicine
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 167 Accepted Submission(s): 126
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
1
2
[align=left]Sample Output[/align]
Case #1: 3
[align=left]Source[/align]
The 2015 China Collegiate Programming Contest
大大大大大水题,不想多说。
#include <iostream> #include <cstdio> #include <cstring> #include <stack> #include <queue> #include <map> #include <set> #include <vector> #include <cmath> #include <algorithm> using namespace std; const double eps = 1e-6; const double pi = acos(-1.0); const int INF = 0x3f3f3f3f; const int MOD = 1000000007; #define ll long long #define CL(a,b) memset(a,b,sizeof(a)) #define MAXN 100010 int main() { int T,n; cin>>T; for(int cas=1; cas<=T; cas++) { cin>>n; cout<<"Case #"<<cas<<": "; cout<<2*n-1<<endl; } return 0; }
相关文章推荐
- 典型用户
- c语言 数据类型
- I have a Drea -by Martin Luther King
- Android 中解决图片加载OOM 之 bitmap 压缩显示,压缩上传
- MapKit的基本使用
- CSS3扩展技术
- Java内存回收机制(第三讲)
- hdu5540 Secrete Master Plan(The 2015 China Collegiate Programming Contest )
- c语言 结构体
- 【惊爆】马哥linux2016最新全套课程(内部泄密版)
- iOS开发-内存管理
- 汇编语言-标志寄存器
- 汇编语言-标志寄存器
- c语言 内存初探
- iOS开发-Block语法
- 大道至简第六章
- This Android SDK requires Android Developer Toolkit version 23.0.0 or above
- ObjectiveC中打印Call Stack的若干方法
- 继承与接口
- iOS开发-类目、延展、协议