Periodic Strings: Difference between revisions
Jump to navigation
Jump to search
imported>Kmk21 No edit summary |
imported>Kmk21 No edit summary |
||
| Line 4: | Line 4: | ||
[[Category:ICPC Problems]] | [[Category:ICPC Problems]] | ||
[[Category: | [[Category:Midatl2016]] | ||
[[Category:Ser2016]] | |||
[[Category:Algorithm Trivial]] | [[Category:Algorithm Trivial]] | ||
[[Category:Implementation Easy]] | [[Category:Implementation Easy]] | ||
[[Category:Strings]] | [[Category:Strings]] | ||
[[Category:Brute Force]] | [[Category:Brute Force]] | ||
Latest revision as of 03:25, 2 November 2017
Read the problem for a description. It's pretty hard to describe more simply!
The string is only 100 characters long. literally just loop from 1 to length(string) and check if the rules apply. It would hard to make this TLE.