2018年3月20日
SAM spoj SUBST1 New Distinct Substring
摘要： Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T<=20; Each test case consists of one stri 阅读全文
posted @ 2018-03-20 21:46 better？ 阅读(99) 评论(0) 推荐(0) 编辑