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 | 63539 |
34.98%
|
12184 |
84.94%
|
|
|
|
990 - Diving for Gold | 17894 |
31.88%
|
3424 |
87.53%
|
|
|
|
1213 - Sum of Different Primes | 9653 |
61.05%
|
2665 |
96.02%
|
|
|
|
10130 - SuperSale | 42735 |
54.77%
|
11694 |
93.98%
|
|
|
|
10261 - Ferry Loading | 47471 |
36.60%
|
3480 |
76.84%
|
|
|
|
10616 - Divisible Group Sums | 16051 |
37.15%
|
3898 |
90.46%
|
|
|
|
10664 - Luggage | 16481 |
56.91%
|
5453 |
94.55%
|
|
|
|
10819 - Trouble of 13-Dots | 26550 |
27.59%
|
4362 |
76.04%
|
|
|
|
11658 - Best Coalitions | 3812 |
33.03%
|
852 |
86.15%
|
|
|
|
11832 - Account Book | 2085 |
46.91%
|
645 |
89.30%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

