当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

4915:Parenthese sequence

题目描述
bobo found an ancient string. The string contains only three charaters -- "(", ")" and "?".

bobo would like to replace each "?" with "(" or ")" so that the string is valid (defined as follows). Check if the way of replacement can be uniquely determined.

Note:

An empty string is valid.
If S is valid, (S) is valid.
If U,V are valid, UV is valid.
输入解释
The input consists of several tests. For each tests:

A string s1s2…sn (1≤n≤106).
输出解释
For each tests:

If there is unique valid string, print "Unique". If there are no valid strings at all, print "None". Otherwise, print "Many".
输入样例
??
????
(??
输出样例
Unique
Many
None
来自杭电HDUOJ的附加信息
Author Xiaoxu Guo (ftiasch)
Recommend

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-4915

最后修改于 2020-10-25T23:18:02+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 131072/131072K(Java/Others)