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 1941 46.63% 46.63 %     x 626 DPL_1
judge DPL_1_B:   0-1 Knapsack Problem 1 sec 64 MB 2397 47.18% 47.18 %     x 715 DPL_1
judge DPL_1_C:   Knapsack Problem 1 sec 64 MB 1051 55.57% 55.57 %     x 442 DPL_1
judge DPL_1_D:   Longest Increasing Subsequence 1 sec 64 MB 1516 37.27% 37.27 %     x 361 DPL_1
judge DPL_1_E:   Edit Distance (Levenshtein Distance) 1 sec 64 MB 778 45.50% 45.50 %     x 280 DPL_1
judge DPL_1_F:   0-1 Knapsack Problem II 1 sec 128 MB 178 45.51% 45.51 %     x 68 DPL_1
judge DPL_1_G:   Knapsack Problem with Limitations 1 sec 128 MB 121 45.45% 45.45 %     x 43 DPL_1
judge DPL_1_H:   Huge Knapsack Problem 2 sec 256 MB 197 26.90% 26.90 %     x 30 DPL_1
judge DPL_2_A:   Traveling Salesman Problem 1 sec 64 MB 590 50.68% 50.68 %     x 186 DPL_2
judge DPL_2_B:   Chinese Postman Problem 1 sec 64 MB 120 53.33% 53.33 %     x 53 DPL_2
precision DPL_2_C:   Bitonic Traveling Salesman Problem 1 sec 256 MB 12 75.00% 75.00 %     x 9 DPL_2
judge DPL_3_A:   Largest Square 1 sec 64 MB 724 37.02% 37.02 %     x 168 DPL_3
judge DPL_3_B:   Largest Rectangle 1 sec 64 MB 514 31.52% 31.52 %     x 111 DPL_3
judge DPL_3_C:   Largest Rectangle in a Histogram 1 sec 256 MB 50 34.00% 34.00 %     x 15 DPL_3
judge DPL_4_A:   Coin Combination Problem 2 sec 256 MB 72 56.94% 56.94 %     x 33 DPL_4
judge DPL_4_B:   Coin Combination Problem II 3 sec 256 MB 59 59.32% 59.32 %     x 28 DPL_4