Problem description
Petya studies in a school and he adores Maths. His class has been studying arithmetic expressions. On the last class the teacher wrote three positive integers a, b, c on the blackboard. The task was to insert signs of operations '+' and '*', and probably brackets between the numbers so that the value of the resulting expression is as large as possible. Let's consider an example: assume that the teacher wrote numbers 1, 2 and 3 on the blackboard. Here are some ways of placing signs and brackets:
- 1+2*3=7
- 1*(2+3)=5
- 1*2*3=6
- (1+2)*3=9
Note that you can insert operation signs only between a and b, and between b and c, that is, you cannot swap integers. For instance, in the given sample you cannot get expression (1+3)*2.
It's easy to see that the maximum value that you can obtain is 9.
Your task is: given a, b and c print the maximum value that you can get.
Input
The input contains three integers a, b and c, each on a single line (1 ≤ a, b, c ≤ 10).
Output
Print the maximum value of the expression that you can obtain.
Examples
1
2
3
9
2
10
3
60
解题思路：给定a，b，c，其顺序不能改变，向其中插入'+'或'*'或括号，则共有6种运算表达式，要求输出其中运算结果的最大值，简单枚举一下即可，水过。
AC代码：
1 #include<bits/stdc++.h> 2 using namespace std; 3 int main(){ 4 int a,b,c,k=0,s[10]; 5 cin>>a>>b>>c; 6 s[k++]=a+b+c;s[k++]=a*b*c; 7 s[k++]=a+b*c;s[k++]=a*b+c; 8 s[k++]=(a+b)*c;s[k++]=a*(b+c); 9 sort(s,s+k);cout<<s[k-1]<<endl; 10 return 0; 11 }