POJ2106 Boolean Expressions / Openjudge Boolean Expressions （递归）全局题号1108

最新推荐文章于 2018-09-18 13:45:38 发布

Link_Ray

最新推荐文章于 2018-09-18 13:45:38 发布

阅读量778

点赞数

分类专栏：各种OJ题文章标签： c++ 递归 acm专项训练 poj mooc

本文链接：https://blog.csdn.net/Link_Ray/article/details/76551294

版权

该博客介绍如何使用递归方法评估布尔表达式，包括V（真）和F（假）以及逻辑运算符。文章提供了样例输入和输出，并强调理解表达式结构的重要性。

摘要由CSDN通过智能技术生成

#原题
1:Boolean Expressions
总时间限制: 1000ms 内存限制: 65536kB
描述
The objective of the program you are going to produce is to evaluate boolean expressions as the one shown next:
Expression: ( V | V ) & F & ( F | V )

where V is for True, and F is for False. The expressions may include the following operators: ! for not , & for and, | for or , the use of parenthesis for operations grouping is also allowed.

To perform the evaluation of an expression, it will be considered the priority of the operators, the not having the highest, and the or the lowest. The program must yield V or F , as the result for each expression in the input file.
输入
The expressions are of a variable length, although will never exceed 100 symbols. Symbols may be separated by any number of spaces or no spaces at all, therefore, the total length of an expression, as a number of characters, is unknown.

The number of expressions in the input file is