最新文章专题视频专题问答1问答10问答100问答1000问答2000关键字专题1关键字专题50关键字专题500关键字专题1500TAG最新视频文章推荐1 推荐3 推荐5 推荐7 推荐9 推荐11 推荐13 推荐15 推荐17 推荐19 推荐21 推荐23 推荐25 推荐27 推荐29 推荐31 推荐33 推荐35 推荐37视频文章20视频文章30视频文章40视频文章50视频文章60 视频文章70视频文章80视频文章90视频文章100视频文章120视频文章140 视频2关键字专题关键字专题tag2tag3文章专题文章专题2文章索引1文章索引2文章索引3文章索引4文章索引5123456789101112131415文章专题3
当前位置: 首页 - 科技 - 知识百科 - 正文

CodeforcesRound#274(Div.2)AExpression_html/css

来源:懂视网 责编:小采 时间:2020-11-27 15:56:30
文档

CodeforcesRound#274(Div.2)AExpression_html/css

CodeforcesRound#274(Div.2)AExpression_html/css_WEB-ITnose:题目链接:Expression Expression time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Petya studies
推荐度:
导读CodeforcesRound#274(Div.2)AExpression_html/css_WEB-ITnose:题目链接:Expression Expression time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Petya studies

题目链接: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

    123

    output

    input

    2103

    output

    60



    大致题意:a, b, c三个数,在三个数中,插入“+” 和“*”运算符的任意两个组合,求能组成的表达式的值得最大值。(可以用括号)


    解题思路:没啥说的,直接暴力,总共就6种组合。




    AC代码:

    #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define INF 0x7fffffffint 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;}

    文档

    CodeforcesRound#274(Div.2)AExpression_html/css

    CodeforcesRound#274(Div.2)AExpression_html/css_WEB-ITnose:题目链接:Expression Expression time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Petya studies
    推荐度:
    • 热门焦点

    最新推荐

    猜你喜欢

    热门推荐

    专题
    Top