L - Huatuo's Medicine【ccpc】
2015-10-31 23:10
274 查看
L - Huatuo's Medicine
Time Limit:1000MS Memory Limit:65535KB 64bit IO Format:%lld
& %llu
Submit Status
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.
Then he will chain the bottles in the order of
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 $N$ types of medicine.
Input
The first line of the input gives the number of test cases, $T$($1\leq T\leq 100$). $T$ lines follow. Each line consist of one integer $N$($1\leq N\leq 100$),
the number of types of the medicine.
Output
For each test case, output one line containing
Sample Input
1
2
Sample Output
Case #1: 3
Time Limit:1000MS Memory Limit:65535KB 64bit IO Format:%lld
& %llu
Submit Status
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.
Aand
B, he will put
Ainto one bottle and put
Binto 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
Aand 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\leq T\leq 100$). $T$ lines follow. Each line consist of one integer $N$($1\leq N\leq 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
#include<stdio.h> int main() { long long t,n,k=1; scanf("%lld",&t); while(t--){ scanf("%lld",&n); printf("Case #%lld: %lld\n",k++,2*(n-1)+1); } return 0; }
相关文章推荐
- 人生的高境界 - 无所谓
- 个人家园 - 永久免费ASP个人主页空间
- L.WuBi - 发布个最好用的在线五笔编码查询、五笔拆字图解
- 用hta实现制作的无殇 - 快书V1.1打包下载了第1/2页
- Windows SP2 免激活安装版 - DeepinXP PLUS V2 测试版 下载
- 超星图书浏览器(SSReader) v4.00 Bulid 070511 - 数字图书阅览器 下载
- Convenientfox v0.0.1.3 - 基于FireFox的浏览器 下载
- GX::Transcoder v3.20.51.3687 - 音频视频文件转换全能王 下载
- 某市大型汽车网 - vip代码提供下载了
- CSS属性 - white-space 空白属性使用说明
- 测试模式 - XSL教程 - 5
- 选择模式 - XSL教程 - 2
- 匹配模式 - XSL教程 - 4
- XPath入门 - XSL教程 - 3
- 强烈推荐 - Ajax 技术资源中心
- filewipe - 商用级文件擦除工具 提供下载了
- Javascript - HTML的request类
- 关于XSL - XSL教程
- JS创建优美的页面滑动块效果 - Glider.js
- 脚本中出现 window.open() access is denied - 拒绝访问 情况一则及分析