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 | 14088 |
31.49%
|
3091 |
75.41%
|
|
|
|
526 - String Distance and Transform Process | 14506 |
26.13%
|
2810 |
71.42%
|
|
|
|
531 - Compromise | 22196 |
30.39%
|
5170 |
76.56%
|
|
|
1207 - AGTC | 5046 |
41.08%
|
1098 |
93.53%
|
|
|
|
10066 - The Twin Towers | 25195 |
47.18%
|
8547 |
90.30%
|
|
|
|
10100 - Longest Match | 21063 |
21.92%
|
3801 |
71.95%
|
|
|
|
10192 - Vacation | 35902 |
36.27%
|
8672 |
88.96%
|
|
|
|
10405 - Longest Common Subsequence | 67037 |
37.44%
|
14987 |
88.70%
|
|
|
|
10635 - Prince and Princess | 18058 |
36.79%
|
3461 |
81.62%
|
|
|
|
10739 - String to Palindrome | 9052 |
63.19%
|
3115 |
95.22%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |