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 | 64200 |
35.10%
|
12242 |
84.99%
|
|
|
|
990 - Diving for Gold | 18256 |
31.96%
|
3441 |
87.56%
|
|
|
|
1213 - Sum of Different Primes | 9942 |
61.25%
|
2695 |
96.07%
|
|
|
|
10130 - SuperSale | 43329 |
55.00%
|
11768 |
94.01%
|
|
|
|
10261 - Ferry Loading | 47579 |
36.61%
|
3489 |
76.84%
|
|
|
|
10616 - Divisible Group Sums | 16088 |
37.18%
|
3904 |
90.45%
|
|
|
|
10664 - Luggage | 16806 |
57.10%
|
5495 |
94.58%
|
|
|
|
10819 - Trouble of 13-Dots | 27001 |
27.63%
|
4373 |
76.01%
|
|
|
|
11658 - Best Coalitions | 3846 |
33.20%
|
857 |
86.11%
|
|
|
|
11832 - Account Book | 2096 |
46.85%
|
648 |
89.20%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

