摘要：
A substring of a string T is defined as: T( i, k)= TiTi +1... Ti+k -1, 1≤ i≤ i+k-1≤| T|. Given two strings A, B and one integer K, we define S, a set 阅读全文
摘要：
The repetition number of a string is defined as the maximum number R such that the string can be partitioned into R same consecutive substrings. For e 阅读全文
摘要：
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 string s = aba 阅读全文
摘要：
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 strin 阅读全文
摘要：
Vus the Cossack has two binary strings, that is, strings that consist only of "0" and "1". We call these strings aa and bb. It is known that |b|≤|a||b 阅读全文
摘要：
You are given a tree (an undirected connected acyclic graph) consisting of nn vertices. You are playing a game on this tree. Initially all vertices ar 阅读全文
摘要：
You are given a prime number pp, nn integers a1,a2,…,ana1,a2,…,an, and an integer kk. Find the number of pairs of indexes (i,j)(i,j) (1≤i<j≤n1≤i<j≤n) 阅读全文
摘要：
Note that this is the first problem of the two similar problems. You can hack this problem only if you solve both problems. You are given a tree with 阅读全文
摘要：
sbwy给的灵感,写了一个生死簿.JAVA+SQL https://pan.baidu.com/s/1q8hi2_oRkaBFCR3VvMMMMA 提取码 sv2g 阅读全文
摘要：
Problem Description There are n lights in a circle numbered from 1 to n. The left of light 1 is light n, and the left of light k (1< k<= n) is the lig 阅读全文