Viewing other problems with insights similar to ANY insight of Codeforces 913G: Power Substring.
-
Codeforces 1860A: Not a Substring
Shared similar insights
- Try to construct two strings with a small overlap, then the given string cannot be a substring of both. by Solarion
- What are the extreme strings of length 2n? (most opposite) by Solarion
- View ALL insights of this problem that are shared
-
Codeforces 1860B: Fancy Coins
Shared similar insights
- Be careful not to use brute force. The constraints are less than 10^8. Consider using floor division and modulus instead. by Solarion
- View ALL insights of this problem that are shared
-
Codeforces 1811F: Is It Flower?
Shared similar insights
- Be careful of printing anything BEFORE you read all the input. Be careful of moving on in a while loop if nothing has CHANGED. by mathmastersd
- View ALL insights of this problem that are shared
-
Codeforces 1648C: Tyler and Strings
Shared similar insights
- When dealing with lexographically smaller strings, you can consider fixing the first i characters to be the same between the strings and then the (i + 1)th character can be different. by mathmastersd
- View ALL insights of this problem that are shared
-
Codeforces 1370D: Odd-Even Subsequence
Shared similar insights
- Be careful of distinguishing the length of a subsequence being even from the length of the ORIGINAL sequence being even. by mathmastersd
- View ALL insights of this problem that are shared
Page 1 of 1.
View links to all pages
1About • Privacy Notice • Rules • Problems list • Journal • Your profile • GitHub
Moon Symbol icon by Icons8 • Sun icon by Icons8 • Emojis from Twemoji by Twitter under CC by 4.0