From 6ef6a03e961acca7d99825ecb2e07e77042c4fb2 Mon Sep 17 00:00:00 2001
From: Tianyi Qiu <gordanqiu@outlook.com>
Date: Thu, 19 Nov 2020 17:51:35 +0800
Subject: [PATCH] fix format

---
 docs/misc/rand-technique.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/misc/rand-technique.md b/docs/misc/rand-technique.md
index 7eb12ee1..cbe304f1 100644
--- a/docs/misc/rand-technique.md
+++ b/docs/misc/rand-technique.md
@@ -137,7 +137,7 @@ author: Ir1d, partychicken, ouuan, Marcythm, TianyiQ
 而连续选完 $k$ 对 $(s,t)$ 后判断它们是否全部满足目标 I 很简单，只要再跑一遍强连通缩点，判断一下 $n,m$ 是否都减小了 $k$ 即可。注意到若每次减少 $k=\dfrac{\min(n,m)}2$ ，则 $min(n,m)$ 必在 $O(\log(n+m))$ 轮内变成 1 ，也就转化到了平凡的情况。
 
 ???+ note "算法伪代码"
-    ```
+    ```text
 	while(n>1 and m>1):
 		randomly choose k=min(n,m)/2 pairs (s,t)
 		add edge t->s for all these pairs
-- 
2.11.0