HDU 5551 Huatuo's Medicine(水题)
2016-07-25 19:54
489 查看
思路:大概...就是一眼看过去2*n-1...
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T,cas=1;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
printf("Case #%d: %d\n",cas++,2*n-1);
}
}
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.
and
,
he will put
into
one bottle and put
into
two bottles. Then he will chain the bottles in the order of
.
In this way, when he arrived the patient's home, he knew that the bottle in the middle is medicine
and
the bottle on two sides are medicine
.
Now you need to help Huatuo to work out what's the minimal number of bottles needed if he want to bring
types
of medicine.
Input
The first line of the input gives the number of test cases,
.
lines
follow. Each line consist of one integer
,
the number of types of the medicine.
Output
For each test case, output one line containing Case #x: y, where
is
the test case number (starting from 1) and
is
the minimal number of bottles Huatuo needed.
Sample Input
1
2
Sample Output
Case #1: 3
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T,cas=1;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
printf("Case #%d: %d\n",cas++,2*n-1);
}
}
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.
and
,
he will put
into
one bottle and put
into
two bottles. Then he will chain the bottles in the order of
.
In this way, when he arrived the patient's home, he knew that the bottle in the middle is medicine
and
the bottle on two sides are medicine
.
Now you need to help Huatuo to work out what's the minimal number of bottles needed if he want to bring
types
of medicine.
Input
The first line of the input gives the number of test cases,
.
lines
follow. Each line consist of one integer
,
the number of types of the medicine.
Output
For each test case, output one line containing Case #x: y, where
is
the test case number (starting from 1) and
is
the minimal number of bottles Huatuo needed.
Sample Input
1
2
Sample Output
Case #1: 3
相关文章推荐
- java的变量
- 2016年最新|淘宝活动报名入口大全
- 【SSOJ】物品选取 (pack)
- 关于iOS 各个iPhone 尺寸图标的适配
- Python安装模块出错(ImportError: No module named set***)解决方法
- HDU1521——排列组合(指数型母函数)
- chmod 命令详解(转)
- 解决eclipse创建maven项目报错!Could not resolve archetype org.apache.maven.archetypes:maven-archetype-webapp:
- HDU 5546 Ancient Go(DFS)
- jQuery Datatable后台分页
- POJ-2109-Power of Cryptography
- java异常
- Mindjet MindManager abnormal program termination错误
- Greenplum查询计划分析
- curl模拟post请求提交
- <a>标签水平居中
- Java的注解
- Enabling Stack Dumping in Linux Kernel
- 页面调度算法----百度2017暑期实习生编程题
- 线性表(java)