Browse Problems 
Our Patreons
Diamond Sponsors
Steven & Felix Halim
Reinardus Pradhitya
Gold Sponsors
--- YOUR NAME HERE ----
Silver Sponsors
--- YOUR NAME HERE ----
Bronze Sponsors
Christianto Handojo
Krzysztof Adamek
Fatima Broom
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
Browse Problems
Root :: Competitive Programming: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 6. String Processing :: String Processing with DP
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
164 - String Computer | 14087 |
31.50%
|
3090 |
75.44%
|
|
|
|
531 - Compromise | 22153 |
30.42%
|
5168 |
76.57%
|
|
|
10066 - The Twin Towers | 25144 |
47.20%
|
8541 |
90.32%
|
|
|
|
10100 - Longest Match | 20999 |
21.97%
|
3796 |
72.02%
|
|
|
|
10192 - Vacation | 35830 |
36.28%
|
8666 |
88.98%
|
|
|
|
10405 - Longest Common Subsequence | 66733 |
37.34%
|
14954 |
88.70%
|
|
|
|
10739 - String to Palindrome | 9011 |
63.21%
|
3109 |
95.24%
|
|
|
|
11151 - Longest Palindrome | 24168 |
30.55%
|
4740 |
83.23%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |