<p>An <strong>ugly number</strong> is a positive integer whose prime factors are limited to <code>2</code>, <code>3</code>, and <code>5</code>.</p>

<p>Given an integer <code>n</code>, return <em>the</em> <code>n<sup>th</sup></code> <em><strong>ugly number</strong></em>.</p>

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

<pre>
<strong>Input:</strong> n = 10
<strong>Output:</strong> 12
<strong>Explanation:</strong> [1, 2, 3, 4, 5, 6, 8, 9, 10, 12] is the sequence of the first 10 ugly numbers.
</pre>

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

<pre>
<strong>Input:</strong> n = 1
<strong>Output:</strong> 1
<strong>Explanation:</strong> 1 has no prime factors, therefore all of its prime factors are limited to 2, 3, and 5.
</pre>

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

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

class Solution {
public:
    vector<long long int>v={1};
    int i = 0;
    void solve(int n) {
        while(v.size()<=(n+200)) {
        long long int x = v[i];
        if(!count(v.begin(),v.end(), (x*2)))
        v.push_back(x*2);
        if(!count(v.begin(),v.end(), (x*3)))
        v.push_back(x*3);
        if(!count(v.begin(),v.end(), (x*5)))
        v.push_back(x*5);
        sort(v.begin(),v.end());
        i++;
    }
    }
    
    int nthUglyNumber(int n) {
        solve(n);
        // for(int i:v)
        // cout<<i<<" ";
    sort(v.begin(),v.end());
        return v[n-1];
    }
};
19790