Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

POJ 2406 | fiking #24

Open
fiking opened this issue Aug 15, 2021 · 0 comments
Open

POJ 2406 | fiking #24

fiking opened this issue Aug 15, 2021 · 0 comments
Labels
bb08aef215bca417ef828f0237378624 Gitalk

Comments

@fiking
Copy link
Owner

fiking commented Aug 15, 2021

https://fiking.github.io/2021/01/08/POJ-2406/

Power String这道题的大意是： 给出若干字符串，求每个字符串的最小构成子串（从字符串的头开始），即由该子串不断重复能构成所给出的字符串。
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
bb08aef215bca417ef828f0237378624 Gitalk
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@fiking