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 | 14088 |
31.49%
|
3091 |
75.41%
|
|
|
|
531 - Compromise | 22196 |
30.39%
|
5170 |
76.56%
|
|
|
10066 - The Twin Towers | 25195 |
47.18%
|
8547 |
90.30%
|
|
|
|
10100 - Longest Match | 21063 |
21.92%
|
3801 |
71.95%
|
|
|
|
10192 - Vacation | 35903 |
36.27%
|
8673 |
88.97%
|
|
|
|
10405 - Longest Common Subsequence | 67049 |
37.45%
|
14988 |
88.70%
|
|
|
|
10739 - String to Palindrome | 9054 |
63.19%
|
3116 |
95.22%
|
|
|
|
11151 - Longest Palindrome | 24249 |
30.55%
|
4743 |
83.22%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |