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 | 14089 |
31.50%
|
3092 |
75.42%
|
|
|
|
526 - String Distance and Transform Process | 14604 |
26.21%
|
2814 |
71.46%
|
|
|
|
531 - Compromise | 22202 |
30.40%
|
5170 |
76.56%
|
|
|
1207 - AGTC | 5054 |
41.12%
|
1098 |
93.53%
|
|
|
|
10066 - The Twin Towers | 25212 |
47.20%
|
8547 |
90.30%
|
|
|
|
10100 - Longest Match | 21115 |
21.90%
|
3802 |
71.94%
|
|
|
|
10192 - Vacation | 35930 |
36.28%
|
8676 |
88.96%
|
|
|
|
10405 - Longest Common Subsequence | 67245 |
37.49%
|
15000 |
88.71%
|
|
|
|
10635 - Prince and Princess | 18059 |
36.79%
|
3461 |
81.62%
|
|
|
|
10739 - String to Palindrome | 9083 |
63.25%
|
3119 |
95.22%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |