当前位置:网站首页>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
边栏推荐
- High precision face recognition based on insightface, which can directly benchmark hongruan
- guava:Collections.unmodifiableXXX创建的collection并不immutable
- Why does MySQL index fail? When do I use indexes?
- Technology sharing | packet capturing analysis TCP protocol
- Vit paper details
- guava: Multiset的使用
- 跨分片方案 总结
- Depth first traversal (DFS) and breadth first traversal (BFS)
- [Yu Yue education] reference materials for surgical skills teaching in Tongji University
- 50 commonly used numpy function explanations, parameters and usage examples
猜你喜欢
uni-app App端半屏连续扫码
Z function (extended KMP)
[Li Kou brushing questions] one dimensional dynamic planning record (53 change exchanges, 300 longest increasing subsequence, 53 largest subarray and)
跨分片方案 总结
1292_FreeROS中vTaskResume()以及xTaskResumeFromISR()的实现分析
50个常用的Numpy函数解释,参数和使用示例
快讯:飞书玩家大会线上举行;微信支付推出“教培服务工具箱”
C how to set two columns comboboxcolumn in DataGridView to bind a secondary linkage effect of cascading events
Sparkshuffle process and Mr shuffle process
Huawei has launched attacks in many industries at the same time, and its frightening technology has made European and American enterprises tremble
随机推荐
The underlying implementation of string
One line by line explanation of the source code of anchor free series network yolox (a total of ten articles, you can change the network at will after reading it, if you won't complain to me)
[Li Kou brushing questions] one dimensional dynamic planning record (53 change exchanges, 300 longest increasing subsequence, 53 largest subarray and)
LeetCode:1189. The maximum number of "balloons" -- simple
Quick news: the flybook players' conference is held online; Wechat payment launched "education and training service toolbox"
Run the deep network on PI and Jetson nano, and the program is killed
基于InsightFace的高精度人脸识别,可直接对标虹软
Why rdd/dataset is needed in spark
50个常用的Numpy函数解释,参数和使用示例
Guava: use of multiset
搜素专题(DFS )
1292_FreeROS中vTaskResume()以及xTaskResumeFromISR()的实现分析
[Digital IC manual tearing code] Verilog automatic beverage machine | topic | principle | design | simulation
Efficiency tool +wps check box shows the solution to the sun problem
MySQL related terms
MySQL - transaction details
Guava: three ways to create immutablexxx objects
JPEG2000-Matlab源码实现
Four common ways and performance comparison of ArrayList de duplication (jmh performance analysis)
string的底层实现