From 5e5041a539e4a735406b5139826af3f72c089426 Mon Sep 17 00:00:00 2001
From: 24OI-bot <15963390+24OI-bot@users.noreply.github.com>
Date: Thu, 22 Aug 2019 23:43:25 -0400
Subject: [PATCH] style: format markdown files with remark-lint

---
 docs/intro/htc.md | 22 +++++++++++-----------
 1 file changed, 11 insertions(+), 11 deletions(-)

diff --git a/docs/intro/htc.md b/docs/intro/htc.md
index 1e9412f7..46647a66 100644
--- a/docs/intro/htc.md
+++ b/docs/intro/htc.md
@@ -159,27 +159,27 @@ LaTeX 作为公式排版的首选，我们应当正确地使用它。因此对
 
 伪码具体格式没有严格要求，请参考算法导论或学术论文，注意不要写成 Python。
 
-Wiki 内使用 LaTeX 书写伪码，缩进使用 `$\qquad$`，文字描述使用 `$\text$`，关键字使用 `$\textbf$`，赋值使用 `$\gets$`。
+Wiki 内使用 LaTeX 书写伪码，缩进使用 `$\qquad$` ，文字描述使用 `$\text$` ，关键字使用 `$\textbf$` ，赋值使用 `$\gets$` 。
 
-$\begin{aligned}\textbf{Input.}&\text{ The edges of the graph }e,\text{ where each element in }e\text{ is }(u, v, w)\\&\text{ denoting that there is an edge between }u\text{ and }v\text{ weighted }w\end{aligned}$
+ $\begin{aligned}\textbf{Input.}&\text{ The edges of the graph }e,\text{ where each element in }e\text{ is }(u, v, w)\\&\text{ denoting that there is an edge between }u\text{ and }v\text{ weighted }w\end{aligned}$ 
 
-$\textbf{Output.}\text{ The edges of the MST of the input graph.}$
+ $\textbf{Output.}\text{ The edges of the MST of the input graph.}$ 
 
-$\textbf{Method.}$
+ $\textbf{Method.}$ 
 
-$result \gets \varnothing$ 
+ $result \gets \varnothing$ 
 
-$\text{sort }e\text{ into nondecreasing order by weight }w$
+ $\text{sort }e\text{ into nondecreasing order by weight }w$ 
 
-$\textbf{for}\text{ each }(u, v, w)\text{ in the sorted }e$
+ $\textbf{for}\text{ each }(u, v, w)\text{ in the sorted }e$ 
 
-$\qquad\textbf{if }u\text{ and }v\text{ are not connected in the union-find set}$
+ $\qquad\textbf{if }u\text{ and }v\text{ are not connected in the union-find set}$ 
 
-$\qquad\qquad\text{connect }u\text{ and }v\text{ in the union-find set}$
+ $\qquad\qquad\text{connect }u\text{ and }v\text{ in the union-find set}$ 
 
-$\qquad\qquad result \gets result\ \bigcup\ \{(u, v, w)\}$
+ $\qquad\qquad result \gets result\ \bigcup\ \{(u, v, w)\}$ 
 
-$\textbf{return }result$
+ $\textbf{return }result$ 
 
 ```latex
 $\begin{aligned}\textbf{Input.}&\text{ The edges of the graph }e,\text{ where each element in }e\text{ is }(u, v, w)\\&\text{ denoting that there is an edge between }u\text{ and }v\text{ weighted }w\end{aligned}$
-- 
2.11.0