当前位置:网站首页>Codeforces Round #274 (Div. 2) –A Expression
Codeforces Round #274 (Div. 2) –A Expression
2022-07-06 13:45:00 【全栈程序员站长】
大家好,又见面了,我是全栈君。
主题链接:Expression
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 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
大致题意:a, b, c三个数。在三个数中,插入“+” 和“*”运算符的随意两个组合,求能组成的表达式的值得最大值。(能够用括号)
解题思路:没啥说的。直接暴力,总共就6种组合。
AC代码:
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define INF 0x7fffffff
int x[9];
int main()
{
// #ifdef sxk
// freopen("in.txt","r",stdin);
// #endif
int a,b,c;
while(scanf("%d%d%d",&a,&b,&c)!=EOF)
{
x[0] = a + b + c;
x[1] = a + (b * c);
x[2] = a * (b + c);
x[3] = (a + b) * c;
x[4] = (a * b) + c;
x[5] = a * b * c;
sort(x, x+6);
printf("%d\n",x[5]);
}
return 0;
}
版权声明:本文sxk原创文章。转载本文,请添加链接^_^
发布者:全栈程序员栈长,转载请注明出处:https://javaforall.cn/117058.html原文链接:https://javaforall.cn
边栏推荐
- 数字化转型挂帅复产复工,线上线下全融合重建商业逻辑
- JS method to stop foreach
- Redistemplate common collection instructions opsforset (V)
- MySQL - transaction details
- The underlying implementation of string
- 爬虫实战(五):爬豆瓣top250
- Huawei has launched attacks in many industries at the same time, and its frightening technology has made European and American enterprises tremble
- 对话阿里巴巴副总裁贾扬清:追求大模型,并不是一件坏事
- Sequoia China, just raised $9billion
- 50个常用的Numpy函数解释,参数和使用示例
猜你喜欢
PostgreSQL modifies the password of the database user
It's not my boast. You haven't used this fairy idea plug-in!
JPEG2000-Matlab源码实现
Vit paper details
Broadcast variables and accumulators in spark
Efficiency tool +wps check box shows the solution to the sun problem
Set up a time server
[Yu Yue education] higher mathematics of Nanchang University (2) reference materials
LeetCode:1189. The maximum number of "balloons" -- simple
Reset Mikrotik Routeros using netinstall
随机推荐
The golden age of the U.S. technology industry has ended, and there have been constant lamentations about chip sales and 30000 layoffs
搜素专题(DFS )
make menuconfig出现recipe for target ‘menuconfig‘ failed错误
跨分片方案 总结
Fastjson parses JSON strings (deserialized to list, map)
SQL:存储过程和触发器~笔记
Broadcast variables and accumulators in spark
It's not my boast. You haven't used this fairy idea plug-in!
JS method to stop foreach
Dialogue with Jia Yangqing, vice president of Alibaba: pursuing a big model is not a bad thing
Enhance network security of kubernetes with cilium
Realization of epoll reactor model
14 years Bachelor degree, transferred to software testing, salary 13.5k
Microsoft technology empowerment position - February course Preview
对话阿里巴巴副总裁贾扬清:追求大模型,并不是一件坏事
在Pi和Jetson nano上运行深度网络,程序被Killed
AI 企业多云存储架构实践 | 深势科技分享
技术分享 | 抓包分析 TCP 协议
Basic introduction of figure
PostgreSQL install GIS plug-in create extension PostGIS_ topology