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 2085 47.29% 47.29 %     x 670 DPL_1
judge DPL_1_B:   0-1 Knapsack Problem 1 sec 64 MB 2625 48.19% 48.19 %     x 790 DPL_1
judge DPL_1_C:   Knapsack Problem 1 sec 64 MB 1195 54.81% 54.81 %     x 491 DPL_1
judge DPL_1_D:   Longest Increasing Subsequence 1 sec 64 MB 1633 38.21% 38.21 %     x 385 DPL_1
judge DPL_1_E:   Edit Distance (Levenshtein Distance) 1 sec 64 MB 837 45.40% 45.40 %     x 298 DPL_1
judge DPL_1_F:   0-1 Knapsack Problem II 1 sec 128 MB 215 46.51% 46.51 %     x 84 DPL_1
judge DPL_1_G:   Knapsack Problem with Limitations 1 sec 128 MB 144 43.75% 43.75 %     x 50 DPL_1
judge DPL_1_H:   Huge Knapsack Problem 2 sec 256 MB 222 27.48% 27.48 %     x 38 DPL_1
judge DPL_2_A:   Traveling Salesman Problem 1 sec 64 MB 629 52.15% 52.15 %     x 199 DPL_2
judge DPL_2_B:   Chinese Postman Problem 1 sec 64 MB 130 55.38% 55.38 %     x 57 DPL_2
precision DPL_2_C:   Bitonic Traveling Salesman Problem 1 sec 256 MB 29 68.97% 68.97 %     x 14 DPL_2
judge DPL_3_A:   Largest Square 1 sec 64 MB 837 36.92% 36.92 %     x 187 DPL_3
judge DPL_3_B:   Largest Rectangle 1 sec 64 MB 549 33.88% 33.88 %     x 124 DPL_3
judge DPL_3_C:   Largest Rectangle in a Histogram 1 sec 256 MB 105 34.29% 34.29 %     x 27 DPL_3
judge DPL_4_A:   Coin Combination Problem 2 sec 256 MB 89 56.18% 56.18 %     x 40 DPL_4
judge DPL_4_B:   Coin Combination Problem II 3 sec 256 MB 69 57.97% 57.97 %     x 32 DPL_4