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 2165 47.90% 47.90 %     x 707 DPL_1
judge DPL_1_B:   0-1 Knapsack Problem 1 sec 64 MB 2815 48.24% 48.24 %     x 835 DPL_1
judge DPL_1_C:   Knapsack Problem 1 sec 64 MB 1236 54.94% 54.94 %     x 508 DPL_1
judge DPL_1_D:   Longest Increasing Subsequence 1 sec 64 MB 1712 38.61% 38.61 %     x 407 DPL_1
judge DPL_1_E:   Edit Distance (Levenshtein Distance) 1 sec 64 MB 854 45.78% 45.78 %     x 305 DPL_1
judge DPL_1_F:   0-1 Knapsack Problem II 1 sec 128 MB 232 46.12% 46.12 %     x 89 DPL_1
judge DPL_1_G:   Knapsack Problem with Limitations 1 sec 128 MB 156 44.87% 44.87 %     x 53 DPL_1
judge DPL_1_H:   Huge Knapsack Problem 2 sec 256 MB 239 25.94% 25.94 %     x 38 DPL_1
judge DPL_2_A:   Traveling Salesman Problem 1 sec 64 MB 657 52.21% 52.21 %     x 206 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 30 70.00% 70.00 %     x 15 DPL_2
judge DPL_3_A:   Largest Square 1 sec 64 MB 852 37.56% 37.56 %     x 195 DPL_3
judge DPL_3_B:   Largest Rectangle 1 sec 64 MB 579 33.85% 33.85 %     x 133 DPL_3
judge DPL_3_C:   Largest Rectangle in a Histogram 1 sec 256 MB 137 32.85% 32.85 %     x 34 DPL_3
judge DPL_4_A:   Coin Combination Problem 2 sec 256 MB 101 55.45% 55.45 %     x 42 DPL_4
judge DPL_4_B:   Coin Combination Problem II 3 sec 256 MB 73 57.53% 57.53 %     x 33 DPL_4