add 1201

Author: luliyucoordinate

README.md

@@ -506,4 +506,4 @@ LeetCode
 |1198|[Find Smallest Common Element in All Rows](https://leetcode.com/contest/biweekly-contest-9/problems/find-smallest-common-element-in-all-rows/) | c | [c++](./src/1198-Find-Smallest-Common-Element-in-All-Rows/1198.cpp) |[python](./src/1198-Find-Smallest-Common-Element-in-All-Rows/1198.py)|[go](./src/1198-Find-Smallest-Common-Element-in-All-Rows/1198.go)|[js](./src/1198-Find-Smallest-Common-Element-in-All-Rows/1198.js)|Medium|
 |1199|[Minimum Time to Build Blocks](https://leetcode.com/contest/biweekly-contest-9/problems/minimum-time-to-build-blocks/) | c | [c++](./src/1199-Minimum-Time-to-Build-Blocks/1199.cpp) |[python](./src/1199-Minimum-Time-to-Build-Blocks/1199.py)|[go](./src/1199-Minimum-Time-to-Build-Blocks/1199.go)|[js](./src/1199-Minimum-Time-to-Build-Blocks/1199.js)|Hard|
 |1200|[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/) | c | [c++](./src/1200-Minimum-Absolute-Difference/1200.cpp) |[python](./src/1200-Minimum-Absolute-Difference/1200.py)|[go](./src/1200-Minimum-Absolute-Difference/1200.go)|[js](./src/1200-Minimum-Absolute-Difference/1200.js)|Easy|
-|1201|[Ugly Number III](https://leetcode.com/problems/minimum-absolute-difference/) | c | [c++](./src/1200-Minimum-Absolute-Difference/1200.cpp) |[python](./src/1200-Minimum-Absolute-Difference/1200.py)|[go](./src/1200-Minimum-Absolute-Difference/1200.go)|[js](./src/1200-Minimum-Absolute-Difference/1200.js)|Easy|
+|1201|[Ugly Number III](https://leetcode.com/problems/ugly-number-iii/) | c | [c++](./src/1201-Ugly-Number-III/1201.cpp) |[python](./src/1201-Ugly-Number-III/1201.py)|[go](./src/1201-Ugly-Number-III/1201.go)|[js](./src/1201-Ugly-Number-III/1201.js)|Medium|

src/1201-Ugly-Number-III/1201.cpp

@@ -0,0 +1,31 @@
+class Solution 
+{
+public:
+    int nthUglyNumber(int n, int a, int b, int c) 
+    {
+        long long l = 1, r = 2000000000;
+        while (l < r)
+        {
+            long long mid = (l + r) >> 1;
+            if (cnt(mid, a, b, c) < n) l = mid + 1;
+            else r = mid;
+        }
+        return l;
+    }
+    
+    long long lcm2(int x, int y)
+    {
+        return x*1ll*y/__gcd(x, y);
+    }
+    
+    long long lcm3(int x, int y, int z)
+    {
+        long long res = x*1ll*y/__gcd(x, y);
+        return res*z/__gcd(res, z*1ll);
+    }
+    
+    int cnt(long long k, int x, int y, int z)
+    {
+        return k/x + k/y + k/z - k/lcm2(x, y) -k/lcm2(x, z) - k/lcm2(y, z) + k/lcm3(x, y, z);
+    }
+};

src/1201-Ugly-Number-III/1201.go

@@ -0,0 +1,33 @@
+func nthUglyNumber(n int, a int, b int, c int) int {
+    var l, r int64
+    l, r = 1, 2000000000
+    for l < r {
+        mid := (l + r) >> 1
+        if cnt(mid, int64(a), int64(b), int64(c)) < int64(n) {
+            l = mid + 1
+        } else {
+            r = mid
+        }
+    }
+    return int(l)
+}
+
+func gcd(x, y int64) int64 {
+    for y > 0 {
+        x, y = y, x % y
+    }
+    return x
+}
+
+func lcm2(x, y int64) int64 {
+    return x * y / gcd(x, y)
+}
+
+func lcm3(x, y, z int64) int64 {
+    res := x * y / gcd(x, y)
+    return res * z / gcd(res, z)
+}
+
+func cnt(k, x, y, z int64) int64 {
+    return k/x + k/y + k/z - k/lcm2(x, y) -k/lcm2(x, z) - k/lcm2(y, z) + k/lcm3(x, y, z)
+}

src/1201-Ugly-Number-III/1201.js

@@ -0,0 +1,40 @@
+/**
+ * @param {number} n
+ * @param {number} a
+ * @param {number} b
+ * @param {number} c
+ * @return {number}
+ */
+var nthUglyNumber = function(n, a, b, c) {
+    function gcd(x, y) {
+        while (y) {
+            var t = x;
+            x = y;
+            y = t % y;
+        }
+        return x;
+    }
+    
+    function lcm2(x, y) {
+        return Math.floor(x * y / gcd(x, y));
+    }
+    
+    function lcm3(x, y, z) {
+        var res = Math.floor(x * y / gcd(x, y));
+        return Math.floor(res * z / gcd(res, z));
+    }
+    
+    function cnt(k, x, y, z) {
+        return Math.floor(k/x) + Math.floor(k/y) + Math.floor(k/z) - 
+            Math.floor(k/lcm2(x, y)) - Math.floor(k/lcm2(x, z)) - 
+            Math.floor(k/lcm2(y, z)) + Math.floor(k/lcm3(x, y, z));
+    }
+    
+    var l = 1, r = 2000000000;
+    while (l < r) {
+        var mid = Math.floor((l + r)/2);
+        if (cnt(mid, a, b, c) < n) l = mid + 1;
+        else r = mid;
+    }
+    return l;
+};

src/1201-Ugly-Number-III/1201.py

@@ -0,0 +1,25 @@
+class Solution:
+    def nthUglyNumber(self, n: int, a: int, b: int, c: int) -> int:
+        def gcd(x, y):
+            while y:
+                x, y = y, x % y
+            return x
+        
+        def lcm2(x, y):
+            return x*y//gcd(x, y)
+        
+        def lcm3(x, y, z):
+            res = x * y // gcd(x, y)
+            return res * z // gcd(z, res)
+        
+        def cnt(k, x, y, z):
+            return k//x + k//y + k//z - k//lcm2(x,y) -k//lcm2(x, z) - k//lcm2(y, z) + k//lcm3(x, y, z)
+        
+        l, r = 1, 2*10**9
+        while l < r:
+            mid = (l + r) >> 1
+            if cnt(mid, a, b, c) < n:
+                l = mid + 1
+            else:
+                r = mid
+        return l