diff --git a/combinatorial_opt/hungarian.hpp b/combinatorial_opt/hungarian.hpp
new file mode 100644
index 00000000..4b8416a3
--- /dev/null
+++ b/combinatorial_opt/hungarian.hpp
@@ -0,0 +1,127 @@
+#pragma once
+#include <algorithm>
+#include <cassert>
+#include <optional>
+#include <vector>
+
+// Solve assignment problem by Hungarian algorithm
+// dual problem: maximize sum(f) - sum(g) s.t. f_i - g_j <= C_ij
+// Ccomplexity: O(nm min(n, m))
+// https://www.slideshare.net/joisino/ss-249394573
+template <class T> std::pair<T, std::vector<int>> hungarian(const std::vector<std::vector<T>> &C) {
+    if (C.empty()) return {T(), {}};
+
+    const int n = C.size(), m = C.front().size();
+
+    if (n < m) {
+        std::vector transC(m, std::vector<T>(n));
+        for (int i = 0; i < n; ++i) {
+            for (int j = 0; j < m; ++j) transC.at(j).at(i) = C.at(i).at(j);
+        }
+        auto j2i = hungarian(transC);
+        std::vector<int> ret(n, -1);
+        for (int j = 0; j < m; ++j) {
+            if (j2i.second.at(j) >= 0) ret.at(j2i.second.at(j)) = j;
+        }
+        return {j2i.first, ret};
+    }
+
+    std::vector<T> f(n, T()), g(m, T());
+
+    // Make dual variables feasible
+    for (int j = 0; j < m; ++j) {
+        g[j] = f[0] - C[0][j];
+        for (int i = 0; i < n; ++i) g[j] = std::max(g[j], f[i] - C[i][j]);
+    }
+
+    std::vector<int> lmate(n, -1);
+    std::vector<std::optional<int>> rmate(m, std::nullopt);
+
+    std::vector<int> rreach(m, -1);
+    std::vector<int> rprv(m, -1);
+
+    std::vector<int> lvisited;
+
+    for (int i = 0; i < n; ++i) {
+        lvisited = {i};
+        int cur = 0;
+        int reachable_r = -1;
+
+        while (reachable_r < 0) {
+
+            auto check_l = [&]() -> void {
+                int l = lvisited[cur++];
+                for (int j = 0; j < m; ++j) {
+                    if (rreach[j] == i) continue;
+                    if (f[l] - g[j] == C[l][j]) {
+                        rreach[j] = i;
+                        rprv[j] = l;
+                        if (rmate[j].has_value()) {
+                            lvisited.push_back(rmate[j].value());
+                        } else {
+                            reachable_r = j;
+                            cur = lvisited.size();
+                            return;
+                        }
+                    }
+                }
+            };
+            while (cur < int(lvisited.size())) check_l();
+
+            if (reachable_r < 0) {
+                T min_diff = T();
+                int min_l = -1, min_r = -1;
+                for (int l : lvisited) {
+                    for (int j = 0; j < m; ++j) {
+                        if (rreach[j] == i) continue;
+                        if (T diff = C[l][j] + g[j] - f[l]; min_l < 0 or min_diff > diff) {
+                            min_diff = diff;
+                            min_l = l;
+                            min_r = j;
+                        }
+                    }
+                }
+
+                if (min_r < 0) {
+                    assert(i >= m);
+                    int l = lvisited.front();
+                    for (int t : lvisited) {
+                        if (f.at(l) < f.at(t)) l = t;
+                    }
+                    if (lmate.at(l) >= 0) {
+                        reachable_r = lmate.at(l);
+                        rmate.at(lmate.at(l)) = std::nullopt;
+                        lmate.at(l) = -1;
+                    }
+                    break;
+                }
+
+                for (int l : lvisited) f[l] += min_diff;
+                for (int j = 0; j < m; ++j) {
+                    if (rreach[j] == i) g[j] += min_diff;
+                }
+                rreach.at(min_r) = i;
+                rprv.at(min_r) = min_l;
+
+                if (rmate.at(min_r).has_value()) {
+                    lvisited.push_back(rmate.at(min_r).value());
+                } else {
+                    reachable_r = min_r;
+                }
+            }
+        }
+
+        for (int h = reachable_r; h >= 0;) {
+            int l = rprv.at(h), nxth = lmate.at(l);
+            rmate.at(h) = l;
+            lmate.at(l) = h;
+            h = nxth;
+        }
+    }
+
+    T sol = T();
+    for (int i = 0; i < n; ++i) {
+        if (lmate.at(i) >= 0) sol += C.at(i).at(lmate.at(i));
+    }
+    return {sol, lmate};
+}
diff --git a/combinatorial_opt/test/hungarian.aoj1163.test.cpp b/combinatorial_opt/test/hungarian.aoj1163.test.cpp
new file mode 100644
index 00000000..be99adf6
--- /dev/null
+++ b/combinatorial_opt/test/hungarian.aoj1163.test.cpp
@@ -0,0 +1,28 @@
+#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1163"
+#include "../hungarian.hpp"
+#include <iostream>
+#include <numeric>
+#include <vector>
+using namespace std;
+
+int main() {
+    cin.tie(nullptr), ios::sync_with_stdio(false);
+
+    while (true) {
+        int m, n;
+        cin >> m >> n;
+        if (!m) break;
+
+        vector<int> b(m), r(n);
+        for (auto &x : b) cin >> x;
+        for (auto &x : r) cin >> x;
+
+        vector<vector<int>> mat;
+        for (int x : b) {
+            mat.push_back({});
+            for (int y : r) mat.back().push_back(std::gcd(x, y) > 1 ? -1 : 0);
+        }
+
+        cout << -hungarian(mat).first << '\n';
+    }
+}
diff --git a/combinatorial_opt/test/hungarian.test.cpp b/combinatorial_opt/test/hungarian.test.cpp
new file mode 100644
index 00000000..fd2f46a2
--- /dev/null
+++ b/combinatorial_opt/test/hungarian.test.cpp
@@ -0,0 +1,20 @@
+#define PROBLEM "https://judge.yosupo.jp/problem/assignment"
+#include "../hungarian.hpp"
+
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int main() {
+    cin.tie(nullptr), ios::sync_with_stdio(false);
+    int n;
+    cin >> n;
+    vector<vector<long long>> a(n, vector<long long>(n));
+    for (auto &vec : a) {
+        for (auto &x : vec) cin >> x;
+    }
+    auto [val, sol] = hungarian<long long>(a);
+    cout << val << '\n';
+    for (auto x : sol) cout << x << ' ';
+    cout << '\n';
+}

<!DOCTYPE html PUBLIC '-//W3C//DTD XHTML 1.0 Transitional//EN' 'http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd'>
<html xmlns='http://www.w3.org/1999/xhtml'>
<head>
<title>pFad - Phonifier reborn</title>
<meta http-equiv='Content-Type' content='text/html; charset=utf-8' />
</head>
<body>
<h1>Pfad - The Proxy pFad of &#169; 2024 Garber Painting. All rights reserved.</h1>


<!-- Disclaimer -->
<p>Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.</p>
<br>
<p>Alternative Proxies:</p><p><a href="http://rainy.clevelandohioweatherforecast.com/php-proxy/index.php?q=https://github.com/hitonanode/cplib-cpp/compare/master...hungarian.diff" target="_blank">Alternative Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/index.php?u=https://github.com/hitonanode/cplib-cpp/compare/master...hungarian.diff" target="_blank">pFad Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/v3index.php?u=https://github.com/hitonanode/cplib-cpp/compare/master...hungarian.diff" target="_blank">pFad v3 Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/v4index.php?u=https://github.com/hitonanode/cplib-cpp/compare/master...hungarian.diff" target="_blank">pFad v4 Proxy</a></p></body>
</html>