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 | 14061 |
31.48%
|
3083 |
75.45%
|
|
|
|
531 - Compromise | 22014 |
30.37%
|
5159 |
76.55%
|
|
|
10066 - The Twin Towers | 24893 |
47.24%
|
8519 |
90.30%
|
|
|
|
10100 - Longest Match | 20726 |
22.10%
|
3786 |
72.05%
|
|
|
|
10192 - Vacation | 35409 |
36.30%
|
8637 |
88.97%
|
|
|
|
10405 - Longest Common Subsequence | 65217 |
37.26%
|
14872 |
88.70%
|
|
|
|
10739 - String to Palindrome | 8845 |
63.12%
|
3086 |
95.20%
|
|
|
|
11151 - Longest Palindrome | 23736 |
30.80%
|
4725 |
83.30%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |