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 | 14333 |
31.52%
|
3098 |
75.40%
|
|
|
|
531 - Compromise | 22241 |
30.43%
|
5174 |
76.58%
|
|
|
10066 - The Twin Towers | 25297 |
47.18%
|
8558 |
90.30%
|
|
|
|
10100 - Longest Match | 21136 |
21.93%
|
3804 |
71.98%
|
|
|
|
10192 - Vacation | 36245 |
36.21%
|
8700 |
88.95%
|
|
|
|
10405 - Longest Common Subsequence | 68125 |
37.62%
|
15095 |
88.74%
|
|
|
|
10739 - String to Palindrome | 9340 |
63.22%
|
3141 |
95.26%
|
|
|
|
11151 - Longest Palindrome | 24383 |
30.57%
|
4753 |
83.21%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |