1
class Solution {
2
 public:
3
  bool simplified(int n, int i) {
4
    while (i > 0) {
5
      n -= i;
6
      if (i > n) swap(n, i);
7
    }
8
    if (n > 1)
9
      return false;
10
    else
11
      return true;
12
  }
13

14
  vector<string> simplifiedFractions(int n) {
15
    vector<string> ans;
16
    while (n > 1) {
17
      int i = 1;
18
      while (i < n) {
19
        if (simplified(n, i)) {
20
          string fraction;
21
          int num = i;
22
          while (num > 0) {
23
            fraction.push_back(num % 10 + '0');
24
            num /= 10;
25
          }
26
          fraction.push_back('/');
27
          num = n;
28
          while (num > 0) {
29
            fraction.push_back(num % 10 + '0');
30
            num /= 10;
31
          }
32
          if (i > 9) swap(fraction[0], fraction[1]);
33
          if (n > 99)
34
            swap(fraction[fraction.size() - 1], fraction[fraction.size() - 3]);
35
          else if (n > 9)
36
            swap(fraction[fraction.size() - 1], fraction[fraction.size() - 2]);
37
          ans.push_back(fraction);
38
        }
39
        i++;
40
      }
41
      n--;
42
    }
43
    return ans;
44
  }
45
};