From f6f278c5dc45ad240cbb2d4b442967177e837a5b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=BB=84=E6=B5=B7?= <10402852@qq.com>
Date: Fri, 5 Jan 2024 16:18:18 +0800
Subject: [PATCH] 'commit'

---
 TangDou/AcWing_TiGao/T3/Floyd/345.md | 6 +++---
 TangDou/Topic/【Floyd专题】.md   | 9 ++++++++-
 2 files changed, 11 insertions(+), 4 deletions(-)

diff --git a/TangDou/AcWing_TiGao/T3/Floyd/345.md b/TangDou/AcWing_TiGao/T3/Floyd/345.md
index 4d48988..63f73c5 100644
--- a/TangDou/AcWing_TiGao/T3/Floyd/345.md
+++ b/TangDou/AcWing_TiGao/T3/Floyd/345.md
@@ -101,9 +101,9 @@ t = [ 14, 11, 14 ]
 
 矩阵乘法 **模板** 如下：
 ```cpp {.line-numbers}
-for (int k = 1; k <= COLS_A; ++k) 
-    for (int i = 1; i <= ROWS_A; ++i) 
-        for (int j = 1; j <= COLS_B; ++j) 
+for (int k = 1; k <= COLS_A; k++) 
+    for (int i = 1; i <= ROWS_A; i++) 
+        for (int j = 1; j <= COLS_B; j++) 
             t[i][j] += a[i][k] * b[k][j];
 ```
 
diff --git a/TangDou/Topic/【Floyd专题】.md b/TangDou/Topic/【Floyd专题】.md
index 2929523..7d7becb 100644
--- a/TangDou/Topic/【Floyd专题】.md
+++ b/TangDou/Topic/【Floyd专题】.md
@@ -272,6 +272,10 @@ signed main() {
     }
 }
 ```
+ **练习题**
+ #### [$AcWing$ $344$. 观光之旅](https://www.cnblogs.com/littlehb/p/16033489.html)
+
+
 ### 七、传递闭包
 #### [$HDU$-$1704$ $Rank$](https://acm.hdu.edu.cn/showproblem.php?pid=1704)
 
@@ -393,8 +397,11 @@ int main() {
     return 0;
 }
 ```
+### 九、限定边数量的情况下求多源最短路径
+
+#### [$AcWing$ $345$ 牛站](https://www.cnblogs.com/littlehb/p/16043039.html)
 
-### 九、其它习题
+### 十、其它习题
 
 #### $SSL-1760$（商店选址）
 **题目**