C. K-Complete Word
C. K-Complete Word
time limit per test2 seconds
memory limit per test512 megabytes
inputstandard input
outputstandard output
Word s of length n is called k-complete if
s is a palindrome, i.e. si=sn+1−i for all 1≤i≤n;
s has a period of k, i.e. si=sk+i for a
原创
2021-08-02 18:14:18 ·
170 阅读 ·
1 评论