ural 2066. Simple Expression

2066. Simple Expression

Time limit: 1.0 second
Memory limit: 64 MB

You probably know that Alex is a very serious mathematician and he likes to solve serious problems. This is another problem from Alex.

You are given three nonnegative integers  a,  b,  c. You have to arrange them in some order and put +, − or × signs between them to minimize the outcome of the resulting expression. You are not allowed to use unary minus and parentheses in the expression. There must be exactly one sign between every pair of neighbouring numbers. You should use standard order for performing operations (multiplication first, addition and subtraction then).

Input

There are three lines with one integer in each line. The numbers are arranged in non-decreasing order (0 ≤  a ≤  b ≤  c ≤ 100).

Output

Print one number — the minimal outcome.

Sample

input	output
1 2 3	-5

Problem Author: Kirill Borozdin
Problem Source: Ural Regional School Programming Contest 2015

Tags:  problem for beginners   ( hide tags for unsolved problems )

Difficulty: 54

 

 1 #include <iostream>
 2 using namespace std;
 3 typedef long long LL;
 4 int main()
 5 {
 6     ios::sync_with_stdio(0);
 7     LL a, b, c;
 8     cin >> a >> b >> c;
 9     LL ans = a + b + c;
10     ans = min(ans, a + b - c);
11     ans = min(ans, a + b * c);
12     ans = min(ans, a * b + c);
13     ans = min(ans, a * b - c);
14     ans = min(ans, a * b * c);
15     ans = min(ans, a - b + c);
16     ans = min(ans, a - b - c);
17     ans = min(ans, a - b * c);
18     cout << ans << endl;
19     return 0;
20 }

View Code

 

转载于:https://www.cnblogs.com/StupidBoy/p/5241154.html