From 8d04d8208a946be3b19c485721cbf7568054fa74 Mon Sep 17 00:00:00 2001
From: 24OI-bot <15963390+24OI-bot@users.noreply.github.com>
Date: Thu, 22 Nov 2018 19:51:14 +0800
Subject: [PATCH] style: format markdown files with remark-lint

---
 docs/math/bignum.md | 73 +++++++++++++++++++++++------------------------------
 1 file changed, 31 insertions(+), 42 deletions(-)

diff --git a/docs/math/bignum.md b/docs/math/bignum.md
index 0fa35a23..91ba634d 100644
--- a/docs/math/bignum.md
+++ b/docs/math/bignum.md
@@ -361,50 +361,39 @@ $$
 代码如下：
 
 ```c++
-void sub()
-{
-    read();
-    int flag=-1;
-    for (int i=len;i>=1;i--)  //判断是否出现a<b的情况
-        if (a[i]>b[i])
-        {
-            flag=0;
-            break;
-        }
-        else if (a[i]<b[i])
-        {
-            flag=1;
-            break;
-        }
-    if (flag==1)
-    {
-        int tmp[MAXLEN]={0};  //交换两数
-        for (int i=1;i<=len;i++)
-            tmp[i]=a[i];
-        for (int i=1;i<=len;i++)
-            a[i]=b[i];
-        for (int i=1;i<=len;i++)
-            b[i]=tmp[i];
-        cout<<"-";  //输出负号
+void sub() {
+  read();
+  int flag = -1;
+  for (int i = len; i >= 1; i--)  //判断是否出现a<b的情况
+    if (a[i] > b[i]) {
+      flag = 0;
+      break;
+    } else if (a[i] < b[i]) {
+      flag = 1;
+      break;
     }
-	if (flag==-1)
-	{
-		cout<<0;
-		return;
-	}
-    for (int i=1;i<=len;i++)
-    {
-        if (a[i]-b[i]<0)
-        {
-            a[i]+=10;
-            a[i+1]--;
-        }
-        c[i]=a[i]-b[i];
+  if (flag == 1) {
+    int tmp[MAXLEN] = {0};  //交换两数
+    for (int i = 1; i <= len; i++) tmp[i] = a[i];
+    for (int i = 1; i <= len; i++) a[i] = b[i];
+    for (int i = 1; i <= len; i++) b[i] = tmp[i];
+    cout << "-";  //输出负号
+  }
+  if (flag == -1) {
+    cout << 0;
+    return;
+  }
+  for (int i = 1; i <= len; i++) {
+    if (a[i] - b[i] < 0) {
+      a[i] += 10;
+      a[i + 1]--;
     }
-    while (c[len]==0)  //压前导零
-        len--;
-    for (int i=len;i>=1;i--)  //从最高位输出
-        cout<<c[i];
+    c[i] = a[i] - b[i];
+  }
+  while (c[len] == 0)  //压前导零
+    len--;
+  for (int i = len; i >= 1; i--)  //从最高位输出
+    cout << c[i];
 }
 ```
 
-- 
2.11.0