该问题涉及根据特定的BNF语法解析和评估数学表达式。表达式可以包含变量、操作符（加号或乘号）和括号。计算时需遵循常规运算顺序，即先处理括号内的表达式，再进行乘法，最后做加法。给定一个表达式和一些不等式条件，需要找到一个变量的正整数赋值方案，使得表达式的值最小。如果无法找到满足所有不等式的赋值，输出-1。
| B |
Evaluate the Expression Input: Standard Input Output: Standard Output |
In this problem, we will consider a mathematical expression according to the following BNF grammar:
<expression> = <variable> | <expression><operator><expression>| “(“<expression>“)”
<operator> = “+” | “*”
<variable> = “a” | “b” | “c” | … | “y” | “z”
When evaluating such expressions, you have to follow the conventional rules. That means you have to do things in the brackets first and multiplications have to be done before addition.
Example: 2*(3+4*2) = 22
Given an expression and some inequalities, you have to assign each variable with a positive integer so that the value of the expression is minimized.
Consider an example:
Expression = a+b*c and Inequalities = a>b, c>b
Assignment of: a=2, b=1 and c=2 will give us the minimum value. => 2 + 1*2
最低0.47元/天 解锁文章
98
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
