雪霜贸贸，荠麦之茂

Given two strings a and b we define a*b to be their concatenation. For example, if a = “abc” and b = “def” then a*b = “abcdef”. If we think of concatenation as multiplication, exponentiation by a non-n

For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <

Input Input consists of two lines. The first line contains s1 and the second line contains s2. You may assume all letters are in lowercase. Output Output consists of a single line that contains the

Input The first line contains T, the number of test cases (T ≤ 200). Most of the test cases are relatively small. T lines follow, each contains a string of only small latin letters ’a’ - ’z’, whose l

#include&lt;stdio.h&gt;#include&lt;algorithm&gt;#include&lt;math.h&gt;#include&lt;string.h&gt;#include&lt;iostream&gt;using namespace std;char s[1000005];char t[1000005];int nextval[1000005];...