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 | 14062 |
31.49%
|
3083 |
75.45%
|
|
|
|
526 - String Distance and Transform Process | 14302 |
26.22%
|
2800 |
71.43%
|
|
|
|
531 - Compromise | 22070 |
30.37%
|
5161 |
76.54%
|
|
|
1207 - AGTC | 3622 |
47.35%
|
1058 |
93.57%
|
|
|
|
10066 - The Twin Towers | 24968 |
47.23%
|
8525 |
90.30%
|
|
|
|
10100 - Longest Match | 20748 |
22.11%
|
3789 |
72.08%
|
|
|
|
10192 - Vacation | 35480 |
36.30%
|
8639 |
88.97%
|
|
|
|
10405 - Longest Common Subsequence | 65634 |
37.19%
|
14888 |
88.72%
|
|
|
|
10635 - Prince and Princess | 17960 |
36.70%
|
3436 |
81.58%
|
|
|
|
10739 - String to Palindrome | 8888 |
63.10%
|
3087 |
95.21%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |