摘要:
ParencodingsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 22757Accepted: 13337DescriptionLet S = s1 s2...s2n be a well-formed string of par... 阅读全文
摘要:
TautologyTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10428Accepted: 3959DescriptionWFF 'N PROOF is a logic game played with dice. Each di... 阅读全文