题目描述了在一个只有字符'A'的笔记本上，通过复制和粘贴操作达到拥有特定数量的'A'。目标是找到达到特定数量'A'的最小步骤数。分析表明问题可以通过动态规划解决，利用规模较小的问题来推导较大规模问题的解决方案，避免重复计算。状态转移方程为 dp[i] = Min ( dp[ i ] / dp[ j ] + dp[ j ] ) ，其中 dp[i] 能整除 dp[j] 且 j < i。
题目
Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:
Copy All: You can copy all the characters present on the notepad (partial copy is not allowed).Paste: You can paste the characters which are copiedlast time.
Given a number n. You have to get exactly n 'A' on the notepad by performing the minimum number of steps permitted. Output the minimum number of steps to getn 'A'.
Example 1:
Input: 3
Output: 3
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
