给定一个算术表达式。 将所有的 “?” 替换为 0 到 9 之间的整数。 求出你能得到的最大结果。 字符串中最多包含 2 个问号。 保证给定的每个整数都在 0 到 9 之间，且给定的字符串是一个合法的算术表达式。 以下是一些定义：
输入格式
第一行包含给定的字符串 $s$。 $s$ 的长度不超过 5000。
输出格式
在一行中输出你能得到的最大值。
样例
输入 1
?+?
输出 1
18
输入 2
(?+9)-(?+1)
输出 2
17
QOJ.ac
QOJ
Time Limit: 1 s
Memory Limit: 256 MB
Total points: 100
#6750. 计算
Statistics
The problem was used in the following contests:
AI Translation —
This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.
Discussions
About Discussions
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
Open Discussions 0
No discussions in this category.
Issues
About Issues
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines:
- This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
- Do not submit duplicated issues.
- Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.