# 650. 2 Keys Keyboard

## Problem

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:
Initially, 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'.
```

Example 2:

```
Input: n = 1
Output: 0
```

Constraints:

- 1 <= n <= 1000

## Code

```
class Solution {
public int minSteps(int n) {
int[] dp = new int[n + 1];
for (int i = 2; i <= n; i++) {
dp[i] = i;
for (int j = i - 1; j > 1; j--) {
int remain = i - j;
if (remain % j == 0) {
dp[i] = dp[j] + 1 + (remain / j);
break;
}
}
}
return dp[n];
}
}
```

```
class Solution {
public int minSteps(int n) {
int res = 0;
int factor = 2;
while (n > 1) {
while (n % factor == 0) {
res += factor;
n /= factor;
}
factor++;
}
return res;
}
}
```

按 <- 键看上一题！
649. Dota2 Senate

按 -> 键看下一题！
651. 4 Keys Keyboard