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 | 13944 |
31.50%
|
3066 |
75.34%
|
|
|
|
531 - Compromise | 21834 |
30.36%
|
5146 |
76.58%
|
|
|
10066 - The Twin Towers | 24393 |
47.21%
|
8455 |
90.30%
|
|
|
|
10100 - Longest Match | 20296 |
21.95%
|
3752 |
72.09%
|
|
|
|
10192 - Vacation | 33974 |
36.61%
|
8557 |
89.08%
|
|
|
|
10405 - Longest Common Subsequence | 62955 |
37.10%
|
14739 |
88.72%
|
|
|
|
10739 - String to Palindrome | 8189 |
63.56%
|
3057 |
95.26%
|
|
|
|
11151 - Longest Palindrome | 22946 |
30.86%
|
4667 |
83.48%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |