Codeforces-479A Expression

Expression
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
问题链接：
http://codeforces.com/problemset/problem/479/A
问题简述：
输入a b c三个数 算出他使用+、×、（）组合出的最大数（a、b、c的位置不可换）。（打星号显示不出来所以乘用×代替了）
问题分析：
题目给出的4种例子不是全部 考虑完全部情况 一共6种组合：
a+b×c
(a+b)c
ab+c
a*(b+c)
abc
a+b+c
之后筛选最大的那个组合就行了
代码：

#include<iostream>
using namespace std;
void bubble(int s[], int n)
{
	int temp;
	for(int i=1;i<n;i++)
	{
		for (int j = 0;j<n-i;j++)
		 if(s[j]<s[j+1])
		 {
			temp = s[j];
			s[j] = s[j + 1];
			s[j + 1] = temp;
		  }
	}
}
int main()
{
	int a, b, c,max[6];
	cin >> a >> b >> c;
	max[0] = a + b * c;
	max[1] = a * (b + c);
	max[2] = a * b*c;
	max[3] = (a + b)*c;
	max[4] = a + b + c;
	max[5] = a * b + c;
	bubble(max, 6);
	cout << max[0] << endl;

	return 0;
}