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 | 63955 |
35.02%
|
12220 |
84.97%
|
|
|
|
990 - Diving for Gold | 18117 |
31.90%
|
3436 |
87.51%
|
|
|
|
1213 - Sum of Different Primes | 9899 |
61.09%
|
2690 |
96.06%
|
|
|
|
10130 - SuperSale | 42895 |
54.83%
|
11735 |
93.99%
|
|
|
|
10261 - Ferry Loading | 47553 |
36.60%
|
3484 |
76.81%
|
|
|
|
10616 - Divisible Group Sums | 16084 |
37.17%
|
3903 |
90.44%
|
|
|
|
10664 - Luggage | 16690 |
56.99%
|
5471 |
94.55%
|
|
|
|
10819 - Trouble of 13-Dots | 26983 |
27.63%
|
4372 |
76.01%
|
|
|
|
11658 - Best Coalitions | 3819 |
33.02%
|
853 |
86.05%
|
|
|
|
11832 - Account Book | 2091 |
46.92%
|
648 |
89.20%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

