Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"managingGroups":{},"author":"fool_king","updateTime":1714753149000,"title":"贪心","dislikeCnt":0,"content":"\n\n[Did We Get Everything Covered?](https://vjudge.net/problem/CodeForces-1924A)\n题意:字符串中所有由n个字符构成的字串是否能由该字符串的前k种字符串所组合而成?\n解决思路:**将含有k个字符的前面一个小序列定义为x1**,以此类推,当个数大于等于时为yes,否则为no,先找出最后那个不满足构成x序列的,后面填充该字符为长度n即可。\n[示例代码](https://codeforces.com/contest/1924/submission/259079727)\n","threadId":191178,"likeCnt":0,"createTime":1714752154000,"isWorkbook":false,"viewCnt":28,"openness":2,"fav":false,"id":5001,"trustable":false}