当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1639:D Frog Operators

题目描述
Frog have a very simple problem for you. Frog need you to generate a number with four operations. There is a string which only contains digits '1' - '9', you are required to split it into 5 intervals and add the four operations '+', '-', '*' and '/' in order, then calculate the result(/ used as integer division) and output the largest result.
输入解释

First line contains an integer T, which indicates the number of test cases.

Every test contains one line with a string only contains digits '1'-'9'.

输出解释

For each test case, you should output two lines. 

The first line is "Case #:", # means the number of the test case. 

The second line is the largest result.

输入样例
1
12345
输出样例
Case 1:
1
提示
Limits: 
1T100000 
5length of string20

该题目包含在题集 SSPU新生赛

共提交 61

通过率 18.03%
时间上限 内存上限
1000 MS 128 MB