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
Browse Problems
Root :: Competitive Programming 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Problem Solving Paradigms :: Dynamic Programming :: 0-1 Knapsack (Subset Sum)
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
|
562 - Dividing coins | 63699 |
34.98%
|
12193 |
84.94%
|
|
|
|
990 - Diving for Gold | 17971 |
31.96%
|
3432 |
87.53%
|
|
|
|
1213 - Sum of Different Primes | 9707 |
61.19%
|
2672 |
96.03%
|
|
|
|
10130 - SuperSale | 42784 |
54.80%
|
11710 |
93.98%
|
|
|
|
10261 - Ferry Loading | 47479 |
36.60%
|
3482 |
76.79%
|
|
|
|
10616 - Divisible Group Sums | 16065 |
37.14%
|
3900 |
90.44%
|
|
|
|
10664 - Luggage | 16550 |
56.97%
|
5463 |
94.55%
|
|
|
|
10819 - Trouble of 13-Dots | 26571 |
27.59%
|
4365 |
76.04%
|
|
|
|
11658 - Best Coalitions | 3813 |
33.02%
|
853 |
86.05%
|
|
|
|
11832 - Account Book | 2087 |
46.91%
|
647 |
89.18%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |


