update dir

data/1.算法初阶/3.蓝桥杯-字符串/2.字符串编码/solution.md

@@ -69,7 +69,7 @@ int main()
         }
         else
         {
-            __________________
+            __________________;
         }
     }
     cout << re;

data/1.算法初阶/3.蓝桥杯-字符串/3.分类计数/solution.md

@@ -45,7 +45,7 @@ int main(int argc, char **argv)
     int len = str.length();
     for (int i = 0; i < len; i++)
     {
-        __________________
+        __________________;
     }
     cout << A << endl;
     cout << a << endl;

data/1.算法初阶/3.蓝桥杯-字符串/4.解码/solution.md

@@ -57,7 +57,7 @@ int main()
         {
             while (s1[i] != '1')
             {
-                __________________
+                __________________;
                 s1[i] = s1[i] - 1;
             }
         }

data/1.算法初阶/3.蓝桥杯-字符串/5.不同子串/solution.md

@@ -23,7 +23,7 @@ int main()
     cin >> str;
     for (int i = 0; i < str.size(); i++)
         for (int j = i; j < str.size(); j++)
-            __________________
+            __________________;
     cout << s.size();
     return 0;
 }

data/1.算法初阶/3.蓝桥杯-字符串/7.最大公共子串/solution.md

@@ -32,7 +32,7 @@ int f(const char *s1, const char *s2)
         {
             if (s1[i - 1] == s2[j - 1])
             {
-                __________________
+                __________________;
                 if (a[i][j] > max)
                     max = a[i][j];
             }

data/1.算法初阶/4.蓝桥杯-递归/1.抽签/solution.md

@@ -42,7 +42,7 @@ void f(int a[], int k, int m, char b[])
     {
         for (j = 0; j < i; j++)
             b[M - m + j] = k + 'A';
-        __________________
+        __________________;
     }
 }
 int main()

data/1.算法初阶/4.蓝桥杯-递归/2.打印图形/solution.md

@@ -80,7 +80,7 @@ void f(char a[][N], int rank, int row, int col)
     int i;
     for (i = 0; i < rank - 1; i++)
         w *= 2;
-    __________________
+    __________________;
     f(a, rank - 1, row + w / 2, col);
     f(a, rank - 1, row + w / 2, col + w);
 }

data/1.算法初阶/4.蓝桥杯-递归/3.等差数列/solution.md

@@ -46,7 +46,7 @@ int a[N];
 
 int gcd(int a, int b)
 {
-    __________________
+    __________________;
 }
 
 int main()

data/1.算法初阶/4.蓝桥杯-递归/4.取数位/solution.md

@@ -17,7 +17,7 @@ int f(int x, int k)
 {
     if (len(x) - k == 0)
         return x % 10;
-    __________________
+    __________________;
 }
 int main()
 {

data/1.算法初阶/4.蓝桥杯-递归/5.逆波兰表达式/solution.md

@@ -53,7 +53,7 @@ struct EV evaluate(char *x)
     }
 
     v1 = evaluate(x + 1);
-    __________________
+    __________________;
 
     if (x[0] == '+')
         ev.result = v1.result + v2.result;

data/1.算法初阶/4.蓝桥杯-递归/6.扑克序列/solution.md

@@ -44,7 +44,7 @@ void pailie(string str, int k, int m)
         for (i = k; i <= m; i++)
         {
             swap(&str[k], &str[i]);
-            __________________
+            __________________;
             swap(&str[k], &str[i]);
         }
     }

data/1.算法初阶/4.蓝桥杯-递归/7.振兴中华/solution.md

@@ -29,7 +29,7 @@ int f(int x, int y)
 {
     if (x == 3 || y == 4)
         return 1;
-    __________________
+    __________________;
 }
 int main()
 {

data/1.算法初阶/5.蓝桥杯-堆栈队列链表/1.堆的计数/solution.md

@@ -115,7 +115,7 @@ int main()
     {
         if (i * 2 + 1 <= n)
         {
-            __________________
+            __________________;
         }
     }
     cout << dp[1] << endl;

data/1.算法初阶/6.蓝桥杯-模拟/10.螺旋折线/solution.md

@@ -57,7 +57,7 @@ int main()
     else
     {
         sum += y > 1 ? (long long)(4 * (2 + (abs(y) - 1) * (abs(y) - 2))) : 0;
-        __________________
+        __________________;
     }
 
     cout << sum << endl;

data/1.算法初阶/6.蓝桥杯-模拟/11.兰顿蚂蚁/solution.md

@@ -110,7 +110,7 @@ void SolveNextDirection(Direction direction, int **arr, int nRow, int nCol, int
                 direction = (Direction)(direction - 1);
             arr[nRow][nCol] = 1;
         }
-        __________________
+        __________________;
         ++n;
     }
 

data/1.算法初阶/6.蓝桥杯-模拟/20.平面切分/solution.md

@@ -68,7 +68,7 @@ int main()
                 else
                     continue;
             }
-            __________________
+            __________________;
             p.second = s[i][0] * p.first + s[i][1];
             points.insert(p);
         }

data/1.算法初阶/6.蓝桥杯-模拟/3.承压计算/solution.md

@@ -80,7 +80,7 @@ int main()
         for (ll j = 1; j <= i; j++)
         {
             a[i + 1][j] += (0.5 * a[i][j]);
-            __________________
+            __________________;
         }
     }
     double minn = 1000000000, maxx = -1;

data/1.算法初阶/6.蓝桥杯-模拟/8.三体攻击/solution.md

@@ -140,7 +140,7 @@ int main()
                 for (int u = 0; u < 8; u++)
                 {
                     int x = i - d[u][0], y = j - d[u][1], z = k - d[u][2], t = d[u][3];
-                    __________________
+                    __________________;
                 }
 
     for (int i = 1; i <= m; i++)

data/1.算法初阶/7.蓝桥杯-搜索/3.分配口罩/solution.md

@@ -35,7 +35,7 @@ void dfs(int u, int s1, int s2)
     }
 
     dfs(u + 1, s1 + num[u], s2);
-    __________________
+    __________________;
 }
 
 int main()

data/1.算法初阶/7.蓝桥杯-搜索/5.超级胶水/solution.md

@@ -42,7 +42,7 @@ int dfs(int idx)
 
     int max_, a = 0x3f3f3f, b = 0x3f3f3f3f, c = 0;
     if (idx >= 2)
-        __________________
+        __________________;
     b = v[idx] * numv[idx - 1] + dfs(idx - 1);
     c = min(a, b);
     return c;

data/1.算法初阶/7.蓝桥杯-搜索/7.迷宫/solution.md

@@ -89,7 +89,7 @@ void dfs(int x, int y, int step)
             book[tx][ty] = 1;
             road[step] = dir[i];
             minns[tx][ty] = step + 1;
-            __________________
+            __________________;
             book[tx][ty] = 0;
         }
     }

data/1.算法初阶/7.蓝桥杯-搜索/9.字串排序/solution.md

@@ -108,7 +108,7 @@ void dfs2(int pre, int x, int aft, int rest, string &res)
     }
     res += string(len, 'a' + x - 1);
     rest -= len * pre;
-    __________________
+    __________________;
     return;
 }
 int calc(string a)

data/1.算法初阶/8.蓝桥杯-动态规划/1.测试次数/solution.md

@@ -34,7 +34,7 @@ int dp(int k, int n)
         return num[k][n];
     for (int i = 1; i <= n; i++)
     {
-        __________________
+        __________________;
     }
     num[k][n] = res;
     return res;