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 1751 47.74% 47.74 %     x 586 DPL_1
judge DPL_1_B:   0-1 Knapsack Problem 1 sec 64 MB 2183 47.60% 47.60 %     x 667 DPL_1
judge DPL_1_C:   Knapsack Problem 1 sec 64 MB 968 57.23% 57.23 %     x 427 DPL_1
judge DPL_1_D:   Longest Increasing Subsequence 1 sec 64 MB 1423 37.39% 37.39 %     x 346 DPL_1
judge DPL_1_E:   Edit Distance (Levenshtein Distance) 1 sec 64 MB 739 45.06% 45.06 %     x 264 DPL_1
judge DPL_1_F:   0-1 Knapsack Problem II 1 sec 128 MB 149 44.97% 44.97 %     x 59 DPL_1
judge DPL_1_G:   Knapsack Problem with Limitations 1 sec 128 MB 108 43.52% 43.52 %     x 40 DPL_1
judge DPL_1_H:   Huge Knapsack Problem 2 sec 256 MB 148 29.73% 29.73 %     x 27 DPL_1
judge DPL_2_A:   Traveling Salesman Problem 1 sec 64 MB 573 50.09% 50.09 %     x 181 DPL_2
judge DPL_2_B:   Chinese Postman Problem 1 sec 64 MB 95 55.79% 55.79 %     x 46 DPL_2
precision DPL_2_C:   Bitonic Traveling Salesman Problem 1 sec 256 MB 7 57.14% 57.14 %     x 4 DPL_2
judge DPL_3_A:   Largest Square 1 sec 64 MB 655 38.17% 38.17 %     x 156 DPL_3
judge DPL_3_B:   Largest Rectangle 1 sec 64 MB 429 34.27% 34.27 %     x 99 DPL_3
judge DPL_3_C:   Largest Rectangle in a Histogram 1 sec 256 MB 16 56.25% 56.25 %     x 9 DPL_3
judge DPL_4_A:   Coin Combination Problem 2 sec 256 MB 68 55.88% 55.88 %     x 30 DPL_4
judge DPL_4_B:   Coin Combination Problem II 3 sec 256 MB 53 60.38% 60.38 %     x 25 DPL_4