From 8b2ad38bf11b70a679ce881cab2b3cca50aa3d17 Mon Sep 17 00:00:00 2001 From: oheunhyuck <71165142+oheunhyuck@users.noreply.github.com> Date: Thu, 5 Nov 2026 22:31:57 +0900 Subject: [PATCH 1/2] Create 3857. Minimum Cost to Split into Ones --- .../3857. Minimum Cost to Split into Ones" | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 "leetcode3/\354\230\244\354\235\200\355\230\201/3857. Minimum Cost to Split into Ones" diff --git "a/leetcode3/\354\230\244\354\235\200\355\230\201/3857. Minimum Cost to Split into Ones" "b/leetcode3/\354\230\244\354\235\200\355\230\201/3857. Minimum Cost to Split into Ones" new file mode 100644 index 00000000..9401c0ec --- /dev/null +++ "b/leetcode3/\354\230\244\354\235\200\355\230\201/3857. Minimum Cost to Split into Ones" @@ -0,0 +1,15 @@ +class Solution: + + def minCost(self, n: int) -> int: + if n==1:return 0 + if n==2:return 1 + dp=[0]*(n+1) + dp[1]=0 + dp[2]=1 + dp[3]=3 + for i in range(4,n+1): + m=float('inf') + for j in range(1,i//2+1): + m=min(m,dp[j]+dp[i-j]+(j*(i-j))) + dp[i]=m + return dp[n] From 4a9923a1f5c4c4d36d3b039329e54e0de7af009a Mon Sep 17 00:00:00 2001 From: oheunhyuck <71165142+oheunhyuck@users.noreply.github.com> Date: Thu, 5 Nov 2026 22:32:22 +0900 Subject: [PATCH 2/2] Create 1733. Minimum Number of People to Teach --- .../1733. Minimum Number of People to Teach" | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 "leetcode3/\354\230\244\354\235\200\355\230\201/1733. Minimum Number of People to Teach" diff --git "a/leetcode3/\354\230\244\354\235\200\355\230\201/1733. Minimum Number of People to Teach" "b/leetcode3/\354\230\244\354\235\200\355\230\201/1733. Minimum Number of People to Teach" new file mode 100644 index 00000000..246a8542 --- /dev/null +++ "b/leetcode3/\354\230\244\354\235\200\355\230\201/1733. Minimum Number of People to Teach" @@ -0,0 +1,24 @@ +class Solution: + def minimumTeachings(self, n: int, languages: list[list[int]], friendships: list[list[int]]) -> int: + impossible=[] + ans=float('inf') + for u,v in friendships: + if len(set(languages[u-1])&set(languages[v-1]))==0: + impossible.append([u,v]) + + + for l in range(1,n+1): + cnt=0 + temp_lang=[set(y) for y in languages] + + for u,v in impossible: + if l not in temp_lang[u-1]: + temp_lang[u-1].add(l) + cnt+=1 + if l not in temp_lang[v-1]: + temp_lang[v-1].add(l) + cnt+=1 + ans=min(ans,cnt) + return ans + +