650.hpp

#ifndef LEETCODE_650_HPP
#define LEETCODE_650_HPP

#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <numeric>
#include <stack>
#include <string>

using namespace std;

/*
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].
 */

class Solution {
public:
    int minSteps(int n) {
        if (n == 1)
            return 0;
        for (int i = 2; i < n; ++i) {
            if (n % i == 0)
                return i + minSteps(n / i);
        }
        return n;
    }
};

#endif //LEETCODE_650_HPP