\(\begin{array}{c|C|c|c} n & Task & Status & Algorithm \\ \hline A & Frog 1 & & \text{简单线性DP} \\ \hline B & Frog 2 & & \\ \hline C & Vacation & & \\ \hline D & Knapsack 1 & & \\ \hline E & Knapsack 2 & & \\ \hline F & LCS & & \\ \hline G & Longest Path & & \\ \hline H & Grid 1 & & \\ \hline I & Coins & & \\ \hline J & Sushi & & \\ \hline K & Stones & & \\ \hline L & Deque & & \\ \hline M & Candies & & \\ \hline N & Slimes & & \\ \hline O & Matching & & \\ \hline P & Independent Set & & \\ \hline Q & Flowers & & \\ \hline R & Walk & & \\ \hline S & Digit Sum & & \\ \hline T & Permutation & & \\ \hline U & Grouping & & \\ \hline V & Subtree & & \\ \hline W & Intervals & & \\ \hline X & Tower & & \\ \hline Y & Grid 2 & & \\ \hline Z & Frog 3 & & \\ \end{array} \)