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
Input
The first line of the input gives the number of test cases,
T
(
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
Sample Input
1
2
Sample Output
Case #1: 3
题意:有n种药串在一起,医生只记得放的顺序。现在让你找到最短的链 使得医生在黑暗中也可以找到想要的药。
输出为2*n-1;
水题;
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int T;
cin>>T;
for(int i=1;i<=T;i++)
{
int n;
scanf("%d",&n);
printf("Case #%d: %d\n",i,2*n-1);
}
return 0;
}