Create 3560. Find Minimum Log Transportation Cost.py

Author: 724thomas

leetcode3/최원준/3560. Find Minimum Log Transportation Cost.py

@@ -0,0 +1,12 @@
+class Solution:
+    def minCuttingCost(self, n: int, m: int, k: int) -> int:
+        
+        def split_cost(length):
+            cost = 0
+            while length > k:
+                remain = length - k
+                cost += k * remain
+                length = remain
+            return cost
+        
+        return split_cost(n) + split_cost(m)