<p>Given an integer <code>n</code>, return <em>a list of all <strong>simplified</strong> fractions between </em><code>0</code><em> and </em><code>1</code><em> (exclusive) such that the denominator is less-than-or-equal-to </em><code>n</code>. You can return the answer in <strong>any order</strong>.</p>

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

<pre>
<strong>Input:</strong> n = 2
<strong>Output:</strong> [&quot;1/2&quot;]
<strong>Explanation:</strong> &quot;1/2&quot; is the only unique fraction with a denominator less-than-or-equal-to 2.
</pre>

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

<pre>
<strong>Input:</strong> n = 3
<strong>Output:</strong> [&quot;1/2&quot;,&quot;1/3&quot;,&quot;2/3&quot;]
</pre>

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

<pre>
<strong>Input:</strong> n = 4
<strong>Output:</strong> [&quot;1/2&quot;,&quot;1/3&quot;,&quot;1/4&quot;,&quot;2/3&quot;,&quot;3/4&quot;]
<strong>Explanation:</strong> &quot;2/4&quot; is not a simplified fraction because it can be simplified to &quot;1/2&quot;.
</pre>

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

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

class Solution {
    int getDivisor(int nom, int denom) {
        int temp;
        while (nom != 0) {
            temp = nom;
            nom = denom % nom;
            denom = temp;
        }
        return denom;
    }
    // bool isPrime(int n) {
    //     if (n < 2) return false;
    //     bool prime = true;
    //     for (int i = 3; i <= sqrt(n); i+=2) {
    //         if (n % i == 0) return false;
    //     }
    //     return prime;
    // }
public:
    vector<string> simplifiedFractions(int n) {
        vector<string> result;
        char num[10];
        for (int i = 2; i < (n+1); i++) {
            bool even = (i % 2 == 0);
            for (int j = 1; j < i; j++) {
                if (getDivisor(j, i) == 1) {
                    sprintf(num, "%d/%d", j, i);
                    result.push_back(num);
                }
                if (even) {
                    j++;
                }
            }
        }
        return result;
    }
};
24500