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 1679 47.29% 47.29 %     x 558 DPL_1
judge DPL_1_B:   0-1 Knapsack Problem 1 sec 64 MB 2042 47.75% 47.75 %     x 631 DPL_1
judge DPL_1_C:   Knapsack Problem 1 sec 64 MB 896 58.71% 58.71 %     x 404 DPL_1
judge DPL_1_D:   Longest Increasing Subsequence 1 sec 64 MB 1306 37.06% 37.06 %     x 317 DPL_1
judge DPL_1_E:   Edit Distance (Levenshtein Distance) 1 sec 64 MB 663 45.10% 45.10 %     x 238 DPL_1
judge DPL_1_F:   0-1 Knapsack Problem II 1 sec 128 MB 113 47.79% 47.79 %     x 46 DPL_1
judge DPL_1_G:   Knapsack Problem with Limitations 1 sec 128 MB 93 37.63% 37.63 %     x 29 DPL_1
judge DPL_1_H:   Huge Knapsack Problem 2 sec 256 MB 117 27.35% 27.35 %     x 18 DPL_1
judge DPL_2_A:   Traveling Salesman Problem 1 sec 64 MB 545 49.91% 49.91 %     x 171 DPL_2
judge DPL_2_B:   Chinese Postman Problem 1 sec 64 MB 85 55.29% 55.29 %     x 40 DPL_2
judge DPL_3_A:   Largest Square 1 sec 64 MB 602 38.21% 38.21 %     x 140 DPL_3
judge DPL_3_B:   Largest Rectangle 1 sec 64 MB 405 32.84% 32.84 %     x 88 DPL_3
judge DPL_4_A:   Coin Combination Problem 2 sec 256 MB 44 56.82% 56.82 %     x 19 DPL_4
judge DPL_4_B:   Coin Combination Problem II 3 sec 256 MB 40 60.00% 60.00 %     x 17 DPL_4