diff --git a/data_structure/wavelet_matrix.md b/data_structure/wavelet_matrix.md
index 1338aa7d..4afeaf11 100644
--- a/data_structure/wavelet_matrix.md
+++ b/data_structure/wavelet_matrix.md
@@ -78,4 +78,4 @@ cout << ans << endl;
 ## 参考文献・リンク
 
 - [ウェーブレット行列(wavelet matrix) - Eating Your Own Cat Food](https://miti-7.hatenablog.com/entry/2018/04/28/152259)
-- [Wavelet Matrix | Nyaan’s Library](https://nyaannyaan.github.io/library/data-structure-2d/wavelet-matrix.hpp.html)
+- [Wavelet Matrix \| Nyaan’s Library](https://nyaannyaan.github.io/library/data-structure-2d/wavelet-matrix.hpp.html)
diff --git a/flow/submodular_optimization_via_graph_cut.md b/flow/submodular_optimization_via_graph_cut.md
index 093918ed..3264041e 100644
--- a/flow/submodular_optimization_via_graph_cut.md
+++ b/flow/submodular_optimization_via_graph_cut.md
@@ -46,11 +46,11 @@ so.ImposeLbUb(x, 2, y, 0, 5000); // If x >= 2 && y <= 0, impose cost by 5000
 
 ## 問題例
 
-- [燃やす埋める練習問題１ | MojaCoder](https://mojacoder.app/users/_kanpurin_/problems/project_selection_problem001)
-- [燃やす埋める練習問題２ | MojaCoder](https://mojacoder.app/users/_kanpurin_/problems/project_selection_problem002)
-- [燃やす埋める練習問題３ | MojaCoder](https://mojacoder.app/users/_kanpurin_/problems/project_selection_problem003)
-- [燃やす埋める練習問題４ | MojaCoder](https://mojacoder.app/users/_kanpurin_/problems/project_selection_problem004)
-- [燃やす埋める練習問題5 | MojaCoder](https://mojacoder.app/users/_kanpurin_/problems/project_selection_problem005)
+- [燃やす埋める練習問題１ \| MojaCoder](https://mojacoder.app/users/_kanpurin_/problems/project_selection_problem001)
+- [燃やす埋める練習問題２ \| MojaCoder](https://mojacoder.app/users/_kanpurin_/problems/project_selection_problem002)
+- [燃やす埋める練習問題３ \| MojaCoder](https://mojacoder.app/users/_kanpurin_/problems/project_selection_problem003)
+- [燃やす埋める練習問題４ \| MojaCoder](https://mojacoder.app/users/_kanpurin_/problems/project_selection_problem004)
+- [燃やす埋める練習問題5 \| MojaCoder](https://mojacoder.app/users/_kanpurin_/problems/project_selection_problem005)
 - [25365번: Kingdom Partition](https://www.acmicpc.net/problem/25365)
   - そのままではこのライブラリでは解けず， 4 状態へと拡張してやる必要がある．
 
diff --git a/number/discrete_logarithm.md b/number/discrete_logarithm.md
index a60fbba1..460fe29c 100644
--- a/number/discrete_logarithm.md
+++ b/number/discrete_logarithm.md
@@ -93,4 +93,4 @@ const int res = DiscreteLogarithmMod(x, y, m);
 
 ## 参考文献・リンク
 
-- [モノイド作用に関する離散対数問題 | maspyのHP](https://maspypy.com/%e3%83%a2%e3%83%8e%e3%82%a4%e3%83%89%e4%bd%9c%e7%94%a8%e3%81%ab%e9%96%a2%e3%81%99%e3%82%8b%e9%9b%a2%e6%95%a3%e5%af%be%e6%95%b0%e5%95%8f%e9%a1%8c)
+- [モノイド作用に関する離散対数問題 \| maspyのHP](https://maspypy.com/%e3%83%a2%e3%83%8e%e3%82%a4%e3%83%89%e4%bd%9c%e7%94%a8%e3%81%ab%e9%96%a2%e3%81%99%e3%82%8b%e9%9b%a2%e6%95%a3%e5%af%be%e6%95%b0%e5%95%8f%e9%a1%8c)
diff --git a/other_algorithms/monge_d_edge_shortest_paths_enum.md b/other_algorithms/monge_d_edge_shortest_paths_enum.md
index b13bf734..09a23f7c 100644
--- a/other_algorithms/monge_d_edge_shortest_paths_enum.md
+++ b/other_algorithms/monge_d_edge_shortest_paths_enum.md
@@ -33,4 +33,4 @@ const std::vector<long long> res = MongeDEdgeShortestPaths<long long>(N, max_d,
 ## Links
 
 - [Knuth-Yao speedup - 週刊 spaghetti_source - TopCoder部](https://topcoder-g-hatena-ne-jp.jag-icpc.org/spaghetti_source/20120915/1347668163.html)
-- [monge グラフ上の d-辺最短路の d=1,…,N における列挙 | Nyaan’s Library](https://nyaannyaan.github.io/library/dp/monge-d-edge-shortest-path-enumerate.hpp.html)
+- [monge グラフ上の d-辺最短路の d=1,…,N における列挙 \| Nyaan’s Library](https://nyaannyaan.github.io/library/dp/monge-d-edge-shortest-path-enumerate.hpp.html)