Problem Set from DPL

Source :
Volume :

per-page : 10 20 30 50 100

 
 
Problem Title TL ML   Success Topic
judge DPL_1_A:   Coin Changing Problem 1 sec 64 MB 1724 47.33% 47.33 %     x 570 DPL_1
judge DPL_1_B:   0-1 Knapsack Problem 1 sec 64 MB 2114 47.40% 47.40 %     x 647 DPL_1
judge DPL_1_C:   Knapsack Problem 1 sec 64 MB 911 58.95% 58.95 %     x 414 DPL_1
judge DPL_1_D:   Longest Increasing Subsequence 1 sec 64 MB 1347 37.27% 37.27 %     x 327 DPL_1
judge DPL_1_E:   Edit Distance (Levenshtein Distance) 1 sec 64 MB 692 44.80% 44.80 %     x 247 DPL_1
judge DPL_1_F:   0-1 Knapsack Problem II 1 sec 128 MB 120 49.17% 49.17 %     x 51 DPL_1
judge DPL_1_G:   Knapsack Problem with Limitations 1 sec 128 MB 100 39.00% 39.00 %     x 33 DPL_1
judge DPL_1_H:   Huge Knapsack Problem 2 sec 256 MB 138 27.54% 27.54 %     x 22 DPL_1
judge DPL_2_A:   Traveling Salesman Problem 1 sec 64 MB 549 50.09% 50.09 %     x 172 DPL_2
judge DPL_2_B:   Chinese Postman Problem 1 sec 64 MB 90 55.56% 55.56 %     x 43 DPL_2
judge DPL_3_A:   Largest Square 1 sec 64 MB 629 38.16% 38.16 %     x 148 DPL_3
judge DPL_3_B:   Largest Rectangle 1 sec 64 MB 413 33.66% 33.66 %     x 92 DPL_3
judge DPL_3_C:   Largest Rectangle in a Histogram 1 sec 256 MB 5 60.00% 60.00 %     x 3 DPL_3
judge DPL_4_A:   Coin Combination Problem 2 sec 256 MB 57 54.39% 54.39 %     x 25 DPL_4
judge DPL_4_B:   Coin Combination Problem II 3 sec 256 MB 45 60.00% 60.00 %     x 20 DPL_4