A. Expression

本文介绍了一个简单的编程问题,即如何通过在三个给定的整数之间插入加号、乘号和括号来构造数学表达式,以使得最终的计算结果尽可能大。通过列举所有可能的情况并比较它们的值,可以找到最大的结果。

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

A. Expression
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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 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. Expression.

问题简述:

输入三个数,在这三个数不交换位置的情况下用“+”,“*”,“()”进行连接,使得到的结果最大,输出最大结果。

问题分析:

其实罗列出所有情况并不难,所以十分简单。

程序说明:

AC通过的C语言程序如下:

#include<iostream>
using namespace std;

int main()
{
	int a,b,c;
	cin>>a>>b>>c;
	int q[6];
	q[0] = a+b+c;
	q[1] = a+b*c;
	q[2] = a*b+c;
	q[3] = a*b*c;
	q[4] = (a+b)*c;
	q[5] = a*(b+c);
	for(int i=0;i<6;i++)
	{
		if(q[0]<q[i])q[0] = q[i];
	}
	cout<<q[0];
	return 0;
} 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值