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 | 59846 |
34.65%
|
11970 |
84.95%
|
||
990 - Diving for Gold | 16059 |
32.05%
|
3343 |
87.56%
|
||
1213 - Sum of Different Primes | 8918 |
60.90%
|
2567 |
96.22%
|
||
10130 - SuperSale | 39042 |
52.77%
|
11457 |
93.93%
|
||
10261 - Ferry Loading | 34257 |
34.71%
|
3429 |
76.70%
|
||
10616 - Divisible Group Sums | 15574 |
37.19%
|
3853 |
90.35%
|
||
10664 - Luggage | 15046 |
56.47%
|
5323 |
94.50%
|
||
10819 - Trouble of 13-Dots | 23804 |
23.59%
|
4289 |
76.03%
|
||
11658 - Best Coalitions | 3710 |
33.32%
|
843 |
86.12%
|
||
11832 - Account Book | 1861 |
48.63%
|
622 |
89.55%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 10 of 10 |