摘要： String ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1233Accepted Submission(s): 550Problem DescriptionGive you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can genera 阅读全文

摘要： How manyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1005Accepted Submission(s): 392Problem DescriptionGive you n ( n 1100 -> 1001 -> 0011->0110.InputThe input contains multiple test cases.Each test case include: first one integers n. ( 阅读全文

摘要： Glass BeadsTime Limit:3000MSMemory Limit:10000KTotal Submissions:1902Accepted:1106DescriptionOnce upon a time there was a famous actress. As you may expect, she played mostly Antique Comedies most of all. All the people loved her. But she was not interested in the crowds. Her big hobby were beads of 阅读全文

摘要： Common SubsequenceTime Limit:1000MSMemory Limit:10000KTotal Submissions:33069Accepted:12966DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there exists a strictly incr.. 阅读全文

摘要： PalindromeTime Limit:3000MSMemory Limit:65536KTotal Submissions:46951Accepted:16058DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines the minimal number of 阅读全文

摘要： IMMEDIATE DECODABILITYTime Limit:1000MSMemory Limit:10000KTotal Submissions:9630Accepted:4555DescriptionAn encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all codes are in bina 阅读全文