cf479A Expression

A. Expression
time limit per test  1 second
memory limit per test  256 megabytes
input  standard input
output  standard output

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 abc 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 ab and c print the maximum value that you can get.

Input

The input contains three integers ab and c, each on a single line (1 ≤ a, b, c ≤ 10).

Output

Print the maximum value of the expression that you can obtain.

Sample test(s)
input
1
2
3
output
9
input
2
10
3
output
60
 

 

div2的A啊……sb模拟

六种情况搞来搞去

 1 #include<cstdio>  
 2 #include<iostream>  
 3 #include<cstring>  
 4 #include<cstdlib>  
 5 #include<algorithm>  
 6 #include<cmath>  
 7 #include<queue>  
 8 #include<deque>  
 9 #include<set>  
10 #include<map>  
11 #include<ctime>  
12 #define LL long long  
13 #define inf 0x7ffffff  
14 #define pa pair<int,int>  
15 #define pi 3.1415926535897932384626433832795028841971  
16 using namespace std;  
17 LL a,b,c,ans;  
18 inline LL read()  
19 {  
20     LL x=0,f=1;char ch=getchar();  
21     while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}  
22     while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}  
23     return x*f;  
24 }  
25 int main()  
26 {  
27     a=read();b=read();c=read();  
28     ans=a+b+c;  
29     ans=max(ans,a+b*c);  
30     ans=max(ans,a*b+c);  
31     ans=max(ans,(a+b)*c);  
32     ans=max(ans,a*(b+c));  
33     ans=max(ans,a*b*c);  
34     printf("%lld\n",ans);  
35 }  
cf479A

 

转载于:https://www.cnblogs.com/zhber/p/4055120.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值