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 | 14384 |
31.53%
|
3108 |
75.39%
|
|
|
|
531 - Compromise | 22287 |
30.46%
|
5181 |
76.59%
|
|
|
10066 - The Twin Towers | 25394 |
47.26%
|
8569 |
90.31%
|
|
|
|
10100 - Longest Match | 21217 |
21.92%
|
3820 |
71.96%
|
|
|
|
10192 - Vacation | 36483 |
36.19%
|
8730 |
88.97%
|
|
|
|
10405 - Longest Common Subsequence | 68632 |
37.70%
|
15148 |
88.76%
|
|
|
|
10739 - String to Palindrome | 9562 |
63.09%
|
3161 |
95.29%
|
|
|
|
11151 - Longest Palindrome | 24817 |
30.48%
|
4766 |
83.21%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |