sweatOtt

摘要： A - Bi-shoe and Phi-shoe Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1370 A - Bi-shoe and Phi-sh 阅读全文

摘要： Life Forms Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 13063 Accepted: 3670 Description You may have wondered why most extraterrestrial 阅读全文

摘要： Long Long Message Time Limit: 4000MS Memory Limit: 131072K Total Submissions: 26601 Accepted: 10816 Case Time Limit: 1000MS Description The little cat 阅读全文

摘要： REPEATS - Repeats no tags A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with length l>=1. For e 阅读全文

摘要： http://www.spoj.com/problems/SUBST1/en/ 题目链接 SUBST1 - New Distinct Substrings no tags Given a string, we need to find the total number of its distinct 阅读全文

摘要： Musical Theme Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 25348 Accepted: 8546 Description A musical melody is represented as a sequenc 阅读全文

摘要： 以前做过后缀数组，直接用模板，最近打算重新认真的学一遍。感觉学一个东西一定要弄懂了，不然到最后还是要重学。 阅读全文

摘要： 1040 最大公约数之和 题目来源： rihkddd 基准时间限制：1 秒 空间限制：131072 KB 分值: 80 难度：5级算法题 收藏 关注 给出一个n，求1-n这n个数，同n的最大公约数的和。比如：n = 6 1,2,3,4,5,6 同6的最大公约数分别为1,2,3,2,1,6，加在一起 阅读全文

摘要： Network of Schools Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15211 Accepted: 6040 Description A number of schools are connected to a 阅读全文

摘要： The Bottom of a Graph Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 10114 Accepted: 4184 Description We will use the following (standard) 阅读全文