cf479A Expression

最新推荐文章于 2024-11-19 23:19:41 发布

zhb1997

最新推荐文章于 2024-11-19 23:19:41 发布

阅读量664

点赞数

CC 4.0 BY-SA版权

分类专栏： cf 模拟

本文链接：https://blog.youkuaiyun.com/zhb1997/article/details/40302261

模拟同时被 2 个专栏收录

57 篇文章

订阅专栏

47 篇文章

订阅专栏

本文探讨如何在三个整数之间插入加号和乘号，以形成表达式并求得最大可能值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Sample test(s)

input
1
2
3

output
9

input
2
10
3

output
60

div2的A啊……sb模拟

六种情况搞来搞去

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<ctime>
#define LL long long
#define inf 0x7ffffff
#define pa pair<int,int>
#define pi 3.1415926535897932384626433832795028841971
using namespace std;
LL a,b,c,ans;
inline LL read()
{
    LL x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int main()
{
	a=read();b=read();c=read();
	ans=a+b+c;
	ans=max(ans,a+b*c);
	ans=max(ans,a*b+c);
	ans=max(ans,(a+b)*c);
	ans=max(ans,a*(b+c));
	ans=max(ans,a*b*c);
	printf("%lld\n",ans);
}