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 | 14308 |
31.53%
|
3093 |
75.43%
|
|
|
|
531 - Compromise | 22209 |
30.41%
|
5171 |
76.56%
|
|
|
10066 - The Twin Towers | 25229 |
47.19%
|
8553 |
90.30%
|
|
|
|
10100 - Longest Match | 21123 |
21.91%
|
3803 |
71.94%
|
|
|
|
10192 - Vacation | 36037 |
36.23%
|
8686 |
88.95%
|
|
|
|
10405 - Longest Common Subsequence | 67415 |
37.53%
|
15025 |
88.72%
|
|
|
|
10739 - String to Palindrome | 9167 |
63.34%
|
3128 |
95.24%
|
|
|
|
11151 - Longest Palindrome | 24281 |
30.58%
|
4745 |
83.22%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |