Skip to content
This repository was archived by the owner on Sep 20, 2023. It is now read-only.

Files

Latest commit

aQuaaQua
aQua
and
aQua
Dec 17, 2017
33f8ffd · Dec 17, 2017

History

History
executable file
·
31 lines (20 loc) · 841 Bytes

File metadata and controls

executable file
·
31 lines (20 loc) · 841 Bytes

题目

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 copied last 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 get n 'A'.

Example 1:

Input: 3
Output: 3
Explanation:
Intitally, we have one character 'A'.
In step 1, we use Copy All operation.
In step 2, we use Paste operation to get 'AA'.
In step 3, we use Paste operation to get 'AAA'.

Note: The n will be in the range [1, 1000].

解题思路

见程序注释