| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 1024 MB | 47 | 31 | 23 | 67.647% |
Your teacher has been marking students off on their essays for repeating words and phrases when they could be exploring new syntax and using a thesaurus to spice up their writing. In order to save yourself from being called out for using repeats, you decide to create a way to check your essay for repeated substrings and find the longest one to fix. Write a program that, given a string of characters, finds the greatest repeated substring with no overlapping characters.
The first line will contain a single integer n that indicates the number of data sets that follow. Each data set will consist of one line with a string of letters of unknown length.
Output the integer length of the longest repeated substring, a space, and then the repeated string. If there are multiple with the same length, print out the first one to appear in the string.
2 thequickbrownfoxjumpedoverthelazydog ratsarejustlikebigmicebutratsarecompletelydifferentanimals
3 the 7 ratsare
School > PLU High School Programming Contest > PLU 2020 > Novice 9번