首页 > 代码库 > HDU 多校1.0

HDU 多校1.0

Add More Zero

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0


Problem Description
There is a youngster known for amateur propositions concerning several mathematical hard problems.

Nowadays, he is preparing a thought-provoking problem on a specific type of supercomputer which has ability to support calculations of integers between 0技术分享 and (2技术分享m技术分享1)技术分享 (inclusive).

As a young man born with ten fingers, he loves the powers of 10技术分享 so much, which results in his eccentricity that he always ranges integers he would like to use from 1技术分享 to 10技术分享k技术分享技术分享 (inclusive).

For the sake of processing, all integers he would use possibly in this interesting problem ought to be as computable as this supercomputer could.

Given the positive integer m技术分享, your task is to determine maximum possible integer k技术分享 that is suitable for the specific supercomputer.
 

 

Input
The input contains multiple test cases. Each test case in one line contains only one positive integer m技术分享, satisfying 1m10技术分享5技术分享技术分享.
 

 

Output
For each test case, output "Case #x技术分享: y技术分享" in one line (without quotes), where x技术分享 indicates the case number starting from 1技术分享 and y技术分享 denotes the answer of corresponding case.
 

 

Sample Input
164
 

 

Sample Output
Case #1: 0Case #2: 19

HDU 多校1.0