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 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: String Processing :: String Processing with Dynamic Programming :: Classic
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
164 - String Computer | 14316 |
31.52%
|
3093 |
75.43%
|
|
|
|
526 - String Distance and Transform Process | 14674 |
26.24%
|
2818 |
71.54%
|
|
|
|
531 - Compromise | 22209 |
30.41%
|
5171 |
76.56%
|
|
|
1207 - AGTC | 5082 |
41.26%
|
1101 |
93.55%
|
|
|
|
10066 - The Twin Towers | 25231 |
47.19%
|
8555 |
90.30%
|
|
|
|
10100 - Longest Match | 21124 |
21.91%
|
3803 |
71.94%
|
|
|
|
10192 - Vacation | 36071 |
36.23%
|
8688 |
88.96%
|
|
|
|
10405 - Longest Common Subsequence | 67786 |
37.57%
|
15055 |
88.74%
|
|
|
|
10635 - Prince and Princess | 18082 |
36.79%
|
3465 |
81.65%
|
|
|
|
10739 - String to Palindrome | 9196 |
63.26%
|
3129 |
95.24%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |