1447 solved.

liuyubobobo · liuyubobobo · commit 723c78ad5052 · 2020-05-16T11:07:23.000-07:00
diff --git a/1447-Simplified-Fractions/cpp-1447/CMakeLists.txt b/1447-Simplified-Fractions/cpp-1447/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.16)
+project(cpp_1447)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_1447 main.cpp)
diff --git a/1447-Simplified-Fractions/cpp-1447/main.cpp b/1447-Simplified-Fractions/cpp-1447/main.cpp
@@ -0,0 +1,37 @@
+/// Source : https://leetcode.com/problems/simplified-fractions/
+/// Author : liuyubobobo
+/// Time   : 2020-05-16
+
+#include <iostream>
+#include <vector>
+#include <unordered_set>
+
+using namespace std;
+
+
+/// Brute Force + GCD + HashSet
+/// Time Complexity: O(n^2)
+/// Space Complexity: O(n^2)
+class Solution {
+public:
+    vector<string> simplifiedFractions(int n) {
+
+        unordered_set<string> res;
+        for(int d = 2; d <= n; d ++)
+            for(int i = 1; i < d; i ++){
+                int g = gcd(d, i);
+                res.insert(to_string(i / g) + "/" + to_string(d / g));
+            }
+        return vector<string>(res.begin(), res.end());
+    }
+
+private:
+    int gcd(int a, int b){
+        return b == 0 ? a : gcd(b, a % b);
+    }
+};
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -1047,6 +1047,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 1444 | [Number of Ways of Cutting a Pizza](https://leetcode.com/problems/number-of-ways-of-cutting-a-pizza/) | [无] | [C++](1444-Number-of-Ways-of-Cutting-a-Pizza/cpp-1444/) | | |
 | | | | | | |
 | 1446 | [Consecutive Characters](https://leetcode.com/problems/consecutive-characters/) | [无] | [C++](1446-Consecutive-Characters/cpp-1446/) | | |
+| 1447 | [Simplified Fractions](https://leetcode.com/problems/simplified-fractions/) | [无] | [C++](1447-Simplified-Fractions/cpp-1447/) | | |
 | | | | | | |
 
 ## 力扣中文站比赛
