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 | 59708 |
34.65%
|
11960 |
84.98%
|
||
990 - Diving for Gold | 16040 |
32.06%
|
3342 |
87.58%
|
||
1213 - Sum of Different Primes | 8903 |
60.89%
|
2564 |
96.22%
|
||
10130 - SuperSale | 38939 |
52.79%
|
11452 |
93.92%
|
||
10261 - Ferry Loading | 34239 |
34.73%
|
3429 |
76.67%
|
||
10616 - Divisible Group Sums | 15554 |
37.21%
|
3853 |
90.35%
|
||
10664 - Luggage | 15039 |
56.48%
|
5321 |
94.49%
|
||
10819 - Trouble of 13-Dots | 23791 |
23.58%
|
4287 |
76.07%
|
||
11658 - Best Coalitions | 3709 |
33.30%
|
843 |
86.12%
|
||
11832 - Account Book | 1861 |
48.63%
|
622 |
89.55%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 10 of 10 |