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 | 60265 |
34.67%
|
11993 |
84.95%
|
||
990 - Diving for Gold | 16224 |
32.00%
|
3352 |
87.50%
|
||
1213 - Sum of Different Primes | 9078 |
60.84%
|
2584 |
96.17%
|
||
10130 - SuperSale | 39339 |
52.87%
|
11486 |
93.94%
|
||
10261 - Ferry Loading | 34372 |
34.64%
|
3438 |
76.64%
|
||
10616 - Divisible Group Sums | 15698 |
37.17%
|
3866 |
90.38%
|
||
10664 - Luggage | 15124 |
56.59%
|
5339 |
94.51%
|
||
10819 - Trouble of 13-Dots | 23868 |
23.57%
|
4298 |
76.01%
|
||
11658 - Best Coalitions | 3740 |
33.21%
|
847 |
86.07%
|
||
11832 - Account Book | 1899 |
48.24%
|
629 |
89.19%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 10 of 10 |