2015南阳ccpc L题
2015-11-01 16:42
232 查看
Time Limit:1000MS Memory Limit:65535KB 64bit IO Format:%lld
& %llu
Submit Status Practice UESTC
1226
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
2015 南阳ccpc 里边的水题了吧;
附代码:
#include<stdio.h>
int flag=1;
long long n,k;
int main()
{
scanf("%lld",&k);
while(k--)
{
scanf("%lld",&n);
printf("Case #%d: %lld\n",flag++,2*n-1);
}
}
& %llu
Submit Status Practice UESTC
1226
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
2015 南阳ccpc 里边的水题了吧;
附代码:
#include<stdio.h>
int flag=1;
long long n,k;
int main()
{
scanf("%lld",&k);
while(k--)
{
scanf("%lld",&n);
printf("Case #%d: %lld\n",flag++,2*n-1);
}
}