<p>An integer <code>x</code> is a <strong>good</strong> if after rotating each digit individually by 180 degrees, we get a valid number that is different from <code>x</code>. Each digit must be rotated - we cannot choose to leave it alone.</p>

<p>A number is valid if each digit remains a digit after rotation. For example:</p>

<ul>
	<li><code>0</code>, <code>1</code>, and <code>8</code> rotate to themselves,</li>
	<li><code>2</code> and <code>5</code> rotate to each other (in this case they are rotated in a different direction, in other words, <code>2</code> or <code>5</code> gets mirrored),</li>
	<li><code>6</code> and <code>9</code> rotate to each other, and</li>
	<li>the rest of the numbers do not rotate to any other number and become invalid.</li>
</ul>

<p>Given an integer <code>n</code>, return <em>the number of <strong>good</strong> integers in the range </em><code>[1, n]</code>.</p>

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

<pre>
<strong>Input:</strong> n = 10
<strong>Output:</strong> 4
<strong>Explanation:</strong> There are four good numbers in the range [1, 10] : 2, 5, 6, 9.
Note that 1 and 10 are not good numbers, since they remain unchanged after rotating.
</pre>

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

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

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

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

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

<ul>
	<li><code>1 &lt;= n &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution {
public:
    std::vector<int> get_digits(int n) {

        std::vector<int> res;
        while (n != 0) {
            res.push_back(n % 10);
            n = n / 10;
        }

        return res;
    }

    int make_number(const std::vector<int>& dig) {
        int n{};
        for (size_t i = 0; i < dig.size(); i++) {
            n = n + dig[i] * pow(10, i);
        }
        return n;
    }

    int rotate(std::vector<int>& dig) {

        for (size_t i = 0; i < dig.size(); i++) {
            if (dig[i] == 2)
                dig[i] = 5;
            else if (dig[i] == 5)
                dig[i] = 2;
            else if (dig[i] == 6)
                dig[i] = 9;
            else if (dig[i] == 9)
                dig[i] = 6;
        }
        return make_number(dig);
    }

    int rotatedDigits(int n) {

        int count{};
        for (int i = 1; i <= n; i++) {

            auto dig = get_digits(i);

            if (std::any_of(dig.begin(), dig.end(),
                            [](int d) { return d == 3 || d == 7 || d == 4; }))
                continue;

            if (rotate(dig) != i) {
                cout << i << "  " << rotate(dig) << "\n";
                count++;
            }
        }

        return count;
    }
};
24500