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 1624 46.86% 46.86 %     x 540 DPL_1
judge DPL_1_B:   0-1 Knapsack Problem 1 sec 64 MB 1952 47.69% 47.69 %     x 613 DPL_1
judge DPL_1_C:   Knapsack Problem 1 sec 64 MB 854 59.25% 59.25 %     x 391 DPL_1
judge DPL_1_D:   Longest Increasing Subsequence 1 sec 64 MB 1241 36.74% 36.74 %     x 309 DPL_1
judge DPL_1_E:   Edit Distance (Levenshtein Distance) 1 sec 64 MB 643 44.48% 44.48 %     x 228 DPL_1
judge DPL_1_F:   0-1 Knapsack Problem II 1 sec 128 MB 79 48.10% 48.10 %     x 33 DPL_1
judge DPL_1_G:   Knapsack Problem with Limitations 1 sec 128 MB 64 42.19% 42.19 %     x 22 DPL_1
judge DPL_1_H:   Huge Knapsack Problem 2 sec 256 MB 67 23.88% 23.88 %     x 12 DPL_1
judge DPL_2_A:   Traveling Salesman Problem 1 sec 64 MB 514 49.61% 49.61 %     x 165 DPL_2
judge DPL_2_B:   Chinese Postman Problem 1 sec 64 MB 83 54.22% 54.22 %     x 39 DPL_2
judge DPL_3_A:   Largest Square 1 sec 64 MB 556 39.39% 39.39 %     x 135 DPL_3
judge DPL_3_B:   Largest Rectangle 1 sec 64 MB 377 33.42% 33.42 %     x 83 DPL_3
judge DPL_4_A:   Coin Combination Problem 2 sec 256 MB 21 52.38% 52.38 %     x 9 DPL_4
judge DPL_4_B:   Coin Combination Problem II 3 sec 256 MB 34 58.82% 58.82 %     x 13 DPL_4