<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 {
public:
    vector<string> simplifiedFractions(int n) {
        map<float,bool> m;
        vector<string> ans;
        for(int i=2;i<=n;i++){
            float  a=float(1)/float(i);
            m[a]=true;
            string s=to_string(1)+"/"+to_string(i);
            ans.push_back(s);
        }
        for(int i=2;i<=n-1;i++){
            cout<<"here i is"<<i<<" ";
            for(int j=i+1;j<=n;j++){
                cout<<"here j is"<<j<<" "<<endl;
                float a=float(i)/float(j);
                

                if(m[a]==false){
                    string s=to_string(i)+"/"+to_string(j);

                    
                    ans.push_back(s);

                    m[a]=true;

                }
            }
        }
        return ans;
        
    }
};
35400