~不可描述~

REPEATS - Repeatsno 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 example, the strings = abaabaabaaba

Long Long MessageTime Limit: 4000MS Memory Limit: 131072KTotal Submissions: 32030 Accepted: 12927Case Time Limit: 1000MSDescriptionThe little cat is majorin

Musical ThemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 31198 Accepted: 10404DescriptionA musical melody is represented as a sequence of N (1<=N<=2

Milk PatternsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 16543 Accepted: 7309Case Time Limit: 2000MSDescriptionFarmer John has noticed that th

Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TEach test case consists of one string, whose length is OutputFor each test

You are the King of Byteland. Your agents have just intercepted a batch of encrypted enemy messages concerning the date of the planned attack on your island. You immedietaly send for the Bytelandian