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 | 14374 |
31.51%
|
3105 |
75.39%
|
|
|
|
531 - Compromise | 22268 |
30.45%
|
5179 |
76.58%
|
|
|
10066 - The Twin Towers | 25321 |
47.21%
|
8563 |
90.31%
|
|
|
|
10100 - Longest Match | 21158 |
21.93%
|
3809 |
71.99%
|
|
|
|
10192 - Vacation | 36352 |
36.20%
|
8709 |
88.95%
|
|
|
|
10405 - Longest Common Subsequence | 68396 |
37.66%
|
15116 |
88.75%
|
|
|
|
10739 - String to Palindrome | 9446 |
63.16%
|
3151 |
95.27%
|
|
|
|
11151 - Longest Palindrome | 24473 |
30.63%
|
4764 |
83.21%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |