摘要：
Longest Common Substring A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lowercase letters. 阅读全文
摘要：
月之数 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10908 Accepted Submission(s): 6420 Problem De 阅读全文
摘要：
Wireless Password Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7175 Accepted Submission(s): 23 阅读全文
摘要：
Binary Tree Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1353 Accepted Submission(s): 796Speci 阅读全文
摘要：
LCM Walk Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1834 Accepted Submission(s): 955 Problem 阅读全文
摘要：
All X Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2469 Accepted Submission(s): 1022 Problem D 阅读全文
摘要：
Substring Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1570 Accepted Submission(s): 618 Proble 阅读全文
摘要：
BWT Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 775 Accepted Submission(s): 242 Problem Desc 阅读全文
摘要：
刚才做题准备表示一下2的x次方，于是就用的long long r=1<<x，但是这里就出现了一个问题，1的值被默认成了一个int型，如果x过大，1<<x就超过int范围, 这时候需要把1转为为long long ,所以就应该是long long r=(long long)1<<x 阅读全文
摘要：
2^x mod n = 1 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17913 Accepted Submission(s): 5609 阅读全文