update exercises

data/1.算法初阶/1.蓝桥杯/方块分割/config.json

-{
-  "node_id": "569d5e11c4fc5de7844053d9a733c5e8",
-  "keywords": [],
-  "children": [],
-  "export": []
-}
\ No newline at end of file

data/1.算法初阶/1.蓝桥杯/方块分割/solution.md

-# 方块分割
-
-
-## aop
-### before
-```cpp
-
-```
-### after
-```cpp
-
-```
-
-## 答案
-```cpp
-
-```
-## 选项
-
-### A
-```cpp
-
-```
-
-### B
-```cpp
-
-```
-
-### C
-```cpp
-
-```

data/1.算法初阶/1.蓝桥杯/方格填数/solution.cpp

@@ -29,12 +29,12 @@ bool check()
 int main()
 {
     for (int i = 0; i <= 9; i++)
-        a[i] = i; //初始化
+        a[i] = i;
 
     do
     {
         if (check())
-            ans++; //如果符合条件则答案加1
+            ans++;
     } while (next_permutation(a, a + 10));
     cout << ans;
     return 0;

data/1.算法初阶/1.蓝桥杯/方格填数/solution.md

@@ -9,30 +9,127 @@
 ## aop
 ### before
 ```cpp
+#include <iostream>
+#include <algorithm>
+#include <cmath>
+using namespace std;
+
+int a[10];
+int ans;
 
 ```
 ### after
 ```cpp
+int main()
+{
+    for (int i = 0; i <= 9; i++)
+        a[i] = i;
 
+    do
+    {
+        if (check())
+            ans++;
+    } while (next_permutation(a, a + 10));
+    cout << ans;
+    return 0;
+}
 ```
 
 ## 答案
 ```cpp
-
+bool check()
+{
+    if (abs(a[0] - a[1]) == 1 || abs(a[0] - a[3]) == 1 || abs(a[0] - a[4]) == 1 || abs(a[0] - a[5]) == 1)
+        return false;
+    if (abs(a[1] - a[2]) == 1 || abs(a[1] - a[4]) == 1 || abs(a[1] - a[5]) == 1 || abs(a[1] - a[6]) == 1)
+        return false;
+    if (abs(a[2] - a[5]) == 1 || abs(a[2] - a[6]) == 1)
+        return false;
+    if (abs(a[3] - a[4]) == 1 || abs(a[3] - a[7]) == 1 || abs(a[3] - a[8]) == 1)
+        return false;
+    if (abs(a[4] - a[5]) == 1 || abs(a[4] - a[7]) == 1 || abs(a[4] - a[8]) == 1 || abs(a[4] - a[9]) == 1)
+        return false;
+    if (abs(a[5] - a[6]) == 1 || abs(a[5] - a[8]) == 1 || abs(a[5] - a[9]) == 1)
+        return false;
+    if (abs(a[6] - a[9]) == 1)
+        return false;
+    if (abs(a[7] - a[8]) == 1 || abs(a[8] - a[9]) == 1)
+        return false;
+    return true;
+}
 ```
 ## 选项
 
 ### A
 ```cpp
-
+bool check()
+{
+    if (abs(a[0] - a[1]) == 1 || abs(a[0] - a[3]) == 1 || abs(a[0] - a[4]) == 1 || abs(a[0] - a[5]) == 1)
+        return false;
+    if (abs(a[1] - a[2]) == 1 || abs(a[1] - a[4]) == 1 || abs(a[1] - a[5]) == 1 || abs(a[1] - a[6]) == 1)
+        return false;
+    if (abs(a[2] - a[5]) == 1 || abs(a[2] - a[6]) == 1)
+        return false;
+    if (abs(a[3] - a[4]) == 1 || abs(a[3] - a[7]) == 1 || abs(a[3] - a[8]) == 1)
+        return false;
+    if (abs(a[4] - a[5]) == 1 || abs(a[4] - a[7]) == 1 || abs(a[4] - a[8]) == 1 || abs(a[4] - a[9]) == 1)
+        return false;
+    if (abs(a[5] - a[6]) == 1 || abs(a[5] - a[8]) == 1 || abs(a[5] - a[9]) == 1)
+        return false;
+    if (abs(a[6] - a[7]) == 1)
+        return false;
+    if (abs(a[7] - a[8]) == 1 || abs(a[8] - a[9]) == 1)
+        return false;
+    return true;
+}
 ```
 
 ### B
 ```cpp
-
+bool check()
+{
+    if (abs(a[0] - a[1]) == 1 || abs(a[0] - a[3]) == 1 || abs(a[0] - a[4]) == 1 || abs(a[0] - a[5]) == 1)
+        return false;
+    if (abs(a[1] - a[2]) == 1 || abs(a[1] - a[4]) == 1 || abs(a[1] - a[5]) == 1 || abs(a[1] - a[6]) == 1)
+        return false;
+    if (abs(a[2] - a[5]) == 1 || abs(a[2] - a[6]) == 1)
+        return false;
+    if (abs(a[3] - a[4]) == 1 || abs(a[3] - a[7]) == 1 || abs(a[3] - a[8]) == 1)
+        return false;
+    if (abs(a[4] - a[5]) == 1 || abs(a[4] - a[7]) == 1 || abs(a[4] - a[8]) == 1 || abs(a[4] - a[9]) == 1)
+        return false;
+    if (abs(a[5] - a[6]) == 1 || abs(a[5] - a[8]) == 1 || abs(a[5] - a[9]) == 1)
+        return false;
+    if (abs(a[6] - a[7]) == 1)
+        return false;
+    if (abs(a[7] - a[8]) == 1)
+        return false;
+    if (abs(a[8] - a[9]) == 1)
+        return false;
+    return true;
+}
 ```
 
 ### C
 ```cpp
-
+bool check()
+{
+    if (abs(a[0] - a[1]) == 1 || abs(a[0] - a[3]) == 1 || abs(a[0] - a[4]) == 1 || abs(a[0] - a[5]) == 1)
+        return false;
+    if (abs(a[1] - a[2]) == 1 || abs(a[1] - a[4]) == 1 || abs(a[1] - a[5]) == 1 || abs(a[1] - a[6]) == 1)
+        return false;
+    if (abs(a[2] - a[5]) == 1 || abs(a[2] - a[6]) == 1)
+        return false;
+    if (abs(a[3] - a[4]) == 1 || abs(a[3] - a[7]) == 1 || abs(a[3] - a[8]) == 1)
+        return false;
+    if (abs(a[4] - a[5]) == 1 || abs(a[4] - a[7]) == 1 || abs(a[4] - a[8]) == 1 || abs(a[4] - a[9]) == 1)
+        return false;
+    if (abs(a[5] - a[6]) == 1 || abs(a[5] - a[8]) == 1 || abs(a[5] - a[9]) == 1)
+        return false;
+    if (abs(a[6] - a[9]) == 1)
+        return false;
+    if (abs(a[7] - a[8]) == 1)
+        return false;
+    return true;
+}
 ```

data/1.算法初阶/1.蓝桥杯/方格计数/config.json

-{
-  "node_id": "569d5e11c4fc5de7844053d9a733c5e8",
-  "keywords": [],
-  "children": [],
-  "export": []
-}
\ No newline at end of file

data/1.算法初阶/1.蓝桥杯/方格计数/desc.md

-如图所示，在二维平面上有无数个1x1的小方格。  
-我们以某个小方格的一个顶点为圆心画一个半径为1000的圆。  
-你能计算出这个圆里有多少个完整的小方格吗？  
-![](https://upload-images.jianshu.io/upload_images/15659652-2abc8a1de9a368d2.png?imageMogr2/auto-orient/strip|imageView2/2/w/394/format/webp)
\ No newline at end of file

data/1.算法初阶/1.蓝桥杯/方格计数/solution.java

-import java.util.*;
-
-public class Main {
-    public static void main(String[] args) {
-        int r = 1000;
-        int sum = 0;
-        for (int a = 1; a <= 1001; a++) {
-            for (int b = 1; b <= 1001; b++) {
-                if (a * a + b * b <= r * r)
-                    sum++;
-            }
-        }
-        sum *= 4;
-        System.out.println(sum);
-
-    }
-}
-// 3137548

data/1.算法初阶/1.蓝桥杯/方格计数/solution.md

-# 方格计数
-如图所示，在二维平面上有无数个1x1的小方格。  
-我们以某个小方格的一个顶点为圆心画一个半径为1000的圆。  
-你能计算出这个圆里有多少个完整的小方格吗？  
-![](https://upload-images.jianshu.io/upload_images/15659652-2abc8a1de9a368d2.png?imageMogr2/auto-orient/strip|imageView2/2/w/394/format/webp)
-
-## aop
-### before
-```cpp
-
-```
-### after
-```cpp
-
-```
-
-## 答案
-```cpp
-
-```
-## 选项
-
-### A
-```cpp
-
-```
-
-### B
-```cpp
-
-```
-
-### C
-```cpp
-
-```

data/1.算法初阶/1.蓝桥杯/方阵转置/solution.md

@@ -25,7 +25,9 @@
 ## aop
 ### before
 ```cpp
+#include <bits/stdc++.h>
 
+using namespace std;
 ```
 ### after
 ```cpp
@@ -34,21 +36,110 @@
 
 ## 答案
 ```cpp
+int main()
+{
+    int m, n;
+    int a[20][20];
+    int i, j;
+    cin >> m >> n;
+    for (i = 0; i < m; i++)
+    {
+        for (j = 0; j < n; j++)
+        {
+            cin >> a[j][i];
+        }
+    }
+    for (i = 0; i < n; i++)
+    {
+        for (j = 0; j < m; j++)
+        {
+            cout << a[i][j] << " ";
+        }
+        cout << endl;
+    }
+    return 0;
+}
 
 ```
 ## 选项
 
 ### A
 ```cpp
-
+int main()
+{
+    int m, n;
+    int a[20][20];
+    int i, j;
+    cin >> m >> n;
+    for (i = 0; i < m; i++)
+    {
+        for (j = 0; j < n; j++)
+        {
+            cin >> a[j][i];
+        }
+    }
+    for (i = 0; i < n; i++)
+    {
+        for (j = m; j > 0; j--)
+        {
+            cout << a[i][j] << " ";
+        }
+        cout << endl;
+    }
+    return 0;
+}
 ```
 
 ### B
 ```cpp
-
+int main()
+{
+    int m, n;
+    int a[20][20];
+    int i, j;
+    cin >> m >> n;
+    for (i = 0; i < m; i++)
+    {
+        for (j = 0; j < n; j++)
+        {
+            cin >> a[j][i];
+        }
+    }
+    for (i = n; i > 0; i--)
+    {
+        for (j = 0; j < m; j++)
+        {
+            cout << a[i][j] << " ";
+        }
+        cout << endl;
+    }
+    return 0;
+}
 ```
 
 ### C
 ```cpp
-
+int main()
+{
+    int m, n;
+    int a[20][20];
+    int i, j;
+    cin >> m >> n;
+    for (i = 0; i < m; i++)
+    {
+        for (j = 0; j < n; j++)
+        {
+            cin >> a[j][i];
+        }
+    }
+    for (i = n; i > 0; i--)
+    {
+        for (j = m; j > 0; j--)
+        {
+            cout << a[i][j] << " ";
+        }
+        cout << endl;
+    }
+    return 0;
+}
 ```