Codeforces Round #274 (Div. 2)(一)

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
  

  即使题目再简单也不要心急,心急就会wa...

  #include
      
       
  #include
       
         #include
        
          #include
         
           #define LL long long const int MOD = 1e9+7; using namespace std; int main() { int a,b,c; while(cin>>a>>b>>c) { int d = a+b*c; int e = a*(b+c); int f = a*b*c; int g = (a+b)*c; int h = a+b+c; int Max = max(h,max(d,max(max(e,f),g))); cout<
          
           
   
           
   B. Towers time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output 
           
   As you know, all the kids in Berland love playing with cubes. Little Petya has n towers consisting of cubes of the same size. Tower with number i consists of ai cubes stacked one on top of the other. Petya defines the instability of a set of towers as a value equal to the difference between the heights of the highest and the lowest of the towers. For example, if Petya built five cube towers with heights (8, 3, 2, 6, 3), the instability of this set is equal to 6 (the highest tower has height 8, the lowest one has height 2).
   
           
   The boy wants the instability of his set of towers to be as low as possible. All he can do is to perform the following operation several times: take the top cube from some tower and put it on top of some other tower of his set. Please note that Petya would never put the cube on the same tower from which it was removed because he thinks it's a waste of time.
   
           
   Before going to school, the boy will have time to perform no more than k such operations. Petya does not want to be late for class, so you have to help him accomplish this task.
   Input 
           
   The first line contains two space-separated positive integers n and k (1?≤?n?≤?100, 1?≤?k?≤?1000) ― the number of towers in the given set and the maximum number of operations Petya can perform. The second line contains n space-separated positive integers ai (1?≤?ai?≤?104) ― the towers' initial heights.
   Output 
           
   In the first line print two space-separated non-negative integers s and m (m?≤?k). The first number is the value of the minimum possible instability that can be obtained after performing at most k operations, the second number is the number of operations needed for that.
   
           
   In the next m lines print the description of each operation as two positive integers i and j, each of them lies within limits from 1 to n. They represent that Petya took the top cube from the i-th tower and put in on the j-th one (i?≠?j). Note that in the process of performing operations the heights of some towers can become equal to zero.
   
           
   If t