参考文献:
[CDKS21] Chen H, Dai W, Kim M, et al. Efficient homomorphic conversion between (ring) LWE ciphertexts[C]//International Conference on Applied Cryptography and Network Security. Cham: Springer International Publishing, 2021: 460-479.[K…
Problem - C - Codeforces
题目大意:给出一个长度为m的字符串s,问所有长度为n且由字母表中前k个字母组成的字符串是否都是s的子序列,如果不是须给出反例
1<n<26;1<k<26;1<m<1000;所有样例的m之和不超过1e6
思路…