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 | 64338 |
35.11%
|
12258 |
84.98%
|
|
|
|
990 - Diving for Gold | 18299 |
31.99%
|
3446 |
87.55%
|
|
|
|
1213 - Sum of Different Primes | 9976 |
61.28%
|
2706 |
96.12%
|
|
|
|
10130 - SuperSale | 43835 |
54.97%
|
11818 |
94.03%
|
|
|
|
10261 - Ferry Loading | 47591 |
36.61%
|
3493 |
76.84%
|
|
|
|
10616 - Divisible Group Sums | 16105 |
37.21%
|
3908 |
90.43%
|
|
|
|
10664 - Luggage | 16892 |
57.17%
|
5523 |
94.60%
|
|
|
|
10819 - Trouble of 13-Dots | 27035 |
27.62%
|
4378 |
76.02%
|
|
|
|
11658 - Best Coalitions | 3850 |
33.27%
|
859 |
86.15%
|
|
|
|
11832 - Account Book | 2113 |
47.04%
|
656 |
89.33%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

