POJ-构造法
Kirigaya__Kazuto
这个作者很懒,什么都没留下…
展开
-
POJ-1068-Parencodings
Parencodings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 24991 Accepted: 14734 Description Let S = s1 s2...s2n be a well-formed string of parentheses.原创 2016-09-22 20:29:40 · 172 阅读 · 0 评论 -
POJ-3295-Tautology
Tautology Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12047 Accepted: 4589 Description WFF 'N PROOF is a logic game played with dice. Each die has six原创 2016-09-22 21:44:15 · 219 阅读 · 0 评论