3879. Find Minimum Log Transportation Cost
My accepted Python solution to LeetCode problem 3879, Find Minimum Log Transportation Cost, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.4MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.4MB, accepted 2026-01-02.
class Solution:
def minCuttingCost(self, n: int, m: int, k: int) -> int:
cost = 0
# If n > k, need to cut - the minimum cost is (n-k) * k
if n > k:
cost += (n - k) * k
# If m > k, need to cut - the minimum cost is (m-k) * k
if m > k:
cost += (m - k) * k
return cost