CF552E.Vanya and Brackets

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Vanya is doing his maths homework. He has an expression of form , where $x_{1},x_{2},...,x_{n}$ are digits from $1$ to $9$ , and sign represents either a plus '+' or the multiplication sign '*'. Vanya needs to add one pair of brackets in this expression so that to maximize the value of the resulting expression.

输入格式

The first line contains expression $s$ ( $1<=|s|<=5001$ , $|s|$ is odd), its odd positions only contain digits from $1$ to $9$ , and even positions only contain signs $+$ and $*$ .

The number of signs $*$ doesn't exceed 15.

输出格式

In the first line print the maximum possible value of an expression.

输入输出样例

输入#1
```
3+5*7+8*4
```
输出#1
```
303
```
输入#2
```
2+3*5
```
输出#2
```
25
```
输入#3
```
3*4*5
```
输出#3
```
60
```

说明/提示

Note to the first sample test. $3+5*(7+8)*4=303$ .

Note to the second sample test. $(2+3)*5=25$ .

Note to the third sample test. $(3*4)*5=60$ (also many other variants are valid, for instance, $(3)*4*5=60$ ).

首页