<p>There is only one character <code>&#39;A&#39;</code> on the screen of a notepad. You can perform one of two operations on this notepad for each step:</p>

<ul>
	<li>Copy All: You can copy all the characters present on the screen (a partial copy is not allowed).</li>
	<li>Paste: You can paste the characters which are copied last time.</li>
</ul>

<p>Given an integer <code>n</code>, return <em>the minimum number of operations to get the character</em> <code>&#39;A&#39;</code> <em>exactly</em> <code>n</code> <em>times on the screen</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 3
<strong>Output:</strong> 3
<strong>Explanation:</strong> Initially, we have one character &#39;A&#39;.
In step 1, we use Copy All operation.
In step 2, we use Paste operation to get &#39;AA&#39;.
In step 3, we use Paste operation to get &#39;AAA&#39;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 1
<strong>Output:</strong> 0
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 1000</code></li>
</ul>

class Solution {
public:
    int minSteps(int n) {
        std::queue<std::vector<int>> q;
        q.push({1, 0});
        int operations = 0;
        std::unordered_set<long long> visited;

        while (!q.empty()) {
            int size = q.size();
            for (int i = 0; i < size; i++) {
                std::vector<int> current = q.front();
                q.pop();
                int notepad = current[0];
                int clipboard = current[1];

                // If we reached n
                if (notepad == n) {
                    return operations;
                }

                // If we're passed n
                if (notepad > n) {
                    continue;
                }

                // If we've already been here
                long long state = (long long)notepad * 1000000 + clipboard;
                if (visited.find(state) != visited.end()) {
                    continue;
                }
                visited.insert(state);

                // paste what we have in the clipboard
                q.push({notepad + clipboard, clipboard});

                // copy to clipboard, only if we don't already have the same clipboard contents already
                if (notepad != clipboard) {
                    q.push({notepad, notepad});
                }
            }
            operations++;
        }

        return -1; // This line will be reached if n is not reachable
    }
};
56820