题目来源：http://codeforces.com/problemset/problem/479/A
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+23=7
1(2+3)=5
123=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
input
1
2
3
output
9
input
2
10
3
output
60
题目大意：
给定三个整数a, b, c，它们都是1~9的自然数。它们之间只能进行+、*、（）的运算，且不能打乱先后顺序，问这个表达式能得到的最大值是多少？
题目分析：
纯粹暴力，相当于求a+b+c, abc, (a+b)c, a(b+c)的最大值。
参考代码：
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, cnt, ans = 0;
cin >> a >> b >> c;
cnt = a+b+c;
ans = max(cnt, ans);
cnt = (a+b)*c;
ans = max(cnt, ans);
cnt = a*(b+c);
ans = max(cnt, ans);
cnt = a*b*c;
ans = max(cnt, ans);
cout << ans;
return 0;
}