完成题目。

Author: alexc

.gitignore

@@ -32,6 +32,6 @@
 *.app
 
 build/
-CMakeLists.txt
 .vscode
 cmake-build-debug
+.idea

.vscode/settings.json

@@ -1,6 +1,70 @@
 {
     "files.associations": {
         "iostream": "cpp",
-        "ostream": "cpp"
+        "ostream": "cpp",
+        "string": "cpp",
+        "iosfwd": "cpp",
+        "__bit_reference": "cpp",
+        "__config": "cpp",
+        "__debug": "cpp",
+        "__errc": "cpp",
+        "__functional_base": "cpp",
+        "__hash_table": "cpp",
+        "__locale": "cpp",
+        "__mutex_base": "cpp",
+        "__node_handle": "cpp",
+        "__nullptr": "cpp",
+        "__split_buffer": "cpp",
+        "__string": "cpp",
+        "__threading_support": "cpp",
+        "__tree": "cpp",
+        "__tuple": "cpp",
+        "algorithm": "cpp",
+        "array": "cpp",
+        "atomic": "cpp",
+        "bit": "cpp",
+        "bitset": "cpp",
+        "cctype": "cpp",
+        "chrono": "cpp",
+        "clocale": "cpp",
+        "cmath": "cpp",
+        "complex": "cpp",
+        "cstdarg": "cpp",
+        "cstddef": "cpp",
+        "cstdint": "cpp",
+        "cstdio": "cpp",
+        "cstdlib": "cpp",
+        "cstring": "cpp",
+        "ctime": "cpp",
+        "cwchar": "cpp",
+        "cwctype": "cpp",
+        "exception": "cpp",
+        "functional": "cpp",
+        "initializer_list": "cpp",
+        "iomanip": "cpp",
+        "ios": "cpp",
+        "istream": "cpp",
+        "iterator": "cpp",
+        "limits": "cpp",
+        "list": "cpp",
+        "locale": "cpp",
+        "map": "cpp",
+        "memory": "cpp",
+        "mutex": "cpp",
+        "new": "cpp",
+        "optional": "cpp",
+        "ratio": "cpp",
+        "sstream": "cpp",
+        "stdexcept": "cpp",
+        "streambuf": "cpp",
+        "string_view": "cpp",
+        "system_error": "cpp",
+        "tuple": "cpp",
+        "type_traits": "cpp",
+        "typeinfo": "cpp",
+        "unordered_map": "cpp",
+        "utility": "cpp",
+        "vector": "cpp",
+        "fstream": "cpp"
     }
 }

.vscode/tasks.json

@@ -13,10 +13,7 @@
                 "build/${fileBasenameNoExtension}.out",
                 "--debug"
             ],
-            "group": {
-                "kind": "build",
-                "isDefault": true
-            },
+            "group": "build",
             "presentation": {
                 "echo": true,
                 "reveal": "silent",
@@ -25,6 +22,28 @@
                 "showReuseMessage": true,
                 "clear": false
             }
+        },
+        {
+            "type": "cppbuild",
+            "label": "C/C++: clang++ 生成活动文件",
+            "command": "/usr/bin/clang++",
+            "args": [
+                "-g",
+                "${file}",
+                "-o",
+                "${fileDirname}/${fileBasenameNoExtension}"
+            ],
+            "options": {
+                "cwd": "${fileDirname}"
+            },
+            "problemMatcher": [
+                "$gcc"
+            ],
+            "group": {
+                "kind": "build",
+                "isDefault": true
+            },
+            "detail": "调试器生成的任务。"
         }
     ]
 }

beads.cpp

@@ -0,0 +1,30 @@
+/*
+ID: geekr1
+TASK: beads
+LANG: C++
+*/
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+char neckless[350];
+
+int main()
+{
+    int size;
+    cin >> size;
+    cout << "size=" << size << endl;
+
+    for (int i = 0; i <= size; i++)
+    {
+        char c = getchar();
+        if(c == ' ')
+            continue;
+
+        neckless[i] = c;
+        cout << neckless[i] << endl;
+    }
+
+    return 0;
+}

matrix_add.cpp

@@ -0,0 +1,29 @@
+// 矩阵加法
+#include <iostream>
+
+using namespace std;
+
+int main() 
+{
+    int a[3][4], b[3][4];
+    for (int i = 0; i < 3;i++ ) {
+        for (int j = 0; j < 4;j++) {
+            cin >> a[i][j];
+        }
+    }
+
+    for (int i = 0; i < 3; i++) {
+        for (int j = 0; j < 4; j++) {
+            cin >> b[i][j];
+        }
+    }
+
+    for (int i = 0; i < 3; i++) {
+        for (int j = 0; j < 4; j++) {
+            cout << a[i][j] + b[i][j] << " ";
+        }
+        cout << endl;
+    }
+
+    return 0;
+}

matrix_snake.cpp

@@ -0,0 +1,59 @@
+// http://oj.ryipedu.com/problem.php?id=1245 
+// 打印蛇形矩阵 (样例显示其实是一个回形矩阵、环形矩阵)
+#include <iostream>
+#include <iomanip>
+
+using namespace std;
+
+const int N = 100;
+int a[N][N];
+
+int main()
+{
+    int n;      // 矩阵的维度
+    cin >> n;
+
+    int index,  // 每个格子的编号
+        i,      // 行号
+        j;      // 列号
+    i = j = 0;
+    index = 1; 
+
+    // 模拟回形矩阵的生成过程
+    while (index <= n*n)
+    {
+        // 从左到右生成一行
+        while(a[i][j] == 0 && j < n)
+            a[i][j++] = index++;
+        i++; // 下移一行
+        j--; // 回退一格
+
+        // 从上到下生成一列
+        while (a[i][j] == 0 && i < n)
+            a[i++][j] = index++;
+        i--;
+        j--;
+
+        // 从右到左生成一行
+        while(a[i][j] == 0 && j >= 0)
+            a[i][j--] = index++;
+        i--;
+        j++;
+
+        // 从下到上生成一列
+        while(a[i][j] == 0 && i >= 0)
+            a[i--][j] = index++;
+        i++;
+        j++;
+    }
+
+    // 输出矩阵
+    for (i = 0; i < n; i++) {
+        for (j = 0; j < n;j++){
+            cout <<setw(3)<< a[i][j] << " ";
+        }
+        cout << endl;
+    }
+
+    return 0;
+}

matrix_top_right_down.cpp

@@ -0,0 +1,39 @@
+// 折角矩阵。从左到右、再从上到下。
+#include <iostream>
+#include <iomanip>
+
+using namespace std;
+
+int main()
+{
+    int n, a[20][20];
+    cin >> n;
+
+    int v = 1;
+    // 逐行输出。每行分成左右两部分
+    for (int i = 0; i < n; i++)
+    {
+        // 输出左半部分
+        int j = 0;
+        for (; j < (n - i); j++)
+        {
+            a[i][j] = v++;
+            cout << setw(4) << a[i][j];
+        }
+
+        // 输出右半部分
+        for (; j < n; j++)
+        {
+            // 前一行相同列的元素+1
+            a[i][j] = a[i - 1][j] + 1;
+            cout << setw(4) << a[i][j];
+        }
+
+        // 换行
+        cout << endl;
+        // 调整 v 的取值
+        v = v + n - i - 1;
+    }
+
+    return 0;
+}

maxtrix_sort.cpp

@@ -0,0 +1,86 @@
+#include <iostream>
+#include <math.h>
+
+using namespace std;
+
+int main()
+{
+    int m, n; // m 是行，n 是列
+    cin >> m >> n;
+
+    // 二维数组存放的身高数据
+    int h[10][10]; 
+    for (int i = 0; i < m; i++)
+    {
+        for (int j = 0; j < n; j++)
+        {
+            cin >> h[i][j];
+        }
+    }
+
+    // 所有同学的身高一维数组，最多就是 10*10=100个同学
+    int a[100];
+    // 一维数组的下标从0开始
+    int a_index = 0;
+    // 所有身高的和，用来计算平均身高
+    int total_height = 0;
+
+    // 遍历输入的二维数组
+    // 注意：两重循环是先遍历列、再遍历行，即 n、m 对调，并且 j、i 对调
+    for (int i = 0; i < n; i++)
+    {
+        int column_max = 0; // 列最大身高
+        for (int j = 0; j < m; j++)
+        {
+            int current = h[j][i];
+            
+            a[a_index++] = current;  // 转成一维数组，注意 a_index++ 表示赋值后下标往后移动
+            total_height += current; // 累加所有人的身高
+
+            if (current > column_max)
+            {
+                column_max = current;
+            }
+        }
+        // 1. 输出每一列的最大值
+        cout << column_max << endl;
+    }
+
+    // 2. 对所有身高进行排序，简单冒泡
+    for (int i = 0; i < m * n; i++)
+    {
+        for (int j = 0; j < m * n; j++)
+        {
+            // 从高到低
+            if(a[j] < a[i]) {
+                // 交换 a[i] a[j]
+                int ai = a[i];
+                a[i] = a[j];
+                a[j] = ai;
+            }
+        }
+    }
+    // 从高到低，在一行内输出所有身高
+    for (int i = 0; i < m * n; i++){
+        cout << a[i] << " ";
+    }
+    cout << endl;
+
+    // 3.求平均身高并输出
+    // round 是四舍五入向上取整的标准库函数
+    // 乘1.0是为了把整数变成浮点数，这样除以同学的人数时，才有小数点
+    int average = round((total_height * 1.0) / (m * n));
+    cout << average << endl;
+
+    // 4. 输出不小于平均身高的同学人数
+    int count = 0;
+    for (int i = 0; i < m * n; i++)
+    {
+        if(a[i] >= average){
+            count++;
+        }
+    }
+    cout << count << endl;
+
+    return 0;
+}