'commit'

2025-08-30 18:35:01 +08:00
commit 1f397eca87
6258 changed files with 1487241 additions and 0 deletions
--- a/TangDou/AcWingSuanFaJinJieZhiNan/.clang-format
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/.clang-format
@@ -0,0 +1,213 @@
+# 语言: None, Cpp, Java, JavaScript, ObjC, Proto, TableGen, TextProto
+Language: Cpp
+BasedOnStyle:	LLVM
+
+# 访问说明符(public、private等)的偏移
+AccessModifierOffset: -4
+
+# 开括号(开圆括号、开尖括号、开方括号)后的对齐: Align, DontAlign, AlwaysBreak(总是在开括号后换行)
+AlignAfterOpenBracket: Align
+
+# 连续赋值时，对齐所有等号
+AlignConsecutiveAssignments: false
+
+# 连续声明时，对齐所有声明的变量名
+AlignConsecutiveDeclarations: false
+
+# 右对齐逃脱换行(使用反斜杠换行)的反斜杠
+AlignEscapedNewlines: Right
+
+# 水平对齐二元和三元表达式的操作数
+AlignOperands: true
+
+# 对齐连续的尾随的注释
+AlignTrailingComments: true
+
+# 不允许函数声明的所有参数在放在下一行
+AllowAllParametersOfDeclarationOnNextLine: false
+
+# 不允许短的块放在同一行
+AllowShortBlocksOnASingleLine: true
+
+# 允许短的case标签放在同一行
+AllowShortCaseLabelsOnASingleLine: true
+
+# 允许短的函数放在同一行: None, InlineOnly(定义在类中), Empty(空函数), Inline(定义在类中，空函数), All
+AllowShortFunctionsOnASingleLine: None
+
+# 允许短的if语句保持在同一行
+AllowShortIfStatementsOnASingleLine: true
+
+# 允许短的循环保持在同一行
+AllowShortLoopsOnASingleLine: true
+
+# 总是在返回类型后换行: None, All, TopLevel(顶级函数，不包括在类中的函数), 
+# AllDefinitions(所有的定义，不包括声明), TopLevelDefinitions(所有的顶级函数的定义)
+AlwaysBreakAfterReturnType: None
+
+# 总是在多行string字面量前换行
+AlwaysBreakBeforeMultilineStrings: false
+
+# 总是在template声明后换行
+AlwaysBreakTemplateDeclarations: true
+
+# false表示函数实参要么都在同一行，要么都各自一行
+BinPackArguments: true
+
+# false表示所有形参要么都在同一行，要么都各自一行
+BinPackParameters: true
+
+# 大括号换行，只有当BreakBeforeBraces设置为Custom时才有效
+BraceWrapping:
+  # class定义后面
+  AfterClass: false
+  # 控制语句后面
+  AfterControlStatement: false
+  # enum定义后面
+  AfterEnum: false
+  # 函数定义后面
+  AfterFunction: false
+  # 命名空间定义后面
+  AfterNamespace: false
+  # struct定义后面
+  AfterStruct: false
+  # union定义后面
+  AfterUnion: false
+  # extern之后
+  AfterExternBlock: false
+  # catch之前
+  BeforeCatch: false
+  # else之前
+  BeforeElse: false
+  # 缩进大括号
+  IndentBraces: false
+  # 分离空函数
+  SplitEmptyFunction: false
+  # 分离空语句
+  SplitEmptyRecord: false
+  # 分离空命名空间
+  SplitEmptyNamespace: false
+
+# 在二元运算符前换行: None(在操作符后换行), NonAssignment(在非赋值的操作符前换行), All(在操作符前换行)
+BreakBeforeBinaryOperators: NonAssignment
+
+# 在大括号前换行: Attach(始终将大括号附加到周围的上下文), Linux(除函数、命名空间和类定义，与Attach类似), 
+#   Mozilla(除枚举、函数、记录定义，与Attach类似), Stroustrup(除函数定义、catch、else，与Attach类似), 
+#   Allman(总是在大括号前换行), GNU(总是在大括号前换行，并对于控制语句的大括号增加额外的缩进), WebKit(在函数前换行), Custom
+#   注：这里认为语句块也属于函数
+BreakBeforeBraces: Custom
+
+# 在三元运算符前换行
+BreakBeforeTernaryOperators: false
+
+# 在构造函数的初始化列表的冒号后换行
+BreakConstructorInitializers: AfterColon
+
+#BreakInheritanceList: AfterColon
+
+BreakStringLiterals: false
+
+# 每行字符的限制，0表示没有限制
+ColumnLimit: 0
+
+CompactNamespaces: true
+
+# 构造函数的初始化列表要么都在同一行，要么都各自一行
+ConstructorInitializerAllOnOneLineOrOnePerLine: false
+
+# 构造函数的初始化列表的缩进宽度
+ConstructorInitializerIndentWidth: 4
+
+# 延续的行的缩进宽度
+ContinuationIndentWidth: 4
+
+# 去除C++11的列表初始化的大括号{后和}前的空格
+Cpp11BracedListStyle: true
+
+# 继承最常用的指针和引用的对齐方式
+DerivePointerAlignment: false
+
+# 固定命名空间注释
+FixNamespaceComments: true
+
+# 缩进case标签
+IndentCaseLabels: false
+
+IndentPPDirectives: None
+
+# 缩进宽度
+IndentWidth: 4
+
+# 函数返回类型换行时，缩进函数声明或函数定义的函数名
+IndentWrappedFunctionNames: false
+
+# 保留在块开始处的空行
+KeepEmptyLinesAtTheStartOfBlocks: false
+
+# 连续空行的最大数量
+MaxEmptyLinesToKeep: 1
+
+# 命名空间的缩进: None, Inner(缩进嵌套的命名空间中的内容), All
+NamespaceIndentation: None
+
+# 指针和引用的对齐: Left, Right, Middle
+PointerAlignment: Right
+
+# 允许重新排版注释
+ReflowComments: true
+
+# 允许排序#include
+SortIncludes: false
+
+# 允许排序 using 声明
+SortUsingDeclarations: false
+
+# 在C风格类型转换后添加空格
+SpaceAfterCStyleCast: false
+
+# 在Template 关键字后面添加空格
+SpaceAfterTemplateKeyword: true
+
+# 在赋值运算符之前添加空格
+SpaceBeforeAssignmentOperators: true
+
+# SpaceBeforeCpp11BracedList: true
+
+# SpaceBeforeCtorInitializerColon: true
+
+# SpaceBeforeInheritanceColon: true
+
+# 开圆括号之前添加一个空格: Never, ControlStatements, Always
+SpaceBeforeParens: ControlStatements
+
+# SpaceBeforeRangeBasedForLoopColon: true
+
+# 在空的圆括号中添加空格
+SpaceInEmptyParentheses: false
+
+# 在尾随的评论前添加的空格数(只适用于//)
+SpacesBeforeTrailingComments: 1
+
+# 在尖括号的<后和>前添加空格
+SpacesInAngles: false
+
+# 在C风格类型转换的括号中添加空格
+SpacesInCStyleCastParentheses: false
+
+# 在容器(ObjC和JavaScript的数组和字典等)字面量中添加空格
+SpacesInContainerLiterals: true
+
+# 在圆括号的(后和)前添加空格
+SpacesInParentheses: false
+
+# 在方括号的[后和]前添加空格，lamda表达式和未指明大小的数组的声明不受影响
+SpacesInSquareBrackets: false
+
+# 标准: Cpp03, Cpp11, Auto
+Standard: Cpp11
+
+# tab宽度
+TabWidth: 4
+
+# 使用tab字符: Never, ForIndentation, ForContinuationAndIndentation, Always
+UseTab: Never
--- a/TangDou/AcWingSuanFaJinJieZhiNan/.vscode/c_cpp_properties.json
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/.vscode/c_cpp_properties.json
@@ -0,0 +1,25 @@
+{
+    "configurations": [
+      {
+        "name": "Win32",
+        "compilerArgs": [
+          "-fexec-charset=GBK"
+        ],
+        "includePath": [
+          "${workspaceFolder}/**",
+                "C:/TDM-GCC-64/lib/gcc/x86_64-w64-mingw32/10.3.0/**",
+                "C:/TDM-GCC-64/x86_64-w64-mingw32/include/**"
+              ],
+              "defines": [
+                "_DEBUG",
+                "UNICODE",
+                "_UNICODE"
+              ],
+              "compilerPath": "C:/TDM-GCC-64/bin/gcc.exe",
+              "cStandard": "c11",
+              "cppStandard": "c++17",
+              "intelliSenseMode": "gcc-x64"
+            }
+          ],
+          "version": 4
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/.vscode/extensions.json
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/.vscode/extensions.json
@@ -0,0 +1,5 @@
+{
+  "recommendations": [
+    "MS-CEINTL.vscode-language-pack-zh-hans"
+  ]
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/.vscode/launch.json
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/.vscode/launch.json
@@ -0,0 +1,28 @@
+// https://github.com/Microsoft/vscode-cpptools/blob/master/launch.md
+{
+  "version": "0.2.0",
+  "configurations": [
+    {
+      "name": "(gdb) Launch", // 配置名称，将会在启动配置的下拉菜单中显示
+      "type": "cppdbg", // 配置类型，cppdbg对应cpptools提供的调试功能；可以认为此处只能是cppdbg
+      "request": "launch", // 请求配置类型，可以为launch（启动）或attach（附加）
+      "program": "${fileDirname}\\${fileBasenameNoExtension}.exe", // 将要进行调试的程序的路径
+      "args": [], // 程序调试时传递给程序的命令行参数，一般设为空即可
+      "stopAtEntry": false, // 设为true时程序将暂停在程序入口处，相当于在main上打断点
+      "externalConsole": false,
+      "cwd": "${fileDirname}\\", // 调试程序时的工作目录，此为工作区文件夹；改成${fileDirname}可变为文件所在目录
+      "environment": [], // 环境变量
+      "internalConsoleOptions": "neverOpen", // 如果不设为neverOpen，调试时会跳到“调试控制台”选项卡，你应该不需要对gdb手动输命令吧？
+      "MIMode": "gdb", // 指定连接的调试器，可以为gdb或lldb。但我没试过lldb
+      "miDebuggerPath": "gdb.exe", // 调试器路径，Windows下后缀不能省略，Linux下则不要
+      "setupCommands": [
+        { // 模板自带，好像可以更好地显示STL容器的内容，具体作用自行Google
+          "description": "Enable pretty-printing for gdb",
+          "text": "-enable-pretty-printing",
+          "ignoreFailures": false
+        }
+      ],
+      "preLaunchTask": "Compile" // 调试会话开始前执行的任务，一般为编译程序。与tasks.json的label相对应
+    }
+  ]
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/.vscode/settings.json
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/.vscode/settings.json
@@ -0,0 +1,112 @@
+{
+    "files.defaultLanguage": "c", // ctrl+N新建文件后默认的语言
+    "editor.formatOnType": true,  // 输入分号(C/C++的语句结束标识)后自动格式化当前这一行的代码
+    "editor.suggest.snippetsPreventQuickSuggestions": false, // clangd的snippets有很多的跳转点，不用这个就必须手动触发Intellisense了
+    "editor.acceptSuggestionOnEnter": "off", // 我个人的习惯，按回车时一定是真正的换行，只有tab才会接受Intellisense
+
+    "code-runner.runInTerminal": true, // 设置成false会在“输出”中输出，无法输入    
+    "code-runner.saveFileBeforeRun": true, // run code前保存
+    "code-runner.preserveFocus": true,     // 若为false，run code后光标会聚焦到终端上。如果需要频繁输入数据可设为false
+    "code-runner.clearPreviousOutput": false, // 每次run code前清空属于code runner的终端消息，默认false
+    "code-runner.ignoreSelection": true,   // 默认为false，效果是鼠标选中一块代码后可以单独执行，但C是编译型语言，不适合这样用
+
+    "C_Cpp.clang_format_sortIncludes": true,
+    "files.associations": {
+      "array": "cpp",
+      "atomic": "cpp",
+      "*.tcc": "cpp",
+      "cctype": "cpp",
+      "clocale": "cpp",
+      "cmath": "cpp",
+      "cstdarg": "cpp",
+      "cstddef": "cpp",
+      "cstdint": "cpp",
+      "cstdio": "cpp",
+      "cstdlib": "cpp",
+      "cwchar": "cpp",
+      "cwctype": "cpp",
+      "deque": "cpp",
+      "unordered_map": "cpp",
+      "vector": "cpp",
+      "exception": "cpp",
+      "algorithm": "cpp",
+      "memory": "cpp",
+      "memory_resource": "cpp",
+      "optional": "cpp",
+      "string": "cpp",
+      "string_view": "cpp",
+      "system_error": "cpp",
+      "tuple": "cpp",
+      "type_traits": "cpp",
+      "utility": "cpp",
+      "fstream": "cpp",
+      "initializer_list": "cpp",
+      "iosfwd": "cpp",
+      "iostream": "cpp",
+      "istream": "cpp",
+      "limits": "cpp",
+      "new": "cpp",
+      "ostream": "cpp",
+      "sstream": "cpp",
+      "stdexcept": "cpp",
+      "streambuf": "cpp",
+      "typeinfo": "cpp",
+      "valarray": "cpp",
+      "cassert": "cpp",
+      "cerrno": "cpp",
+      "cfloat": "cpp",
+      "chrono": "cpp",
+      "ciso646": "cpp",
+      "climits": "cpp",
+      "complex": "cpp",
+      "csetjmp": "cpp",
+      "csignal": "cpp",
+      "cstring": "cpp",
+      "ctime": "cpp",
+      "cuchar": "cpp",
+      "numeric": "cpp",
+      "ratio": "cpp",
+      "version": "cpp",
+      "bitset": "cpp",
+      "regex": "cpp",
+      "random": "cpp",
+      "unordered_set": "cpp",
+      "list": "cpp",
+      "any": "cpp",
+      "functional": "cpp",
+      "mutex": "cpp",
+      "shared_mutex": "cpp",
+      "thread": "cpp",
+      "variant": "cpp",
+      "map": "cpp",
+      "scoped_allocator": "cpp",
+      "future": "cpp",
+      "iomanip": "cpp",
+      "forward_list": "cpp",
+      "bit": "cpp",
+      "ccomplex": "cpp",
+      "cfenv": "cpp",
+      "charconv": "cpp",
+      "cinttypes": "cpp",
+      "codecvt": "cpp",
+      "condition_variable": "cpp",
+      "cstdalign": "cpp",
+      "cstdbool": "cpp",
+      "ctgmath": "cpp",
+      "set": "cpp",
+      "iterator": "cpp",
+      "filesystem": "cpp",
+      "ios": "cpp",
+      "locale": "cpp",
+      "queue": "cpp",
+      "stack": "cpp",
+      "typeindex": "cpp",
+      "compare": "cpp",
+      "concepts": "cpp",
+      "coroutine": "cpp",
+      "numbers": "cpp",
+      "ranges": "cpp",
+      "span": "cpp",
+      "stop_token": "cpp"
+    }, // 格式化时调整include的顺序（按字母排序）
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/.vscode/tasks.json
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/.vscode/tasks.json
@@ -0,0 +1,40 @@
+// https://code.visualstudio.com/docs/editor/tasks
+{
+  "version": "2.0.0",
+  "tasks": [
+    {
+      "label": "Compile", // 任务名称，与launch.json的preLaunchTask相对应
+      "command": "g++", // 要使用的编译器，C++用g++
+      "args": [
+        "${file}",
+        "-o", // 指定输出文件名，不加该参数则默认输出a.exe，Linux下默认a.out
+        "${fileDirname}\\${fileBasenameNoExtension}.exe",
+        "-g", // 生成和调试有关的信息
+        "-Wall", // 开启额外警告
+        "-static-libgcc", // 静态链接libgcc，一般都会加上
+        "-fexec-charset=GBK", // 生成的程序使用GBK编码，不加这一条会导致Win下输出中文乱码
+        "-std=c++17", // C++最新标准为c++17，或根据自己的需要进行修改
+      ], // 编译的命令，其实相当于VSC帮你在终端中输了这些东西
+      "type": "process", // process是vsc把预定义变量和转义解析后直接全部传给command；shell相当于先打开shell再输入命令，所以args还会经过shell再解析一遍
+      "group": {
+        "kind": "build",
+        "isDefault": true // 不为true时ctrl shift B就要手动选择了
+      },
+      "presentation": {
+        "echo": true,
+        "reveal": "always", // 执行任务时是否跳转到终端面板，可以为always，silent，never。具体参见VSC的文档
+        "focus": false, // 设为true后可以使执行task时焦点聚集在终端，但对编译C/C++来说，设为true没有意义
+        "panel": "shared" // 不同的文件的编译信息共享一个终端面板
+      },
+    },
+    {
+      "label": "commit gitee",
+      "type": "shell",
+      "command": "D:\\python\\一键推拉.cmd",
+      "group": {
+        "kind": "build",
+        "isDefault": true
+      },
+    }
+  ]
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/209.cpp
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/209.cpp
@@ -0,0 +1,52 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long LL;
+const int N = 10;
+const int MOD = 10000;
+
+LL base[N][N], res[N][N];
+
+inline void mul(LL C[][N], LL A[][N], LL B[][N]) {
+    static LL tmp[N][N];
+    memset(tmp, 0, sizeof(tmp));
+    for (int i = 1; i <= 2; i++)
+        for (int j = 1; j <= 2; j++)
+            for (int k = 1; k <= 2; k++)
+                tmp[i][j] = (tmp[i][j] + (A[i][k] * B[k][j]) % MOD) % MOD;
+    memcpy(C, tmp, sizeof tmp);
+}
+
+//快速幂
+inline void qmi(LL k) {
+    //初始化结果数组的(i,i)=1
+    memset(res, 0, sizeof res);
+    res[1][1] = res[1][2] = 1;
+    while (k) {
+        if (k & 1) mul(res, res, base);
+        mul(base, base, base);
+        k >>= 1;
+    }
+}
+
+int main() {
+    LL n;
+    while (cin >> n) {
+        if (n == -1) break;
+        if (n == 0) {
+            puts("0");
+            continue;
+        }
+        if (n <= 2) {
+            puts("1");
+            continue;
+        }
+        //结果矩阵初始化
+        memset(base, 0, sizeof base);
+        base[1][1] = base[1][2] = base[2][1] = 1;
+        //快速幂
+        qmi(n - 2);
+        //结果
+        cout << (res[1][1]) % MOD << endl;
+    }
+    return 0;
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/MatrixAddDec.cpp
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/MatrixAddDec.cpp
@@ -0,0 +1,68 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long LL;
+const int N = 110;
+int n = 3;
+
+//两个n*n的矩阵
+/*
+z[][N]:结果数组
+C++中，如果传递的函数参数是数组，则理解为按地址传递，
+在函数内的修改动作将直接修改数组内容，调用者可以直接
+使用修改后的内容。
+不论是几维的多维数组，只有第一维的长度不用指定，其它都要指定。
+黄海理解一下：
+因为多维数组在内存中是连续存的，C++需要知道你给的这个指针，到哪个位置开始换行。
+*/
+void add(LL z[][N], LL x[][N], LL y[][N]) {
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= n; j++)
+            z[i][j] = x[i][j] + y[i][j];
+}
+void dec(LL z[][N], LL x[][N], LL y[][N]) {
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= n; j++)
+            z[i][j] = x[i][j] - y[i][j];
+}
+/*
+测试用例
+1 2 3
+1 2 3
+1 2 3
+
+4 5 6
+4 5 6
+4 5 6
+
+输出结果:
+5 7 9
+5 7 9
+5 7 9
+*/
+
+LL x[N][N], y[N][N], z[N][N];
+int main() {
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= n; j++)
+            cin >> x[i][j];
+
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= n; j++)
+            cin >> y[i][j];
+
+    add(z, x, y);
+    for (int i = 1; i <= n; i++) {
+        for (int j = 1; j <= n; j++)
+            cout << z[i][j] << " ";
+        cout << endl;
+    }
+
+    dec(z, x, y);
+    for (int i = 1; i <= n; i++) {
+        for (int j = 1; j <= n; j++)
+            cout << z[i][j] << " ";
+        cout << endl;
+    }
+    return 0;
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/MatrixMul.cpp
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/MatrixMul.cpp
@@ -0,0 +1,48 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long LL;
+const int N = 110;
+const int MOD = 1007;
+int n = 3;
+
+/*
+测试用例
+1 2 3
+1 2 3
+1 2 3
+
+4 5 6
+4 5 6
+4 5 6
+
+输出结果:
+24 30 36
+24 30 36
+24 30 36
+*/
+//两个n*n的矩阵
+void mul(LL z[][N], LL x[][N], LL y[][N]) {
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= n; j++)
+            for (int k = 1; k <= n; k++)
+                z[i][j] = z[i][j] % MOD + x[i][k] * y[k][j] % MOD;
+}
+LL x[N][N], y[N][N], z[N][N];
+int main() {
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= n; j++)
+            cin >> x[i][j];
+
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= n; j++)
+            cin >> y[i][j];
+
+    mul(z, x, y);
+    for (int i = 1; i <= n; i++) {
+        for (int j = 1; j <= n; j++)
+            cout << z[i][j] << " ";
+        cout << endl;
+    }
+    return 0;
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/MatrixMul_1.cpp
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/MatrixMul_1.cpp
@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+using namespace std;
+const int N = 110;
+int a[N][N], b[N][N], c[N][N];
+int n, m, p;
+int main() {
+    cin >> n >> m; //矩阵a为n*m（n行m列）
+    for (int i = 0; i < n; i++)
+        for (int j = 0; j < m; j++)
+            cin >> a[i][j];
+
+    cin >> p; //矩阵b为m*p（m行p列）
+    for (int i = 0; i < m; i++)
+        for (int j = 0; j < p; j++)
+            cin >> b[i][j];
+
+    //结果是n行p列的，所以外面两层循环是n和p
+    //最后一层循环是m，因为(n,m),(m,p),所以(i,k)一组，(k,j)一组
+    for (int i = 0; i < n; i++)     //矩阵c是a与b相乘得到的
+        for (int j = 0; j < p; j++) // n*p（n行p列）
+            for (int k = 0; k < m; k++)
+                c[i][j] += a[i][k] * b[k][j]; //乘法再sum求和
+
+    //输出
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < p; j++)
+            cout << c[i][j] << " ";
+        cout << endl;
+    }
+    return 0;
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/MatrixMul_2.cpp
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/MatrixMul_2.cpp
@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+using namespace std;
+const int N = 110;
+int a[N][N], b[N][N], c[N][N];
+int n, m, p, q;
+
+int main() {
+    cin >> n >> m;
+    for (int i = 0; i < n; i++)
+        for (int j = 0; j < m; j++)
+            cin >> a[i][j];
+
+    cin >> p >> q;
+    for (int i = 0; i < p; i++)
+        for (int j = 0; j < q; j++)
+            cin >> b[i][j];
+
+    if (m != p)
+        cout << "Error: " << m << " != " << p;
+    else {
+        cout << n << " " << q << endl;
+        for (int i = 0; i < n; i++)
+            for (int j = 0; j < q; j++)
+                for (int k = 0; k < m; k++)
+                    c[i][j] += a[i][k] * b[k][j];
+
+        for (int i = 0; i < n; i++) {
+            for (int j = 0; j < q; j++) {
+                if (j == q - 1)
+                    cout << c[i][j]; //注意每行最后一个数字后没有空格
+                else
+                    cout << c[i][j] << " ";
+            }
+            if (i != n - 1)
+                cout << endl;
+        }
+    }
+    return 0;
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/Matrix求逆.cpp
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/Matrix求逆.cpp
@@ -0,0 +1,9 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int INF = 0x3f3f3f3f;
+
+int main() {
+    //挖坑待填，好像是可以用高斯消元
+    return 0;
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/P1962.cpp
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/P1962.cpp
@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long LL;
+const int N = 10;
+const int MOD = 1e9 + 7;
+
+LL base[N][N], res[N][N];
+
+inline void mul(LL C[][N], LL A[][N], LL B[][N]) {
+    static LL tmp[N][N];
+    memset(tmp, 0, sizeof(tmp));
+    for (int i = 1; i <= 2; i++)
+        for (int j = 1; j <= 2; j++)
+            for (int k = 1; k <= 2; k++)
+                tmp[i][j] = (tmp[i][j] + (A[i][k] * B[k][j]) % MOD) % MOD;
+    memcpy(C, tmp, sizeof tmp);
+}
+
+//快速幂
+inline void qmi(LL k) {
+    //初始化结果数组的(i,i)=1
+    memset(res, 0, sizeof res);
+    res[1][1] = res[1][2] = 1;
+    while (k) {
+        if (k & 1) mul(res, res, base);
+        mul(base, base, base);
+        k >>= 1;
+    }
+}
+
+int main() {
+    LL n;
+    cin >> n;
+    if (n <= 2) {
+        puts("1");
+        return 0;
+    }
+    //结果矩阵初始化
+    memset(base, 0, sizeof base);
+    base[1][1] = base[1][2] = base[2][1] = 1;
+    //快速幂
+    qmi(n - 2);
+    //结果
+    cout << (res[1][1]) % MOD << endl;
+    return 0;
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/P1962_JZ.cpp
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/P1962_JZ.cpp
@@ -0,0 +1,53 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long LL;
+const int N = 10;
+const int MOD = 1e9 + 7;
+
+//矩阵声明
+struct JZ {
+    LL m[N][N];
+} res, base;
+
+inline JZ mul(JZ A, JZ B) {
+    JZ C;
+    memset(C.m, 0, sizeof(C.m));
+    for (int i = 1; i <= 2; i++)
+        for (int j = 1; j <= 2; j++)
+            for (int k = 1; k <= 2; k++) {
+                C.m[i][j] = (C.m[i][j] + (A.m[i][k] * B.m[k][j]) % MOD) % MOD;
+            }
+    return C;
+}
+
+//快速幂
+inline void qmi(LL k) {
+    memset(res.m, 0, sizeof res.m);
+    res.m[1][1] = res.m[1][2] = 1; // f(1)=1,f(2)=1 乘一次矩阵就是f(3),所以f(n)就是n-2次方
+    while (k) {
+        if (k & 1) res = mul(res, base);
+        base = mul(base, base);
+        k >>= 1;
+    }
+}
+int main() {
+    LL n;
+    cin >> n;
+    if (n <= 2) {
+        puts("1");
+        return 0;
+    }
+    //结果矩阵初始化
+    memset(base.m, 0, sizeof base.m);
+    base.m[1][1] = base.m[1][2] = base.m[2][1] = 1;
+    /*
+    1 1
+    1 0
+    base 矩阵
+    */
+    //快速幂
+    qmi(n - 2);
+    //结果
+    cout << (res.m[1][1]) % MOD << endl;
+    return 0;
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/P3390.cpp
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/P3390.cpp
@@ -0,0 +1,52 @@
+#include <bits/stdc++.h>
+using namespace std;
+//矩阵快速幂
+typedef long long LL;
+const int MOD = 1e9 + 7;
+const int N = 110;
+LL n, k; //本题数据范围很大，用int直接wa哭了
+LL C[N][N], A[N][N], B[N][N];
+
+//矩阵乘法
+void mul(LL C[][N], LL A[][N], LL B[][N]) {
+    //为什么非得要开一个临时的tmp来存结果呢，直接用C确实不行，原理不清楚
+    static LL tmp[N][N];
+    memset(tmp, 0, sizeof tmp);
+    for (LL i = 0; i < n; i++)
+        for (LL j = 0; j < n; j++)
+            for (LL k = 0; k < n; k++) {
+                tmp[i][j] += A[i][k] * B[k][j] % MOD; //矩阵乘法
+                tmp[i][j] %= MOD;
+            }
+    memcpy(C, tmp, sizeof tmp);
+}
+
+void qmi() {
+    //将结果矩阵初始化为单位矩阵
+    memset(B, 0, sizeof B);
+    for (int i = 0; i < n; i++) B[i][i] = 1;
+    //其实就是把整数快速幂修改为矩阵快速幂
+    while (k) { //二进制快速幂
+        if (k & 1) mul(B, B, A); // 联想一下整数快速幂
+        mul(A, A, A);            // base 翻倍
+        k >>= 1;
+    }
+}
+int main() {
+    cin >> n >> k;
+    //输入原始矩阵
+    for (int i = 0; i < n; i++)
+        for (int j = 0; j < n; j++)
+            cin >> A[i][j];
+
+    //计算矩阵快速幂
+    qmi();
+
+    //输出
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < n; j++)
+            cout << B[i][j] << " ";
+        cout << endl;
+    }
+    return 0;
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/P3390_JZ.cpp
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/P3390_JZ.cpp
@@ -0,0 +1,55 @@
+#include <bits/stdc++.h>
+using namespace std;
+//矩阵快速幂
+typedef long long LL;
+const int MOD = 1e9 + 7;
+const int N = 110;
+LL n, k; //本题数据范围很大，用int直接wa哭了
+
+//矩阵声明
+struct JZ {
+    LL m[N][N];
+} A, res, base;
+
+//矩阵乘法
+inline JZ mul(JZ A, JZ B) {
+    JZ C;
+    memset(C.m, 0, sizeof(C.m));
+    for (LL i = 0; i < n; i++)
+        for (LL j = 0; j < n; j++)
+            for (LL k = 0; k < n; k++) {
+                C.m[i][j] += (A.m[i][k] % MOD) * (B.m[k][j] % MOD);
+                C.m[i][j] %= MOD;
+            }
+    return C;
+}
+
+void qmi() {
+    //将结果矩阵初始化为单位矩阵
+    memset(res.m, 0, sizeof res.m);
+    for (int i = 0; i < n; i++) res.m[i][i] = 1;
+    //其实就是把整数快速幂修改为矩阵快速幂
+    while (k) {                       //二进制快速幂
+        if (k & 1) res = mul(res, A); // 联想一下整数快速幂
+        A = mul(A, A);                // base 翻倍
+        k >>= 1;
+    }
+}
+int main() {
+    cin >> n >> k;
+    //输入原始矩阵
+    for (int i = 0; i < n; i++)
+        for (int j = 0; j < n; j++)
+            cin >> A.m[i][j];
+
+    //计算矩阵快速幂
+    qmi();
+
+    //输出
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < n; j++)
+            cout << res.m[i][j] << " ";
+        cout << endl;
+    }
+    return 0;
+}
--- a/TangDou/AcWingSuanFaJinJieZhiNan/qmi.cpp
+++ b/TangDou/AcWingSuanFaJinJieZhiNan/qmi.cpp
@@ -0,0 +1,23 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+// https://www.jianshu.com/p/749b6ee1d001
+//栗子： 2^11 = 2 ^ (1011)2
+//就是把11拆成二进制数位，然后从右到左进行次方base的迭乘
+//在从右到左的枚举过程中，发现本位是1,就乘上本位的base
+//原来需要2*2*...*2，共10次，即O(N)
+//现在需要log以2为底11就是log_2{11} 即4次
+int qmi(int a, int k) {
+    int ans = 1;
+    while (k) {
+        if (k & 1) ans *= a;
+        a *= a; //次方base
+        k >>= 1;
+    }
+    return ans;
+}
+
+int main() {
+    cout << qmi(2, 11) << endl;
+    return 0;
+}