C++
文章平均质量分 82
alex_yuqian
这个作者很懒,什么都没留下…
展开
-
POJ 3331: Factorial Calculation (High Precision Problem)
Overview: Give two numbers n, m, M is 0 to 9, ask n! How many m in the result; Input: (1) t: number of test cases; (2) n, m, total T lines; Output: n! Contains the number of M, a total of T lines. Solution: There are several procedures: Recursion is ..原创 2021-03-12 12:41:18 · 171 阅读 · 4 评论 -
Analysis for POJ 3356: DP algorithm
Question meaning: What is the least steps it takes for you changing a string to another string, provided that you can either add, delete, or change. DP algorithm: a) dp[i][j] is the least steps it take to transform the first i parts in the first string..原创 2020-12-15 18:31:11 · 146 阅读 · 1 评论