From f3dd6ec96453b1c74a132b53748b32843801a6d6 Mon Sep 17 00:00:00 2001
From: thinklive1 <469631989@qq.com>
Date: Mon, 16 Oct 2023 23:17:10 +0800
Subject: [PATCH] Site updated: 2023-10-16 23:17:09

---
 .../index.html"                               |   6 +-
 .../28/\347\247\230\345\257\2061/index.html"  |   6 +-
 .../61a\346\200\273\345\222\214/index.html"   |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 2023/09/29/jupyter notebook/index.html        |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../30/\346\235\200\346\211\21347/index.html" |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 2023/10/09/numpy/index.html                   |   6 +-
 2023/10/12/sysadmin/index.html                |   6 +-
 .../index.html"                               |  71 ++-
 .../index.html"                               |   6 +-
 .../14/\350\256\241\347\275\221/index.html"   |  10 +-
 2023/10/15/houses/index.html                  |  23 +-
 .../index.html"                               | 492 ++++++++++++++++++
 about/index.html                              |   6 +-
 archives/2023/09/index.html                   |   8 +-
 archives/2023/09/page/2/index.html            |   8 +-
 archives/2023/09/page/3/index.html            |   8 +-
 archives/2023/10/index.html                   |  30 +-
 archives/2023/index.html                      |  50 +-
 archives/2023/page/2/index.html               |  48 +-
 archives/2023/page/3/index.html               |  48 +-
 archives/2023/page/4/index.html               |  28 +-
 archives/index.html                           |  50 +-
 archives/page/2/index.html                    |  48 +-
 archives/page/3/index.html                    |  48 +-
 archives/page/4/index.html                    |  28 +-
 .../20230519142006.png"                       | Bin
 .../20230519142707.png"                       | Bin
 .../image-20231016191822017.png"              | Bin 0 -> 39885 bytes
 .../image-20231016192215938.png"              | Bin 0 -> 36775 bytes
 .../image-20231016200400451.png"              | Bin 0 -> 50928 bytes
 categories/index.html                         |   6 +-
 .../index.html"                               |   6 +-
 .../black-souls/index.html"                   |   6 +-
 .../index.html"                               |   6 +-
 .../wrpg/index.html"                          |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../\347\247\230\345\257\206/index.html"      |   6 +-
 .../index.html"                               |   8 +-
 .../page/2/index.html"                        |   6 +-
 .../\345\205\266\344\273\226/index.html"      |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   8 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../\350\256\241\347\273\204/index.html"      |   6 +-
 .../index.html"                               |   6 +-
 guestbook/index.html                          |   6 +-
 index.html                                    | 162 +++---
 page/2/index.html                             | 118 +++--
 page/3/index.html                             | 102 ++--
 page/4/index.html                             | 103 ++--
 page/5/index.html                             | 104 ++--
 page/6/index.html                             |  97 ++--
 page/7/index.html                             | 118 ++++-
 photos/index.html                             |   6 +-
 search.xml                                    |  83 ++-
 tags/JAVA/index.html                          |   6 +-
 tags/black-souls/index.html                   |   6 +-
 tags/c/index.html                             |   6 +-
 tags/hexo/index.html                          |   6 +-
 tags/hitman/index.html                        |   6 +-
 tags/icarus/index.html                        |   6 +-
 tags/index.html                               |   6 +-
 tags/linux/index.html                         |   6 +-
 tags/next/index.html                          |   6 +-
 tags/not-for-broadcast/index.html             |   6 +-
 tags/pandas/index.html                        |   8 +-
 tags/python/index.html                        |   8 +-
 tags/vim/index.html                           |   6 +-
 tags/webstack/index.html                      |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   8 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   8 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 "tags/\347\247\230\345\257\206/index.html"    |   6 +-
 "tags/\347\256\227\346\263\225/index.html"    |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   8 +-
 .../page/2/index.html"                        |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 .../index.html"                               |   6 +-
 thanks/index.html                             |   6 +-
 117 files changed, 1606 insertions(+), 821 deletions(-)
 create mode 100644 "2023/10/16/mit6.006\346\200\273\345\222\214\347\254\224\350\256\2601/index.html"
 rename images/obsidian/20230519142006.png => "assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/20230519142006.png" (100%)
 rename images/obsidian/20230519142707.png => "assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/20230519142707.png" (100%)
 create mode 100644 "assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/image-20231016191822017.png"
 create mode 100644 "assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/image-20231016192215938.png"
 create mode 100644 "assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/image-20231016200400451.png"

diff --git "a/2023/09/17/thinklive\347\232\204\350\277\252\347\221\236\345\205\213\346\213\211\345\233\276\344\271\246\351\246\206/index.html" "b/2023/09/17/thinklive\347\232\204\350\277\252\347\221\236\345\205\213\346\213\211\345\233\276\344\271\246\351\246\206/index.html"
index bf417a5a7..6390365b2 100644
--- "a/2023/09/17/thinklive\347\232\204\350\277\252\347\221\236\345\205\213\346\213\211\345\233\276\344\271\246\351\246\206/index.html"
+++ "b/2023/09/17/thinklive\347\232\204\350\277\252\347\221\236\345\205\213\346\213\211\345\233\276\344\271\246\351\246\206/index.html"
@@ -196,7 +196,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -390,13 +390,13 @@ <h2 id="更新日志"><a href="#更新日志" class="headerlink" title="更新
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/28/\347\247\230\345\257\2061/index.html" "b/2023/09/28/\347\247\230\345\257\2061/index.html"
index 074bd4367..95a9edfd2 100644
--- "a/2023/09/28/\347\247\230\345\257\2061/index.html"
+++ "b/2023/09/28/\347\247\230\345\257\2061/index.html"
@@ -196,7 +196,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -391,13 +391,13 @@ <h1 class="post-title" itemprop="name headline">
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/61a\346\200\273\345\222\214/index.html" "b/2023/09/29/61a\346\200\273\345\222\214/index.html"
index 042b261c3..bacbf5a1f 100644
--- "a/2023/09/29/61a\346\200\273\345\222\214/index.html"
+++ "b/2023/09/29/61a\346\200\273\345\222\214/index.html"
@@ -202,7 +202,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -690,13 +690,13 @@ <h3 id="生成器生成树的搜索路径"><a href="#生成器生成树的搜索
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/black souls\344\272\272\347\211\251\350\247\243\346\236\220/index.html" "b/2023/09/29/black souls\344\272\272\347\211\251\350\247\243\346\236\220/index.html"
index 7b2ed123b..dab6dcb2b 100644
--- "a/2023/09/29/black souls\344\272\272\347\211\251\350\247\243\346\236\220/index.html"	
+++ "b/2023/09/29/black souls\344\272\272\347\211\251\350\247\243\346\236\220/index.html"	
@@ -198,7 +198,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -395,13 +395,13 @@ <h1 id="玛丽苏"><a href="#玛丽苏" class="headerlink" title="玛丽苏"></a
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/black souls\345\211\247\346\203\205\350\247\243\346\236\220/index.html" "b/2023/09/29/black souls\345\211\247\346\203\205\350\247\243\346\236\220/index.html"
index 85e7b8127..fd5226e9f 100644
--- "a/2023/09/29/black souls\345\211\247\346\203\205\350\247\243\346\236\220/index.html"	
+++ "b/2023/09/29/black souls\345\211\247\346\203\205\350\247\243\346\236\220/index.html"	
@@ -198,7 +198,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -393,13 +393,13 @@ <h1 class="post-title" itemprop="name headline">
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/blacksouls\345\216\237\350\221\227\346\242\227\350\247\243\346\236\220/index.html" "b/2023/09/29/blacksouls\345\216\237\350\221\227\346\242\227\350\247\243\346\236\220/index.html"
index 2dec8becf..0b78843a7 100644
--- "a/2023/09/29/blacksouls\345\216\237\350\221\227\346\242\227\350\247\243\346\236\220/index.html"
+++ "b/2023/09/29/blacksouls\345\216\237\350\221\227\346\242\227\350\247\243\346\236\220/index.html"
@@ -198,7 +198,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -409,13 +409,13 @@ <h1 id="ex02"><a href="#ex02" class="headerlink" title="ex02"></a>ex02</h1><p>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/cs106b\346\200\273\345\222\214\347\254\224\350\256\260/index.html" "b/2023/09/29/cs106b\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
index efed1ef10..739eede11 100644
--- "a/2023/09/29/cs106b\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
+++ "b/2023/09/29/cs106b\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
@@ -206,7 +206,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -463,13 +463,13 @@ <h3 id="汉诺塔递归"><a href="#汉诺塔递归" class="headerlink" title="
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/cs106l\346\200\273\345\222\214\347\254\224\350\256\260/index.html" "b/2023/09/29/cs106l\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
index 929fb59c5..c69a0235a 100644
--- "a/2023/09/29/cs106l\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
+++ "b/2023/09/29/cs106l\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
@@ -214,7 +214,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -441,13 +441,13 @@ <h3 id="涉及的c-特性"><a href="#涉及的c-特性" class="headerlink" title
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/2023/09/29/jupyter notebook/index.html b/2023/09/29/jupyter notebook/index.html
index 7282ef5bd..de24a0130 100644
--- a/2023/09/29/jupyter notebook/index.html	
+++ b/2023/09/29/jupyter notebook/index.html	
@@ -206,7 +206,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -474,13 +474,13 @@ <h3 id="slides实例"><a href="#slides实例" class="headerlink" title="slides
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/linux\346\200\273\345\222\214\347\254\224\350\256\260/index.html" "b/2023/09/29/linux\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
index e5e3f01f9..935a3db75 100644
--- "a/2023/09/29/linux\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
+++ "b/2023/09/29/linux\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
@@ -204,7 +204,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -696,13 +696,13 @@ <h3 id="还有更多的-Vim-小窍门吗？"><a href="#还有更多的-Vim-小
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/vim\346\200\273\345\222\214\347\254\224\350\256\260/index.html" "b/2023/09/29/vim\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
index f5e610edf..cc6d5c30b 100644
--- "a/2023/09/29/vim\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
+++ "b/2023/09/29/vim\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
@@ -203,7 +203,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -467,13 +467,13 @@ <h2 id="进阶"><a href="#进阶" class="headerlink" title="进阶"></a>进阶</
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/\346\223\215\344\275\234\347\263\273\347\273\237\346\200\273\345\222\214\347\254\224\350\256\260/index.html" "b/2023/09/29/\346\223\215\344\275\234\347\263\273\347\273\237\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
index 4876ac4a0..61391e1d4 100644
--- "a/2023/09/29/\346\223\215\344\275\234\347\263\273\347\273\237\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
+++ "b/2023/09/29/\346\223\215\344\275\234\347\263\273\347\273\237\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
@@ -208,7 +208,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -844,13 +844,13 @@ <h3 id="访问控制权限和分组"><a href="#访问控制权限和分组" clas
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/\347\241\254\344\273\266\346\200\273\345\222\214\347\254\224\350\256\260/index.html" "b/2023/09/29/\347\241\254\344\273\266\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
index 5659aa19a..3ca195087 100644
--- "a/2023/09/29/\347\241\254\344\273\266\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
+++ "b/2023/09/29/\347\241\254\344\273\266\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
@@ -206,7 +206,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -466,13 +466,13 @@ <h3 id="外部存储器（辅助存储器"><a href="#外部存储器（辅助存
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211rpg\350\256\276\345\256\232\351\233\206/index.html" "b/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211rpg\350\256\276\345\256\232\351\233\206/index.html"
index b38f0c855..687468bfb 100644
--- "a/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211rpg\350\256\276\345\256\232\351\233\206/index.html"
+++ "b/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211rpg\350\256\276\345\256\232\351\233\206/index.html"
@@ -197,7 +197,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -392,13 +392,13 @@ <h1 id="npc"><a href="#npc" class="headerlink" title="npc"></a>npc</h1><h2 id="
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211\344\270\226\347\225\214\350\247\202/index.html" "b/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211\344\270\226\347\225\214\350\247\202/index.html"
index f2f7e26ad..d49b3f47c 100644
--- "a/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211\344\270\226\347\225\214\350\247\202/index.html"
+++ "b/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211\344\270\226\347\225\214\350\247\202/index.html"
@@ -197,7 +197,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -426,13 +426,13 @@ <h2 id="帕斯卡王国"><a href="#帕斯卡王国" class="headerlink" title="
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211\350\275\266\344\272\213\351\233\206/index.html" "b/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211\350\275\266\344\272\213\351\233\206/index.html"
index 5f6186b4c..cbfeafb2c 100644
--- "a/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211\350\275\266\344\272\213\351\233\206/index.html"
+++ "b/2023/09/29/\350\277\252\347\221\236\345\205\213\346\213\211\350\275\266\344\272\213\351\233\206/index.html"
@@ -197,7 +197,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -432,13 +432,13 @@ <h2 id="度量"><a href="#度量" class="headerlink" title="度量"></a>度量</
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/30/\344\270\215\344\272\210\346\222\255\345\207\272/index.html" "b/2023/09/30/\344\270\215\344\272\210\346\222\255\345\207\272/index.html"
index 4b93a459c..32f639b73 100644
--- "a/2023/09/30/\344\270\215\344\272\210\346\222\255\345\207\272/index.html"
+++ "b/2023/09/30/\344\270\215\344\272\210\346\222\255\345\207\272/index.html"
@@ -197,7 +197,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -393,13 +393,13 @@ <h1 class="post-title" itemprop="name headline">
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/30/\345\267\253\345\270\210\344\272\214/index.html" "b/2023/09/30/\345\267\253\345\270\210\344\272\214/index.html"
index 24883cdad..ba0c21556 100644
--- "a/2023/09/30/\345\267\253\345\270\210\344\272\214/index.html"
+++ "b/2023/09/30/\345\267\253\345\270\210\344\272\214/index.html"
@@ -197,7 +197,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -392,13 +392,13 @@ <h1 class="post-title" itemprop="name headline">
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/30/\345\275\261\345\255\220\345\267\245\345\216\202/index.html" "b/2023/09/30/\345\275\261\345\255\220\345\267\245\345\216\202/index.html"
index 3c7b523fb..ed24ada76 100644
--- "a/2023/09/30/\345\275\261\345\255\220\345\267\245\345\216\202/index.html"
+++ "b/2023/09/30/\345\275\261\345\255\220\345\267\245\345\216\202/index.html"
@@ -197,7 +197,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -392,13 +392,13 @@ <h1 class="post-title" itemprop="name headline">
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/30/\346\235\200\346\211\21347/index.html" "b/2023/09/30/\346\235\200\346\211\21347/index.html"
index ebf0497af..d97fe677c 100644
--- "a/2023/09/30/\346\235\200\346\211\21347/index.html"
+++ "b/2023/09/30/\346\235\200\346\211\21347/index.html"
@@ -197,7 +197,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -392,13 +392,13 @@ <h1 class="post-title" itemprop="name headline">
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/30/\346\255\245\350\241\214\346\250\241\346\213\237\345\231\250/index.html" "b/2023/09/30/\346\255\245\350\241\214\346\250\241\346\213\237\345\231\250/index.html"
index 5dd7708c8..87fecbac3 100644
--- "a/2023/09/30/\346\255\245\350\241\214\346\250\241\346\213\237\345\231\250/index.html"
+++ "b/2023/09/30/\346\255\245\350\241\214\346\250\241\346\213\237\345\231\250/index.html"
@@ -197,7 +197,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -392,13 +392,13 @@ <h1 class="post-title" itemprop="name headline">
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/30/\346\270\270\346\210\217\347\256\200\350\257\204/index.html" "b/2023/09/30/\346\270\270\346\210\217\347\256\200\350\257\204/index.html"
index 398c984a3..31dc71c6a 100644
--- "a/2023/09/30/\346\270\270\346\210\217\347\256\200\350\257\204/index.html"
+++ "b/2023/09/30/\346\270\270\346\210\217\347\256\200\350\257\204/index.html"
@@ -197,7 +197,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -391,13 +391,13 @@ <h1 class="post-title" itemprop="name headline">
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/09/30/\351\276\231\350\205\276\344\270\226\347\272\252/index.html" "b/2023/09/30/\351\276\231\350\205\276\344\270\226\347\272\252/index.html"
index 6dd203174..ecc7e318e 100644
--- "a/2023/09/30/\351\276\231\350\205\276\344\270\226\347\272\252/index.html"
+++ "b/2023/09/30/\351\276\231\350\205\276\344\270\226\347\272\252/index.html"
@@ -198,7 +198,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -397,13 +397,13 @@ <h1 id="dai"><a href="#dai" class="headerlink" title="dai"></a>dai</h1><p>今天
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/10/05/cpp primer plus\346\200\273\345\222\214/index.html" "b/2023/10/05/cpp primer plus\346\200\273\345\222\214/index.html"
index 9d12ab788..f8c44cd49 100644
--- "a/2023/10/05/cpp primer plus\346\200\273\345\222\214/index.html"	
+++ "b/2023/10/05/cpp primer plus\346\200\273\345\222\214/index.html"	
@@ -198,7 +198,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -459,13 +459,13 @@ <h3 id="匿名函数"><a href="#匿名函数" class="headerlink" title="匿名
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/10/05/\345\273\272\347\253\231\346\214\207\345\214\227/index.html" "b/2023/10/05/\345\273\272\347\253\231\346\214\207\345\214\227/index.html"
index ecf06c847..90b7f659b 100644
--- "a/2023/10/05/\345\273\272\347\253\231\346\214\207\345\214\227/index.html"
+++ "b/2023/10/05/\345\273\272\347\253\231\346\214\207\345\214\227/index.html"
@@ -200,7 +200,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -534,13 +534,13 @@ <h3 id="js动效"><a href="#js动效" class="headerlink" title="js动效"></a>js
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/10/06/61b\346\200\273\345\222\214\347\254\224\350\256\260/index.html" "b/2023/10/06/61b\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
index 2ae4ba00b..b91895b85 100644
--- "a/2023/10/06/61b\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
+++ "b/2023/10/06/61b\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
@@ -223,7 +223,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -533,13 +533,13 @@ <h1 id="作业中的实现（待续）"><a href="#作业中的实现（待续）
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/2023/10/09/numpy/index.html b/2023/10/09/numpy/index.html
index 1c2033f6f..81c0952a5 100644
--- a/2023/10/09/numpy/index.html
+++ b/2023/10/09/numpy/index.html
@@ -201,7 +201,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -446,13 +446,13 @@ <h3 id="广播"><a href="#广播" class="headerlink" title="广播"></a>广播</
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/2023/10/12/sysadmin/index.html b/2023/10/12/sysadmin/index.html
index 423e1e161..b91e05cda 100644
--- a/2023/10/12/sysadmin/index.html
+++ b/2023/10/12/sysadmin/index.html
@@ -207,7 +207,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -856,13 +856,13 @@ <h1 id="一些小脚本"><a href="#一些小脚本" class="headerlink" title="
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/10/14/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/index.html" "b/2023/10/14/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
index 50fa92e2c..073a773e2 100644
--- "a/2023/10/14/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
+++ "b/2023/10/14/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/index.html"
@@ -27,15 +27,16 @@
 
 <script class="next-config" data-name="main" type="application/json">{"hostname":"thinklive1.github.io","root":"/","images":"/images","scheme":"Gemini","darkmode":false,"version":"8.18.1","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12},"copycode":{"enable":true,"style":"flat"},"fold":{"enable":false,"height":500},"bookmark":{"enable":true,"color":"#369","save":"auto"},"mediumzoom":false,"lazyload":false,"pangu":true,"comments":{"style":"tabs","active":"utterances","storage":true,"lazyload":false,"nav":null,"activeClass":"utterances"},"stickytabs":false,"motion":{"enable":true,"async":false,"transition":{"menu_item":"fadeInDown","post_block":"fadeIn","post_header":"fadeInDown","post_body":"fadeInDown","coll_header":"fadeInLeft","sidebar":"fadeInUp"}},"prism":false,"i18n":{"placeholder":"搜索...","empty":"没有找到任何搜索结果：${query}","hits_time":"找到 ${hits} 个搜索结果（用时 ${time} 毫秒）","hits":"找到 ${hits} 个搜索结果"},"path":"/search.xml","localsearch":{"enable":true,"trigger":"auto","top_n_per_article":1,"unescape":false,"preload":false}}</script><script src="/js/config.js"></script>
 
-    <meta name="description" content="算法性质循环不变式主要用来帮助我们理解算法的正确性。关千循环不变式，我们必须证明三条性质：初始化：循环的第一次迭代之前，它为真。保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正确的。">
+    <meta name="description" content="基础数据结构 算法性质循环不变式主要用来帮助我们理解算法的正确性。关千循环不变式，我们必须证明三条性质：初始化：循环的第一次迭代之前，它为真。保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正确的。">
 <meta property="og:type" content="article">
 <meta property="og:title" content="基于mit6.006的算法笔记(待续)">
 <meta property="og:url" content="https://thinklive1.github.io/2023/10/14/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/index.html">
 <meta property="og:site_name" content="thinklive">
-<meta property="og:description" content="算法性质循环不变式主要用来帮助我们理解算法的正确性。关千循环不变式，我们必须证明三条性质：初始化：循环的第一次迭代之前，它为真。保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正确的。">
+<meta property="og:description" content="基础数据结构 算法性质循环不变式主要用来帮助我们理解算法的正确性。关千循环不变式，我们必须证明三条性质：初始化：循环的第一次迭代之前，它为真。保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正确的。">
 <meta property="og:locale" content="zh_CN">
-<meta property="og:image" content="https://thinklive1.github.io/images/obsidian/202305191420061.png">
-<meta property="og:image" content="https://thinklive1.github.io/images/obsidian/20230519142707.png">
+<meta property="og:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016191822017.png">
+<meta property="og:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/20230519142006.png">
+<meta property="og:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/20230519142707.png">
 <meta property="og:image" content="https://thinklive1.github.io/images/obsidian/20230519150021.png">
 <meta property="og:image" content="https://thinklive1.github.io/images/obsidian/20230522140116.png">
 <meta property="og:image" content="https://thinklive1.github.io/images/obsidian/20230522140235.png">
@@ -44,15 +45,17 @@
 <meta property="og:image" content="https://thinklive1.github.io/images/obsidian/202305232137541.png">
 <meta property="og:image" content="https://thinklive1.github.io/images/obsidian/202305242150561.png">
 <meta property="og:image" content="https://thinklive1.github.io/images/obsidian/202305221035071.png">
+<meta property="og:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016192215938.png">
 <meta property="og:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231014112423645.png">
+<meta property="og:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016200400451.png">
 <meta property="article:published_time" content="2023-10-14T12:31:46.082Z">
-<meta property="article:modified_time" content="2023-10-14T12:47:51.752Z">
+<meta property="article:modified_time" content="2023-10-16T15:15:56.243Z">
 <meta property="article:author" content="thinklive">
 <meta property="article:tag" content="课程笔记">
 <meta property="article:tag" content="麻省理工">
 <meta property="article:tag" content="算法">
 <meta name="twitter:card" content="summary">
-<meta name="twitter:image" content="https://thinklive1.github.io/images/obsidian/202305191420061.png">
+<meta name="twitter:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016191822017.png">
 
 
 <link rel="canonical" href="https://thinklive1.github.io/2023/10/14/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
@@ -196,7 +199,7 @@
       <div class="sidebar-panel-container">
         <!--noindex-->
         <div class="post-toc-wrap sidebar-panel">
-            <div class="post-toc animated"><ol class="nav"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E7%AE%97%E6%B3%95%E6%80%A7%E8%B4%A8"><span class="nav-number">1.</span> <span class="nav-text">算法性质</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%88%86%E6%B2%BB%E4%B8%8E%E9%80%92%E5%BD%92"><span class="nav-number"></span> <span class="nav-text">分治与递归</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%AE%9E%E4%BE%8B"><span class="nav-number">1.</span> <span class="nav-text">实例</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E5%BD%92%E5%B9%B6%E6%8E%92%E5%BA%8F"><span class="nav-number">1.1.</span> <span class="nav-text">归并排序</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E5%AF%BB%E5%B3%B0%E7%AE%97%E6%B3%95"><span class="nav-number">1.2.</span> <span class="nav-text">寻峰算法</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%BB%A3%E5%85%A5%E6%B3%95%E6%B1%82%E8%A7%A3%E9%80%92%E5%BD%92%E5%BC%8F"><span class="nav-number">2.</span> <span class="nav-text">代入法求解递归式</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E9%80%92%E5%BD%92%E6%A0%91%E6%B3%95"><span class="nav-number">3.</span> <span class="nav-text">递归树法</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%BB%E6%96%B9%E6%B3%95%E6%B1%82%E8%A7%A3%E9%80%92%E5%BD%92%E5%BC%8F"><span class="nav-number">4.</span> <span class="nav-text">主方法求解递归式</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E6%AF%94%E8%BE%83%E6%8E%92%E5%BA%8F"><span class="nav-number"></span> <span class="nav-text">比较排序</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%A0%86%E6%8E%92%E5%BA%8F"><span class="nav-number">1.</span> <span class="nav-text">堆排序</span></a></li></ol></div>
+            <div class="post-toc animated"><ol class="nav"><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%9F%BA%E7%A1%80"><span class="nav-number">1.</span> <span class="nav-text">基础</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84"><span class="nav-number">1.1.</span> <span class="nav-text">数据结构</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E7%AE%97%E6%B3%95%E6%80%A7%E8%B4%A8"><span class="nav-number">1.2.</span> <span class="nav-text">算法性质</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%88%86%E6%B2%BB%E6%B3%95%EF%BC%88%E9%80%92%E5%BD%92%EF%BC%89"><span class="nav-number">1.3.</span> <span class="nav-text">分治法（递归）</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E9%80%89%E6%8B%A9%E6%8E%92%E5%BA%8F"><span class="nav-number">1.3.1.</span> <span class="nav-text">选择排序</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F"><span class="nav-number">1.3.2.</span> <span class="nav-text">插入排序</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E5%BD%92%E5%B9%B6%E6%8E%92%E5%BA%8F"><span class="nav-number">1.3.3.</span> <span class="nav-text">归并排序</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E5%AF%BB%E5%B3%B0%E7%AE%97%E6%B3%95"><span class="nav-number">1.3.4.</span> <span class="nav-text">寻峰算法</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84"><span class="nav-number">1.3.5.</span> <span class="nav-text">最大子数组</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%BB%A3%E5%85%A5%E6%B3%95%E6%B1%82%E8%A7%A3%E9%80%92%E5%BD%92%E5%BC%8F"><span class="nav-number">1.4.</span> <span class="nav-text">代入法求解递归式</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E9%80%92%E5%BD%92%E6%A0%91%E6%B3%95"><span class="nav-number">1.5.</span> <span class="nav-text">递归树法</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%BB%E6%96%B9%E6%B3%95%E6%B1%82%E8%A7%A3%E9%80%92%E5%BD%92%E5%BC%8F"><span class="nav-number">1.6.</span> <span class="nav-text">主方法求解递归式</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E6%AF%94%E8%BE%83%E6%8E%92%E5%BA%8F"><span class="nav-number">2.</span> <span class="nav-text">比较排序</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%86%B3%E7%AD%96%E6%A0%91"><span class="nav-number">2.1.</span> <span class="nav-text">决策树</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%A0%86%E6%8E%92%E5%BA%8F"><span class="nav-number">2.2.</span> <span class="nav-text">堆排序</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E5%92%8C%E4%BA%8C%E5%88%86%E6%90%9C%E7%B4%A2%E6%A0%91"><span class="nav-number">2.3.</span> <span class="nav-text">动态规划和二分搜索树</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%93%88%E5%B8%8C"><span class="nav-number">3.</span> <span class="nav-text">哈希</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E7%BA%BF%E6%80%A7%E6%97%B6%E9%97%B4%E6%8E%92%E5%BA%8F"><span class="nav-number">4.</span> <span class="nav-text">线性时间排序</span></a></li></ol></div>
         </div>
         <!--/noindex-->
 
@@ -211,7 +214,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -292,9 +295,15 @@ <h1 class="post-title" itemprop="name headline">
         <i class="far fa-calendar"></i>
       </span>
       <span class="post-meta-item-text">发表于</span>
-      
 
-      <time title="创建时间：2023-10-14 20:31:46 / 修改时间：20:47:51" itemprop="dateCreated datePublished" datetime="2023-10-14T20:31:46+08:00">2023-10-14</time>
+      <time title="创建时间：2023-10-14 20:31:46" itemprop="dateCreated datePublished" datetime="2023-10-14T20:31:46+08:00">2023-10-14</time>
+    </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-10-16 23:15:56" itemprop="dateModified" datetime="2023-10-16T23:15:56+08:00">2023-10-16</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -324,14 +333,14 @@ <h1 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>4k</span>
+      <span>8.7k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>4 分钟</span>
+      <span>8 分钟</span>
     </span>
 </div>
 
@@ -341,15 +350,23 @@ <h1 class="post-title" itemprop="name headline">
     
     
     
-    <div class="post-body" itemprop="articleBody"><h2 id="算法性质"><a href="#算法性质" class="headerlink" title="算法性质"></a>算法性质</h2><p><code>循环不变式</code>主要用来帮助我们理解算法的正确性。关千<code>循环不变式</code>，我们必须证明三条<br>性质：<br>初始化：循环的第一次迭代之前，它为真。<br>保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。<br>终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正<br>确的。</p>
+    <div class="post-body" itemprop="articleBody"><h1 id="基础"><a href="#基础" class="headerlink" title="基础"></a>基础</h1><h2 id="数据结构"><a href="#数据结构" class="headerlink" title="数据结构"></a>数据结构</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016191822017.png"></p>
+<h2 id="算法性质"><a href="#算法性质" class="headerlink" title="算法性质"></a>算法性质</h2><p><code>循环不变式</code>主要用来帮助我们理解算法的正确性。关千<code>循环不变式</code>，我们必须证明三条<br>性质：<br>初始化：循环的第一次迭代之前，它为真。<br>保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。<br>终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正<br>确的。</p>
 <span id="more"></span>
-<p><code>分治算法</code>运行时间的递归式来自基本模式的三个步骤。如前所述，我们假设 T(n) 是规模为n 的一个问题的运行时间。若问题规模足够小，如对某个常量 c, n~c, 则直接求解需要常量时间，我们将其写作 @(1) 。假设把原问题分解成 a 个子问题，每个子问题的规模是原问题的 l&#x2F;b （对归并排序， a 和 b 都为 2, 然而，我们将看到在许多分治算法中， a&#x3D;&#x2F;&#x3D;-b 。)为了求解一个规模为  n&#x2F;b 的子问题，需要 T(n&#x2F;b) 的时间，所以需要 aT(n&#x2F;b) 的时间来求解 a 个子问题。如果分解问题  成子问题需要时间 D(n), 合并子问题的解成原问题的解需要时间 C(n), 那么得到递归式：<br><img src="/images/obsidian/202305191420061.png" alt="图片" title="image"><br><img src="/images/obsidian/20230519142707.png" alt="图片" title="image"></p>
+<p><code>分治算法</code>运行时间的递归式来自基本模式的三个步骤。如前所述，我们假设 T(n) 是规模为n 的一个问题的运行时间。若问题规模足够小，如对某个常量 c, n~c, 则直接求解需要常量时间，我们将其写作 @(1) 。假设把原问题分解成 a 个子问题，每个子问题的规模是原问题的 l&#x2F;b （对归并排序， a 和 b 都为 2, 然而，我们将看到在许多分治算法中， a&#x3D;&#x2F;&#x3D;-b 。)为了求解一个规模为  n&#x2F;b 的子问题，需要 T(n&#x2F;b) 的时间，所以需要 aT(n&#x2F;b) 的时间来求解 a 个子问题。如果分解问题  成子问题需要时间 D(n), 合并子问题的解成原问题的解需要时间 C(n), 那么得到递归式：<br><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/20230519142006.png" alt="图片" title="image"><br><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/20230519142707.png" alt="图片" title="image"></p>
 <p>f(n) &#x3D; O(g(n)) 类似于 a&lt;&#x3D;b<br>f(n) &#x3D; Ω (g(n)) 类似于 a&gt;&#x3D;b<br>f(n) &#x3D; θ (g(n))  类似于 a&#x3D;b<br>f(n) &#x3D; o(g(n)) 类似于 a&lt;b<br>f(n) &#x3D; w(g(n)) 类似于 a&gt;b<br><img src="/images/obsidian/20230519150021.png" alt="图片" title="image"></p>
-<h1 id="分治与递归"><a href="#分治与递归" class="headerlink" title="分治与递归"></a>分治与递归</h1><h2 id="实例"><a href="#实例" class="headerlink" title="实例"></a>实例</h2><h3 id="归并排序"><a href="#归并排序" class="headerlink" title="归并排序"></a>归并排序</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br></pre></td><td class="code"><pre><span class="line">MERGE(A, p, q, r)</span><br><span class="line"></span><br><span class="line">n1 = q - p + 1 </span><br><span class="line">n2 = r - q  </span><br><span class="line"></span><br><span class="line">let L[1.. n1 + 1] and R[1.. n2 + 1] be new arrays</span><br><span class="line"></span><br><span class="line">for i = 1 to n1</span><br><span class="line">L[i] = A[p + i - 1] </span><br><span class="line"></span><br><span class="line">for j = 1 to n2 </span><br><span class="line">R[j] = A[q + j]</span><br><span class="line"></span><br><span class="line">L[n1+ 1] = ∞</span><br><span class="line">R[n2 + 1] = ∞</span><br><span class="line"></span><br><span class="line">i = 1</span><br><span class="line">j = 1</span><br><span class="line"></span><br><span class="line">for k = p to r</span><br><span class="line">if L[i] &lt;= R[j]</span><br><span class="line">A[k] = L[i]</span><br><span class="line">i = i + 1</span><br><span class="line">else </span><br><span class="line">A[k] = R[j] </span><br><span class="line">j = j + 1</span><br><span class="line"></span><br><span class="line">MERGE-SORT(A, p, r)</span><br><span class="line">1 if p&lt;r</span><br><span class="line">z q =  ⌊ (P+r)/2 ⌋</span><br><span class="line">3 MERGE-SORT(A, p, q)</span><br><span class="line">4 MERGE-SORT(A, q+1, r)</span><br><span class="line">5 MERGE(A, p, q, r)</span><br></pre></td></tr></table></figure>
+<h2 id="分治法（递归）"><a href="#分治法（递归）" class="headerlink" title="分治法（递归）"></a>分治法（递归）</h2><h3 id="选择排序"><a href="#选择排序" class="headerlink" title="选择排序"></a>选择排序</h3><p>• Find a largest number in prefix A[:i + 1] and swap it to A[i]<br>• Recursively sort prefix A[:i]</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">def selection_sort(A, i = None): # T(i)</span><br><span class="line">2 ’’’Sort A[:i + 1]’’’</span><br><span class="line">3 if i is None: i = len(A) - 1 # O(1)</span><br><span class="line">4 if i &gt; 0: # O(1)</span><br><span class="line">5 j = prefix_max(A, i) # S(i)</span><br><span class="line">6 A[i], A[j] = A[j], A[i] # O(1)</span><br><span class="line">7 selection_sort(A, i - 1) # T(i - 1)</span><br><span class="line">8</span><br><span class="line">9 def prefix_max(A, i): # S(i)</span><br><span class="line">10 ’’’Return index of maximum in A[:i + 1]’’’</span><br><span class="line">11 if i &gt; 0: # O(1)</span><br><span class="line">12 j = prefix_max(A, i - 1) # S(i - 1)</span><br><span class="line">13 if A[i] &lt; A[j]: # O(1)</span><br><span class="line">14 return j # O(1)</span><br><span class="line">15 return i # O(1)</span><br></pre></td></tr></table></figure>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">• prefix max analysis:</span><br><span class="line">– Base case: for i = 0, array has one element, so index of max is i</span><br><span class="line">– Induction: assume correct for i, maximum is either the maximum of A[:i] or A[i],</span><br><span class="line">returns correct index in either case</span><br><span class="line">• selection sort analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, last number of a sorted output is a largest number of</span><br><span class="line">the array, and the algorithm puts one there; then A[:i] is sorted by inductio</span><br></pre></td></tr></table></figure>
+<h3 id="插入排序"><a href="#插入排序" class="headerlink" title="插入排序"></a>插入排序</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br></pre></td><td class="code"><pre><span class="line">def insertion_sort(A, i = None): # T(i)</span><br><span class="line">2 ’’’Sort A[:i + 1]’’’</span><br><span class="line">3 if i is None: i = len(A) - 1 # O(1)</span><br><span class="line">4 if i &gt; 0: # O(1)</span><br><span class="line">5 insertion_sort(A, i - 1) # T(i - 1)</span><br><span class="line">6 insert_last(A, i) # S(i)</span><br><span class="line">7</span><br><span class="line">8 def insert_last(A, i): # S(i)</span><br><span class="line">9 ’’’Sort A[:i + 1] assuming sorted A[:i]’’’</span><br><span class="line">10 if i &gt; 0 and A[i] &lt; A[i - 1]: # O(1)</span><br><span class="line">11 A[i], A[i - 1] = A[i - 1], A[i] # O(1)</span><br><span class="line">12 insert_last(A, i - 1) # S(i - 1)</span><br><span class="line">• insert last analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, if A[i] &gt;= A[i - 1], array is sorted; otherwise,</span><br><span class="line">swapping last two elements allows us to sort A[:i] by induction</span><br><span class="line">• insertion sort analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, algorithm sorts A[:i] by induction, and then</span><br><span class="line">insert last correctly sorts the rest as proved above</span><br></pre></td></tr></table></figure>
+<h3 id="归并排序"><a href="#归并排序" class="headerlink" title="归并排序"></a>归并排序</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br></pre></td><td class="code"><pre><span class="line">def merge_sort(A, a = 0, b = None): # T(b - a = n)</span><br><span class="line">2 ’’’Sort A[a:b]’’’</span><br><span class="line">3 if b is None: b = len(A) # O(1)</span><br><span class="line">4 if 1 &lt; b - a: # O(1)</span><br><span class="line">5 c = (a + b + 1) // 2 # O(1)</span><br><span class="line">6 merge_sort(A, a, c) # T(n / 2)</span><br><span class="line">7 merge_sort(A, c, b) # T(n / 2)</span><br><span class="line">8 L, R = A[a:c], A[c:b] # O(n)</span><br><span class="line">9 merge(L, R, A, len(L), len(R), a, b) # S(n)</span><br><span class="line">10</span><br><span class="line">11 def merge(L, R, A, i, j, a, b): # S(b - a = n)</span><br><span class="line">12 ’’’Merge sorted L[:i] and R[:j] into A[a:b]’’’</span><br><span class="line">13 if a &lt; b: # O(1)</span><br><span class="line">14 if (j &lt;= 0) or (i &gt; 0 and L[i - 1] &gt; R[j - 1]): # O(1)</span><br><span class="line">15 A[b - 1] = L[i - 1] # O(1)</span><br><span class="line">16 i = i - 1 # O(1)</span><br><span class="line">17 else: # O(1)</span><br><span class="line">18 A[b - 1] = R[j - 1] # O(1)</span><br><span class="line">19 j = j - 1 # O(1)</span><br><span class="line">20 merge(L, R, A, i, j, a, b - 1)</span><br></pre></td></tr></table></figure>
+
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">• merge analysis:</span><br><span class="line">– Base case: for n = 0, arrays are empty, so vacuously correct</span><br><span class="line">– Induction: assume correct for n, item in A[r] must be a largest number from remaining</span><br><span class="line">prefixes of L and R, and since they are sorted, taking largest of last items suffices;</span><br><span class="line">remainder is merged by induction</span><br><span class="line"> merge sort analysis:</span><br><span class="line">– Base case: for n = 1, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for k &lt; n, algorithm sorts smaller halves by induction, and then merge merges into a sorted array as proved above.</span><br></pre></td></tr></table></figure>
 <h3 id="寻峰算法"><a href="#寻峰算法" class="headerlink" title="寻峰算法"></a>寻峰算法</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br></pre></td><td class="code"><pre><span class="line">• If a[n/2] &lt; a[n/2 − 1] then only look at left half 1 . . . n/2 − − − 1 to look for peak</span><br><span class="line">• Else if a[n/2] &lt; a[n/2 + 1] then only look at right half n/2 + 1 . . . n to look for peak</span><br><span class="line">• Else n/2 position is a peak: WHY?</span><br><span class="line">a[n/2] ≥ a[n/2 − 1]</span><br><span class="line">a[n/2] ≥ a[n/2 + 1]</span><br><span class="line">What is the complexity?</span><br><span class="line">T (n) = T (n/2) + Θ(1) = Θ(1) + . . . + Θ(1) (log2(n) times) = Θ(log2(n))</span><br></pre></td></tr></table></figure>
 <p>二维情况下：</p>
 <figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br></pre></td><td class="code"><pre><span class="line">• Pick middle column j = m/2</span><br><span class="line">• Find global maximum on column j at (i, j)</span><br><span class="line">• Compare (i, j − 1), (i, j), (i, j + 1)</span><br><span class="line">• Pick left columns of (i, j − 1) &gt; (i, j)</span><br><span class="line">• Similarly for right</span><br><span class="line">• (i, j) is a 2D-peak if neither condition holds</span><br><span class="line">• Solve the new problem with half the number of columns.</span><br><span class="line">• When you have a single column, find global maximum and you‘re done.</span><br><span class="line"></span><br><span class="line">T (n, m) = T (n, m/2) + Θ(n) (to find global maximum on a column — (n rows))</span><br><span class="line">T (n, m) = Θ(n) + . . . + Θ(n)</span><br><span class="line">&#x27; -v &quot;</span><br><span class="line">log m</span><br><span class="line">= Θ(n log m) = Θ(n log n) if m = n</span><br></pre></td></tr></table></figure>
-
+<h3 id="最大子数组"><a href="#最大子数组" class="headerlink" title="最大子数组"></a>最大子数组</h3><p>算法思路：<br>元素和最大的子数组有三种情况：在左半数组，右半数组，或者跨越中点，第一和第二种情况可以用递归遍历解决，第三种情况则分为两个半边数组的组合，只要从中点出发寻找最大子数组，然后组合就可以了<br><code>时间复杂度分析</code>：，其中线性时间为跨越中点的子数组，最终需要时间为O(NlogN)<br>![[Pasted image 20230522103507.png]]</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br></pre></td><td class="code"><pre><span class="line">FIND-MAXIMUM-SUBARRAYCA, low, high)  </span><br><span class="line">if high== low  </span><br><span class="line">return Clow, high, A[low])  </span><br><span class="line">else mid=L Clow 十 high)/2 」  </span><br><span class="line">Cleft-low, left-high, left-sum) =  </span><br><span class="line">// base case, only one element  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, low, mid)  </span><br><span class="line">(right-low, right-high, right-sum) =  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, mid+l. high)  </span><br><span class="line">(cross-low, cross-high, cross-sum) =  </span><br><span class="line">FIND-MAX-CROSSING-SUBARRAY(A, low, mid, high)  </span><br><span class="line">if left-sum~right-sum and left-sum~cross-sum  </span><br><span class="line">return (left-low, left-high, left-sum)  </span><br><span class="line">elseif rightr-sum;?, left-sum and right-sum;?, cross-sum  </span><br><span class="line">return (right-low, right-high, right-sum)  </span><br><span class="line">else return (cross-low, cross-high, cross-sum)</span><br><span class="line"></span><br><span class="line">FIND-MAX-CROSSING--SUBARRAY(A, low, mid, high)  </span><br><span class="line"> left-sum = -oo  </span><br><span class="line"> sum=O  </span><br><span class="line"> for i = mid downto low  </span><br><span class="line"> sum=sum+A[i]  </span><br><span class="line"> if sum&gt; left-sum  </span><br><span class="line"> left-sum = sum  </span><br><span class="line"> max-left = i  </span><br><span class="line"> right-sum= -oo  </span><br><span class="line"> sum=O  </span><br><span class="line"> for j = mid + 1 to high</span><br><span class="line"> sum=sum + A[j]  </span><br><span class="line"> if sum &gt; right-sum  </span><br><span class="line"> right-sum = sum  </span><br><span class="line"> max-right = j  </span><br><span class="line"> return (max-left, max-right, left-sum + right-sum)</span><br></pre></td></tr></table></figure>
 <h2 id="代入法求解递归式"><a href="#代入法求解递归式" class="headerlink" title="代入法求解递归式"></a>代入法求解递归式</h2><ol>
 <li>猜测解的形式。  </li>
 <li>用数学归纳法求出解中的常数，并证明解是正确的。<br>猜测T(n)的上界，将其带入递归式，求出一个上界，随后寻找一个N0证明对所有n&gt;&#x3D;n0，递归式T(n)成立<br><img src="/images/obsidian/20230522140116.png" alt="图片" title="image"><br><img src="/images/obsidian/20230522140235.png" alt="图片" title="image"></li>
@@ -359,14 +376,26 @@ <h2 id="主方法求解递归式"><a href="#主方法求解递归式" class="hea
 <p>算法思路：<br>元素和最大的子数组有三种情况：在左半数组，右半数组，或者跨越中点，第一和第二种情况可以用递归遍历解决，第三种情况则分为两个半边数组的组合，只要从中点出发寻找最大子数组，然后组合就可以了<br><code>时间复杂度分析</code>：，其中线性时间为跨越中点的子数组，最终需要时间为O(NlogN)<br><img src="/images/obsidian/202305221035071.png" alt="图片" title="image"></p>
 <figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br></pre></td><td class="code"><pre><span class="line">FIND-MAXIMUM-SUBARRAYCA, low, high)  </span><br><span class="line">1 if high== low  </span><br><span class="line">2 return Clow, high, A[low])  </span><br><span class="line">3 else mid=L Clow 十 high)/2 」  </span><br><span class="line">4 Cleft-low, left-high, left-sum) =  </span><br><span class="line">// base case, only one element  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, low, mid)  </span><br><span class="line">5 (right-low, right-high, right-sum) =  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, mid+l. high)  </span><br><span class="line">6 (cross-low, cross-high, cross-sum) =  </span><br><span class="line">FIND-MAX-CROSSING-SUBARRAY(A, low, mid, high)  </span><br><span class="line">7 if left-sum~right-sum and left-sum~cross-sum  </span><br><span class="line">8 return (left-low, left-high, left-sum)  </span><br><span class="line">elseif rightr-sum;?, left-sum and right-sum;?, cross-sum  </span><br><span class="line">return (right-low, right-high, right-sum)  </span><br><span class="line">else return (cross-low, cross-high, cross-sum)</span><br><span class="line"></span><br><span class="line">FIND-MAX-CROSSING--SUBARRAY(A, low, mid, high)  </span><br><span class="line">1 left-sum = -oo  </span><br><span class="line">2 sum=O  </span><br><span class="line">3 for i = mid downto low  </span><br><span class="line">4 sum=sum+A[i]  </span><br><span class="line">5 if sum&gt; left-sum  </span><br><span class="line">6 left-sum = sum  </span><br><span class="line">7 max-left = i  </span><br><span class="line">8 right-sum= -oo  </span><br><span class="line">9 sum=O  </span><br><span class="line">10 for j = mid + 1 to high</span><br><span class="line">11 sum=sum + A[j]  </span><br><span class="line">12 if sum &gt; right-sum  </span><br><span class="line">13 right-sum = sum  </span><br><span class="line">14 max-right = j  </span><br><span class="line">15 return (max-left, max-right, left-sum + right-sum)</span><br></pre></td></tr></table></figure>
 
-<h1 id="比较排序"><a href="#比较排序" class="headerlink" title="比较排序"></a>比较排序</h1><h2 id="堆排序"><a href="#堆排序" class="headerlink" title="堆排序"></a>堆排序</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231014112423645.png"><br>最大堆的生成</p>
+<h1 id="比较排序"><a href="#比较排序" class="headerlink" title="比较排序"></a>比较排序</h1><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016192215938.png"></p>
+<h2 id="决策树"><a href="#决策树" class="headerlink" title="决策树"></a>决策树</h2><p>决策树<br> • 任何算法都可以被视为所执行操作的决策树<br> • 内部节点表示二进制比较，分支为 True 或 False<br> • 对于比较算法，决策树是二元的<br> • 叶子代表算法终止，产生算法输出<br> • 根到叶路径表示算法在某些输入上的执行<br> • 每个算法输出至少需要一个叶子，因此搜索需要 ≥ n + 1 个叶子<br> • 高度 ≥ mod(lg(n + 1)) − 1 &#x3D; Ω(log n)，因此任何比较排序的运行时间均为 Ω(log n)</p>
+<h2 id="堆排序"><a href="#堆排序" class="headerlink" title="堆排序"></a>堆排序</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231014112423645.png"><br>最大堆的生成</p>
 <figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line">l = left(i)</span><br><span class="line">r = right(i)</span><br><span class="line">if (l &lt;= heap-size(A) and A[l] &gt; A[i])</span><br><span class="line">then largest = l else largest = i</span><br><span class="line">if (r &lt;= heap-size(A) and A[r] &gt; A[largest])</span><br><span class="line">then largest = r</span><br><span class="line">if largest = i</span><br><span class="line">then exchange A[i] and A[largest]</span><br><span class="line">Max_Heapify(A, largest)</span><br><span class="line"></span><br><span class="line">//Converts A[1…n] to a max heap</span><br><span class="line">Build_Max_Heap(A):</span><br><span class="line">for i=n/2 downto 1</span><br><span class="line">do Max_Heapify(A, i)</span><br><span class="line"></span><br><span class="line">/*</span><br><span class="line">Why start at n/2?</span><br><span class="line">Because elements A[n/2 + 1 … n] are all leaves of the tree</span><br><span class="line">*/</span><br></pre></td></tr></table></figure>
 <p>时间复杂度分析：</p>
 <p>Total amount of work in the for loop can be summed as:<br>n&#x2F;4 (1 c) + n&#x2F;8 (2 c) + n&#x2F;16 (3 c) + … + 1 (lg n c)<br>Setting n&#x2F;4 &#x3D; 2k and simplifying we get:<br>c 2k( 1&#x2F;20 + 2&#x2F;21 + 3&#x2F;22 + … (k+1)&#x2F;2k )<br>The term is brackets is bounded by a constant<br>This means that Build_Max_Heap is O(n)</p>
 <p>排序策略：</p>
 <figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br></pre></td><td class="code"><pre><span class="line">Sorting Strategy:</span><br><span class="line">1. Build Max Heap from unordered array;</span><br><span class="line">2. Find maximum element A[1];</span><br><span class="line">3. Swap elements A[n] and A[1]:</span><br><span class="line">now max element is at the end of the array!</span><br><span class="line">4. Discard node n from heap</span><br><span class="line">(by decrementing heap-size variable)</span><br><span class="line">5. New root may violate max heap property, but its</span><br><span class="line">children are max heaps. Run max_heapify to fix this.</span><br><span class="line">6. Go to Step 2 unless heap is empty</span><br></pre></td></tr></table></figure>
-
-
+<h2 id="动态规划和二分搜索树"><a href="#动态规划和二分搜索树" class="headerlink" title="动态规划和二分搜索树"></a>动态规划和二分搜索树</h2><p>实例——机场的动态规划：</p>
+<ol>
+<li>机场维护一个跑道队列</li>
+<li>未来的着陆预定登记到队列</li>
+<li>一架飞机着陆后就出队</li>
+<li>有新的请求且需要着陆时间t时，如果k时间内没有其他需求，则需求t时间的请求入队(k可以实时改变)<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br></pre></td><td class="code"><pre><span class="line">init: R = [ ]</span><br><span class="line">req(t): if t &lt; now: return &quot;error&quot;</span><br><span class="line">for i in range (len(R)):</span><br><span class="line">if abs(t-R[i]) &lt; k: return &quot;error&quot;</span><br><span class="line">R.append(t)</span><br><span class="line">R = sorted(R)</span><br><span class="line">land: t = R[0]</span><br><span class="line">if (t != now) return error</span><br><span class="line">R = R[1: ] (drop R[0] from R)</span><br></pre></td></tr></table></figure>
+Goal: Run this system efficiently in O(lg n) time<br>常见数据结构运行时间分析<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br></pre></td><td class="code"><pre><span class="line">• Sorted list: Appending and sorting takes Θ(n lg n) time. However, it is pos-</span><br><span class="line">sible to insert new time/plane rather than append and sort but insertion takes</span><br><span class="line">Θ(n) time. A k minute check can be done in O(1) once the insertion point is</span><br><span class="line">found.</span><br><span class="line">• Sorted array: It is possible to do binary search to find place to insert in</span><br><span class="line">O(lg n) time. Using binary search, we find the smallest i such that R[i] ≥ t,</span><br><span class="line">i.e., the next larger element. We then compare R[i] and R[i − 1] against t.</span><br><span class="line">Actual insertion however requires shifting elements which requires Θ(n) time.</span><br><span class="line">• Unsorted list/array: k minute check takes O(n) time.</span><br><span class="line">• Min-Heap: It is possible to insert in O(lg n) time. However, the k minute</span><br><span class="line">check will require O(n) time.</span><br><span class="line">• Dictionary or Python Set: Insertion is O(1) time. k minute check takes</span><br><span class="line">Ω(n) time</span><br></pre></td></tr></table></figure>
+BST的定义：<br>每个节点都有一个key,左节点的key小于等于父节点，右节点的key大于等于父节点<br>所有操作都是O(h)即O(lgn)<br>动态规划中需要找到比一个值大的值中的最小值<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line">next-larger(x)</span><br><span class="line">if right child not NIL, return minimum(right)</span><br><span class="line">else y = parent(x)</span><br><span class="line">while y not NIL and x = right(y)</span><br><span class="line">x = y; y = parent(y)</span><br><span class="line">return(y);</span><br></pre></td></tr></table></figure>
+<code>子问题</code>：如何计算小于等于时间t内着陆的飞机数量<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line">1. Walk down tree to find desired time</span><br><span class="line">2. Add in nodes that are smaller</span><br><span class="line">3. Add in subtree sizes to the left</span><br></pre></td></tr></table></figure></li>
+</ol>
+<h1 id="哈希"><a href="#哈希" class="headerlink" title="哈希"></a>哈希</h1><p>哈希有可能产生碰撞，需要特定处理或者数据结构，检索元素时间最后会由负载因数(n&#x2F;m)决定<br><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016200400451.png"></p>
+<h1 id="线性时间排序"><a href="#线性时间排序" class="headerlink" title="线性时间排序"></a>线性时间排序</h1>
     </div>
 
     
@@ -423,13 +452,13 @@ <h1 id="比较排序"><a href="#比较排序" class="headerlink" title="比较
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/10/14/\350\213\217\345\244\247linux_ppt/index.html" "b/2023/10/14/\350\213\217\345\244\247linux_ppt/index.html"
index 5a40a743b..a6e854e4a 100644
--- "a/2023/10/14/\350\213\217\345\244\247linux_ppt/index.html"
+++ "b/2023/10/14/\350\213\217\345\244\247linux_ppt/index.html"
@@ -201,7 +201,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -519,13 +519,13 @@ <h3 id="实例"><a href="#实例" class="headerlink" title="实例"></a>实例</
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/10/14/\350\256\241\347\275\221/index.html" "b/2023/10/14/\350\256\241\347\275\221/index.html"
index 0f0872526..5963c0eae 100644
--- "a/2023/10/14/\350\256\241\347\275\221/index.html"
+++ "b/2023/10/14/\350\256\241\347\275\221/index.html"
@@ -203,7 +203,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -394,8 +394,8 @@ <h3 id="网络核心"><a href="#网络核心" class="headerlink" title="网络
                 </a>
             </div>
             <div class="post-nav-item">
-                <a href="/2023/10/15/houses/" rel="next" title="基于伯克利ds100的数据分析项目">
-                  基于伯克利ds100的数据分析项目 <i class="fa fa-angle-right"></i>
+                <a href="/2023/10/15/houses/" rel="next" title="基于伯克利ds100的数据分析项目(待续)">
+                  基于伯克利ds100的数据分析项目(待续) <i class="fa fa-angle-right"></i>
                 </a>
             </div>
           </div>
@@ -428,13 +428,13 @@ <h3 id="网络核心"><a href="#网络核心" class="headerlink" title="网络
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/2023/10/15/houses/index.html b/2023/10/15/houses/index.html
index 3d4248dd0..33e1db49e 100644
--- a/2023/10/15/houses/index.html
+++ b/2023/10/15/houses/index.html
@@ -29,7 +29,7 @@
 
     <meta name="description" content="数据集：美国伊利诺伊州库克县的住房数据集12345678910111213141516171819#引入python库import numpy as npimport pandas as pd%matplotlib inlineimport matplotlib.pyplot as pltimport seaborn as snsimport warningswarnings.filterwarn">
 <meta property="og:type" content="article">
-<meta property="og:title" content="基于伯克利ds100的数据分析项目">
+<meta property="og:title" content="基于伯克利ds100的数据分析项目(待续)">
 <meta property="og:url" content="https://thinklive1.github.io/2023/10/15/houses/index.html">
 <meta property="og:site_name" content="thinklive">
 <meta property="og:description" content="数据集：美国伊利诺伊州库克县的住房数据集12345678910111213141516171819#引入python库import numpy as npimport pandas as pd%matplotlib inlineimport matplotlib.pyplot as pltimport seaborn as snsimport warningswarnings.filterwarn">
@@ -38,7 +38,7 @@
 <meta property="og:image" content="https://thinklive1.github.io/assets/houses/output_13_0.png">
 <meta property="og:image" content="https://thinklive1.github.io/assets/houses/output_17_0.png">
 <meta property="article:published_time" content="2023-10-15T15:17:54.736Z">
-<meta property="article:modified_time" content="2023-10-15T15:21:12.886Z">
+<meta property="article:modified_time" content="2023-10-15T15:22:04.416Z">
 <meta property="article:author" content="thinklive">
 <meta property="article:tag" content="课程笔记">
 <meta property="article:tag" content="伯克利">
@@ -53,10 +53,10 @@
 
 
 
-<script class="next-config" data-name="page" type="application/json">{"sidebar":"","isHome":false,"isPost":true,"lang":"zh-CN","comments":true,"permalink":"https://thinklive1.github.io/2023/10/15/houses/","path":"2023/10/15/houses/","title":"基于伯克利ds100的数据分析项目"}</script>
+<script class="next-config" data-name="page" type="application/json">{"sidebar":"","isHome":false,"isPost":true,"lang":"zh-CN","comments":true,"permalink":"https://thinklive1.github.io/2023/10/15/houses/","path":"2023/10/15/houses/","title":"基于伯克利ds100的数据分析项目(待续)"}</script>
 
 <script class="next-config" data-name="calendar" type="application/json">""</script>
-<title>基于伯克利ds100的数据分析项目 | thinklive</title>
+<title>基于伯克利ds100的数据分析项目(待续) | thinklive</title>
   
 
 
@@ -205,7 +205,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -270,12 +270,12 @@
     </span>
 
     <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
-      <meta itemprop="name" content="基于伯克利ds100的数据分析项目 | thinklive">
+      <meta itemprop="name" content="基于伯克利ds100的数据分析项目(待续) | thinklive">
       <meta itemprop="description" content="">
     </span>
       <header class="post-header">
         <h1 class="post-title" itemprop="name headline">
-          基于伯克利ds100的数据分析项目
+          基于伯克利ds100的数据分析项目(待续)
         </h1>
 
         <div class="post-meta-container">
@@ -288,7 +288,7 @@ <h1 class="post-title" itemprop="name headline">
       <span class="post-meta-item-text">发表于</span>
       
 
-      <time title="创建时间：2023-10-15 23:17:54 / 修改时间：23:21:12" itemprop="dateCreated datePublished" datetime="2023-10-15T23:17:54+08:00">2023-10-15</time>
+      <time title="创建时间：2023-10-15 23:17:54 / 修改时间：23:22:04" itemprop="dateCreated datePublished" datetime="2023-10-15T23:17:54+08:00">2023-10-15</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -613,6 +613,9 @@ <h2 id="可视化销售价格与街区的关系"><a href="#可视化销售价格
                 </a>
             </div>
             <div class="post-nav-item">
+                <a href="/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/" rel="next" title="">
+                   <i class="fa fa-angle-right"></i>
+                </a>
             </div>
           </div>
     </footer>
@@ -644,13 +647,13 @@ <h2 id="可视化销售价格与街区的关系"><a href="#可视化销售价格
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/2023/10/16/mit6.006\346\200\273\345\222\214\347\254\224\350\256\2601/index.html" "b/2023/10/16/mit6.006\346\200\273\345\222\214\347\254\224\350\256\2601/index.html"
new file mode 100644
index 000000000..b0cd529f3
--- /dev/null
+++ "b/2023/10/16/mit6.006\346\200\273\345\222\214\347\254\224\350\256\2601/index.html"
@@ -0,0 +1,492 @@
+<!DOCTYPE html>
+<html lang="zh-CN">
+<head>
+
+  <script src="//cdn.bootcss.com/jquery/3.2.1/jquery.min.js"></script>
+  <link href="https://cdn.bootcdn.net/ajax/libs/toastr.js/2.1.4/toastr.min.css" rel="stylesheet">
+  <script src="/js/copy.js"></script>
+
+  <meta charset="UTF-8">
+<meta name="viewport" content="width=device-width">
+<meta name="theme-color" content="#4c4c4c"><meta name="generator" content="Hexo 6.3.0">
+<link rel="preconnect" href="https://cdnjs.cloudflare.com" crossorigin>
+  <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon-next.png">
+  <link rel="icon" type="image/png" sizes="32x32" href="/images/favicon-32x32-next.png">
+  <link rel="icon" type="image/png" sizes="16x16" href="/images/favicon-16x16-next.png">
+  <link rel="mask-icon" href="/images/logo.svg" color="#4c4c4c">
+
+<link rel="stylesheet" href="/css/main.css">
+
+
+
+<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/6.4.0/css/all.min.css" integrity="sha256-HtsXJanqjKTc8vVQjO4YMhiqFoXkfBsjBWcX91T1jr8=" crossorigin="anonymous">
+  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.1.1/animate.min.css" integrity="sha256-PR7ttpcvz8qrF57fur/yAx1qXMFJeJFiA6pSzWi0OIE=" crossorigin="anonymous">
+  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/fancyapps-ui/5.0.20/fancybox/fancybox.css" integrity="sha256-RvRHGSuWAxZpXKV9lLDt2e+rZ+btzn48Wp4ueS3NZKs=" crossorigin="anonymous">
+  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/pace/1.2.4/themes/blue/pace-theme-minimal.css">
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/pace/1.2.4/pace.min.js" integrity="sha256-gqd7YTjg/BtfqWSwsJOvndl0Bxc8gFImLEkXQT8+qj0=" crossorigin="anonymous"></script>
+
+<script class="next-config" data-name="main" type="application/json">{"hostname":"thinklive1.github.io","root":"/","images":"/images","scheme":"Gemini","darkmode":false,"version":"8.18.1","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12},"copycode":{"enable":true,"style":"flat"},"fold":{"enable":false,"height":500},"bookmark":{"enable":true,"color":"#369","save":"auto"},"mediumzoom":false,"lazyload":false,"pangu":true,"comments":{"style":"tabs","active":"utterances","storage":true,"lazyload":false,"nav":null,"activeClass":"utterances"},"stickytabs":false,"motion":{"enable":true,"async":false,"transition":{"menu_item":"fadeInDown","post_block":"fadeIn","post_header":"fadeInDown","post_body":"fadeInDown","coll_header":"fadeInLeft","sidebar":"fadeInUp"}},"prism":false,"i18n":{"placeholder":"搜索...","empty":"没有找到任何搜索结果：${query}","hits_time":"找到 ${hits} 个搜索结果（用时 ${time} 毫秒）","hits":"找到 ${hits} 个搜索结果"},"path":"/search.xml","localsearch":{"enable":true,"trigger":"auto","top_n_per_article":1,"unescape":false,"preload":false}}</script><script src="/js/config.js"></script>
+
+    <meta name="description" content="基础数据结构 算法性质循环不变式主要用来帮助我们理解算法的正确性。关千循环不变式，我们必须证明三条性质：初始化：循环的第一次迭代之前，它为真。保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正确的。分治算法运行时间的递归式来自基本模式的三个步骤。如前所述，我们假设 T(n) 是规模为n 的一个问题的运行时间。若">
+<meta property="og:type" content="article">
+<meta property="og:title" content="thinklive">
+<meta property="og:url" content="https://thinklive1.github.io/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/index.html">
+<meta property="og:site_name" content="thinklive">
+<meta property="og:description" content="基础数据结构 算法性质循环不变式主要用来帮助我们理解算法的正确性。关千循环不变式，我们必须证明三条性质：初始化：循环的第一次迭代之前，它为真。保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正确的。分治算法运行时间的递归式来自基本模式的三个步骤。如前所述，我们假设 T(n) 是规模为n 的一个问题的运行时间。若">
+<meta property="og:locale" content="zh_CN">
+<meta property="og:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016191822017.png">
+<meta property="og:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016192215938.png">
+<meta property="og:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231014112423645.png">
+<meta property="og:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016200400451.png">
+<meta property="article:published_time" content="2023-10-16T15:11:19.093Z">
+<meta property="article:modified_time" content="2023-10-16T15:13:36.333Z">
+<meta property="article:author" content="thinklive">
+<meta name="twitter:card" content="summary">
+<meta name="twitter:image" content="https://thinklive1.github.io/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016191822017.png">
+
+
+<link rel="canonical" href="https://thinklive1.github.io/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/">
+
+
+
+<script class="next-config" data-name="page" type="application/json">{"sidebar":"","isHome":false,"isPost":true,"lang":"zh-CN","comments":true,"permalink":"https://thinklive1.github.io/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/","path":"2023/10/16/mit6.006总和笔记1/","title":""}</script>
+
+<script class="next-config" data-name="calendar" type="application/json">""</script>
+<title> | thinklive</title>
+  
+
+
+
+
+
+
+
+
+  <noscript>
+    <link rel="stylesheet" href="/css/noscript.css">
+  </noscript>
+<!-- hexo injector head_end start --><script> let HEXO_MMEDIA_DATA = { js: [], css: [], aplayerData: [], metingData: [], artPlayerData: [], dplayerData: []}; </script><!-- hexo injector head_end end --></head>
+<script src="/js/tab-title.js"></script>
+<!--pjax：防止跳转页面音乐暂停-->
+ <script src="https://cdn.jsdelivr.net/npm/pjax@0.2.8/pjax.js"></script>
+<body itemscope itemtype="http://schema.org/WebPage" class="use-motion">
+  <div class="headband"></div>
+
+  
+  
+<script type="text/javascript" async src="/js/fairyDustCursor.js"></script>
+  
+
+  <!--js: 线条特效-->
+  <script type="text/javascript" color="255,255,255" opacity='1' zIndex="-1" count="300" src="//cdn.bootcss.com/canvas-nest.js/1.0.0/canvas-nest.min.js"></script>
+
+  <main class="main">
+    <div class="column">
+      <header class="header" itemscope itemtype="http://schema.org/WPHeader"><div class="site-brand-container">
+  <div class="site-nav-toggle">
+    <div class="toggle" aria-label="切换导航栏" role="button">
+        <span class="toggle-line"></span>
+        <span class="toggle-line"></span>
+        <span class="toggle-line"></span>
+    </div>
+  </div>
+
+  <div class="site-meta">
+
+    <a href="/" class="brand" rel="start">
+      <i class="logo-line"></i>
+      <p class="site-title">thinklive</p>
+      <i class="logo-line"></i>
+    </a>
+      <p class="site-subtitle" itemprop="description">dirichlet labrary</p>
+  </div>
+
+  <div class="site-nav-right">
+    <div class="toggle popup-trigger" aria-label="搜索 | search" role="button">
+        <i class="fa fa-search fa-fw fa-lg"></i>
+    </div>
+  </div>
+</div>
+
+
+
+<nav class="site-nav">
+  <ul class="main-menu menu"><li class="menu-item menu-item-主页-|-home"><a href="/" rel="section"><i class="fa fa-home fa-fw"></i>主页 | home</a></li><li class="menu-item menu-item-标签-|-tags"><a href="/tags/" rel="section"><i class="fa fa-tags fa-fw"></i>标签 | tags</a></li><li class="menu-item menu-item-分类-|-categories"><a href="/categories/" rel="section"><i class="fa fa-th fa-fw"></i>分类 | categories</a></li><li class="menu-item menu-item-归档-|-archives"><a href="/archives/" rel="section"><i class="fa fa-archive fa-fw"></i>归档 | archives</a></li><li class="menu-item menu-item-相册-|-photos"><a href="/photos/" rel="section"><i class="fa fa-camera fa-fw"></i>相册 | photos</a></li><li class="menu-item menu-item-留言-|-guestbook"><a href="/guestbook/" rel="section"><i class="fa fa-book fa-fw"></i>留言 | guestbook</a></li><li class="menu-item menu-item-感谢-|-thanks"><a href="/thanks/" rel="section"><i class="fa custom thanks fa-fw"></i>感谢 | thanks</a></li><li class="menu-item menu-item-游戏-|-game"><a href="/game/CodePen/CodePen.htm" rel="section"><i class="fa fa-gamepad fa-fw"></i>游戏 | game</a></li><li class="menu-item menu-item-神龛-|-shrine"><a href="/cyberblog/" rel="section"><i class="fa fa-microchip fa-fw"></i>神龛 | shrine</a></li><li class="menu-item menu-item-资源地图-|-resourcemap"><a href="/webstack/" rel="section"><i class="fa fa-sitemap fa-fw"></i>资源地图 | resourcemap</a></li>
+      <li class="menu-item menu-item-search">
+        <a role="button" class="popup-trigger"><i class="fa fa-search fa-fw"></i>搜索 | search
+        </a>
+      </li>
+  </ul>
+</nav>
+
+
+
+  <div class="search-pop-overlay">
+    <div class="popup search-popup"><div class="search-header">
+  <span class="search-icon">
+    <i class="fa fa-search"></i>
+  </span>
+  <div class="search-input-container">
+    <input autocomplete="off" autocapitalize="off" maxlength="80"
+           placeholder="搜索..." spellcheck="false"
+           type="search" class="search-input">
+  </div>
+  <span class="popup-btn-close" role="button">
+    <i class="fa fa-times-circle"></i>
+  </span>
+</div>
+<div class="search-result-container no-result">
+  <div class="search-result-icon">
+    <i class="fa fa-spinner fa-pulse fa-5x"></i>
+  </div>
+</div>
+
+    </div>
+  </div>
+
+</header>
+        
+  
+  <aside class="sidebar">
+<img src="/images/thinklive_cyber.png"; z-index: 0; style="max-width: 100%; width: auto; height: auto;background-color: #fff;">
+
+<!--网易云音乐插件-->
+<!-- require APlayer -->
+<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/aplayer@1.10.1/dist/APlayer.min.css">
+<script src="https://cdn.jsdelivr.net/npm/aplayer@1.10.1/dist/APlayer.min.js"></script>
+<!-- require MetingJS-->
+<script src="https://cdn.jsdelivr.net/npm/meting@2.0.1/dist/Meting.min.js"></script> 
+<!--网易云playlist外链地址-->   
+<meting-js
+    server="netease"
+    type="playlist" 
+    id="2762741085"
+    mini="false"
+    fixed="false"
+    list-folded="true"
+    autoplay="false"
+    volume="0.2"
+    theme="#4c4c4c"
+    order="random"
+    loop="all"
+    preload="auto"
+    lrc-type="2"
+    mutex="true">
+</meting-js>
+    <div class="sidebar-inner sidebar-nav-active sidebar-toc-active">
+      <ul class="sidebar-nav">
+        <li class="sidebar-nav-toc">
+          文章目录
+        </li>
+        <li class="sidebar-nav-overview">
+          站点概览
+        </li>
+      </ul>
+
+      <div class="sidebar-panel-container">
+        <!--noindex-->
+        <div class="post-toc-wrap sidebar-panel">
+            <div class="post-toc animated"><ol class="nav"><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%9F%BA%E7%A1%80"><span class="nav-number">1.</span> <span class="nav-text">基础</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84"><span class="nav-number">1.1.</span> <span class="nav-text">数据结构</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E7%AE%97%E6%B3%95%E6%80%A7%E8%B4%A8"><span class="nav-number">1.2.</span> <span class="nav-text">算法性质</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%88%86%E6%B2%BB%E6%B3%95%EF%BC%88%E9%80%92%E5%BD%92%EF%BC%89"><span class="nav-number">1.3.</span> <span class="nav-text">分治法（递归）</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E9%80%89%E6%8B%A9%E6%8E%92%E5%BA%8F"><span class="nav-number">1.3.1.</span> <span class="nav-text">选择排序</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F"><span class="nav-number">1.3.2.</span> <span class="nav-text">插入排序</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E5%BD%92%E5%B9%B6%E6%8E%92%E5%BA%8F"><span class="nav-number">1.3.3.</span> <span class="nav-text">归并排序</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E5%AF%BB%E5%B3%B0%E7%AE%97%E6%B3%95"><span class="nav-number">1.3.4.</span> <span class="nav-text">寻峰算法</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84"><span class="nav-number">1.3.5.</span> <span class="nav-text">最大子数组</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%BB%A3%E5%85%A5%E6%B3%95%E6%B1%82%E8%A7%A3%E9%80%92%E5%BD%92%E5%BC%8F"><span class="nav-number">1.4.</span> <span class="nav-text">代入法求解递归式</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E9%80%92%E5%BD%92%E6%A0%91%E6%B3%95"><span class="nav-number">1.5.</span> <span class="nav-text">递归树法</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%BB%E6%96%B9%E6%B3%95%E6%B1%82%E8%A7%A3%E9%80%92%E5%BD%92%E5%BC%8F"><span class="nav-number">1.6.</span> <span class="nav-text">主方法求解递归式</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E6%AF%94%E8%BE%83%E6%8E%92%E5%BA%8F"><span class="nav-number">2.</span> <span class="nav-text">比较排序</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%86%B3%E7%AD%96%E6%A0%91"><span class="nav-number">2.1.</span> <span class="nav-text">决策树</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%A0%86%E6%8E%92%E5%BA%8F"><span class="nav-number">2.2.</span> <span class="nav-text">堆排序</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E5%92%8C%E4%BA%8C%E5%88%86%E6%90%9C%E7%B4%A2%E6%A0%91"><span class="nav-number">2.3.</span> <span class="nav-text">动态规划和二分搜索树</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%93%88%E5%B8%8C"><span class="nav-number">3.</span> <span class="nav-text">哈希</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E7%BA%BF%E6%80%A7%E6%97%B6%E9%97%B4%E6%8E%92%E5%BA%8F"><span class="nav-number">4.</span> <span class="nav-text">线性时间排序</span></a></li></ol></div>
+        </div>
+        <!--/noindex-->
+
+        <div class="site-overview-wrap sidebar-panel">
+          <div class="site-author animated" itemprop="author" itemscope itemtype="http://schema.org/Person">
+    <img class="site-author-image" itemprop="image" alt="thinklive"
+      src="/images/thive.png">
+  <p class="site-author-name" itemprop="name">thinklive</p>
+  <div class="site-description" itemprop="description">起初，世界是一团思索，它向所有的方向迈了一步，于是万物由此而生</div>
+</div>
+<div class="site-state-wrap animated">
+  <nav class="site-state">
+      <div class="site-state-item site-state-posts">
+        <a href="/archives/">
+          <span class="site-state-item-count">33</span>
+          <span class="site-state-item-name">日志</span>
+        </a>
+      </div>
+      <div class="site-state-item site-state-categories">
+          <a href="/categories/">
+        <span class="site-state-item-count">15</span>
+        <span class="site-state-item-name">分类</span></a>
+      </div>
+      <div class="site-state-item site-state-tags">
+          <a href="/tags/">
+        <span class="site-state-item-count">36</span>
+        <span class="site-state-item-name">标签</span></a>
+      </div>
+  </nav>
+</div>
+  <div class="links-of-author animated">
+      <span class="links-of-author-item">
+        <a href="https://github.com/thinklive1" title="GitHub → https:&#x2F;&#x2F;github.com&#x2F;thinklive1" rel="noopener me" target="_blank"><i class="fab fa-github fa-fw"></i>GitHub</a>
+      </span>
+      <span class="links-of-author-item">
+        <a href="/xlithive@stu.suda.edu.cn" title="E-Mail → xlithive@stu.suda.edu.cn" rel="noopener me"><i class="fa fa-envelope fa-fw"></i>E-Mail</a>
+      </span>
+      <span class="links-of-author-item">
+        <a href="https://space.bilibili.com/38099250" title="bilibili → https:&#x2F;&#x2F;space.bilibili.com&#x2F;38099250" rel="noopener me" target="_blank"><i class="fa custom bilibili fa-fw"></i>bilibili</a>
+      </span>
+      <span class="links-of-author-item">
+        <a href="https://steamcommunity.com/id/thinklive" title="steam → https:&#x2F;&#x2F;steamcommunity.com&#x2F;id&#x2F;thinklive" rel="noopener me" target="_blank"><i class="fa custom steam fa-fw"></i>steam</a>
+      </span>
+  </div>
+
+        </div>
+      </div>
+    </div>
+
+    
+  </aside>
+
+
+    </div>
+
+    <div class="main-inner post posts-expand">
+
+
+  
+
+
+<div class="post-block">
+  
+  
+
+  <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="zh-CN">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/">
+
+    <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
+      <meta itemprop="image" content="/images/thive.png">
+      <meta itemprop="name" content="thinklive">
+    </span>
+
+    <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
+      <meta itemprop="name" content="thinklive">
+      <meta itemprop="description" content="起初，世界是一团思索，它向所有的方向迈了一步，于是万物由此而生">
+    </span>
+
+    <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
+      <meta itemprop="name" content=" | thinklive">
+      <meta itemprop="description" content="">
+    </span>
+      <header class="post-header">
+        <h1 class="post-title" itemprop="name headline">
+          
+        </h1>
+
+        <div class="post-meta-container">
+          
+          <div class="post-meta">
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar"></i>
+      </span>
+      <span class="post-meta-item-text">发表于</span>
+      
+
+      <time title="创建时间：2023-10-16 23:11:19 / 修改时间：23:13:36" itemprop="dateCreated datePublished" datetime="2023-10-16T23:11:19+08:00">2023-10-16</time>
+    </span>
+
+  
+    <span class="post-meta-item" title="阅读次数" id="busuanzi_container_page_pv">
+      <span class="post-meta-item-icon">
+        <i class="far fa-eye"></i>
+      </span>
+      <span class="post-meta-item-text">阅读次数：</span>
+      <span id="busuanzi_value_page_pv"></span>
+    </span>
+    <span class="post-meta-break"></span>
+    <span class="post-meta-item" title="本文字数">
+      <span class="post-meta-item-icon">
+        <i class="far fa-file-word"></i>
+      </span>
+      <span class="post-meta-item-text">本文字数：</span>
+      <span>8k</span>
+    </span>
+    <span class="post-meta-item" title="阅读时长">
+      <span class="post-meta-item-icon">
+        <i class="far fa-clock"></i>
+      </span>
+      <span class="post-meta-item-text">阅读时长 &asymp;</span>
+      <span>7 分钟</span>
+    </span>
+</div>
+
+        </div>
+      </header>
+
+    
+    
+    
+    <div class="post-body" itemprop="articleBody"><h1 id="基础"><a href="#基础" class="headerlink" title="基础"></a>基础</h1><h2 id="数据结构"><a href="#数据结构" class="headerlink" title="数据结构"></a>数据结构</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016191822017.png"></p>
+<h2 id="算法性质"><a href="#算法性质" class="headerlink" title="算法性质"></a>算法性质</h2><p><code>循环不变式</code>主要用来帮助我们理解算法的正确性。关千<code>循环不变式</code>，我们必须证明三条<br>性质：<br>初始化：循环的第一次迭代之前，它为真。<br>保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。<br>终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正<br>确的。<br><code>分治算法</code>运行时间的递归式来自基本模式的三个步骤。如前所述，我们假设 T(n) 是规模为n 的一个问题的运行时间。若问题规模足够小，如对某个常量 c, n~c, 则直接求解需要常量时间，我们将其写作 @(1) 。假设把原问题分解成 a 个子问题，每个子问题的规模是原问题的 l&#x2F;b （对归并排序， a 和 b 都为 2, 然而，我们将看到在许多分治算法中， a&#x3D;&#x2F;&#x3D;-b 。)为了求解一个规模为  n&#x2F;b 的子问题，需要 T(n&#x2F;b) 的时间，所以需要 aT(n&#x2F;b) 的时间来求解 a 个子问题。如果分解问题  成子问题需要时间 D(n), 合并子问题的解成原问题的解需要时间 C(n), 那么得到递归式：  ![[Pasted image 20230519142006.png]]</p>
+<p>![[Pasted image 20230519142707.png]]<br>f(n) &#x3D; O(g(n)) 类似于 a&lt;&#x3D;b<br>f(n) &#x3D; Ω (g(n)) 类似于 a&gt;&#x3D;b<br>f(n) &#x3D; θ (g(n))  类似于 a&#x3D;b<br>f(n) &#x3D; o(g(n)) 类似于 a&lt;b<br>f(n) &#x3D; w(g(n)) 类似于 a&gt;b<br>![[Pasted image 20230519150021.png]]</p>
+<h2 id="分治法（递归）"><a href="#分治法（递归）" class="headerlink" title="分治法（递归）"></a>分治法（递归）</h2><h3 id="选择排序"><a href="#选择排序" class="headerlink" title="选择排序"></a>选择排序</h3><p>• Find a largest number in prefix A[:i + 1] and swap it to A[i]<br>• Recursively sort prefix A[:i]</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">def selection_sort(A, i = None): # T(i)</span><br><span class="line">2 ’’’Sort A[:i + 1]’’’</span><br><span class="line">3 if i is None: i = len(A) - 1 # O(1)</span><br><span class="line">4 if i &gt; 0: # O(1)</span><br><span class="line">5 j = prefix_max(A, i) # S(i)</span><br><span class="line">6 A[i], A[j] = A[j], A[i] # O(1)</span><br><span class="line">7 selection_sort(A, i - 1) # T(i - 1)</span><br><span class="line">8</span><br><span class="line">9 def prefix_max(A, i): # S(i)</span><br><span class="line">10 ’’’Return index of maximum in A[:i + 1]’’’</span><br><span class="line">11 if i &gt; 0: # O(1)</span><br><span class="line">12 j = prefix_max(A, i - 1) # S(i - 1)</span><br><span class="line">13 if A[i] &lt; A[j]: # O(1)</span><br><span class="line">14 return j # O(1)</span><br><span class="line">15 return i # O(1)</span><br></pre></td></tr></table></figure>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">• prefix max analysis:</span><br><span class="line">– Base case: for i = 0, array has one element, so index of max is i</span><br><span class="line">– Induction: assume correct for i, maximum is either the maximum of A[:i] or A[i],</span><br><span class="line">returns correct index in either case</span><br><span class="line">• selection sort analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, last number of a sorted output is a largest number of</span><br><span class="line">the array, and the algorithm puts one there; then A[:i] is sorted by inductio</span><br></pre></td></tr></table></figure>
+<h3 id="插入排序"><a href="#插入排序" class="headerlink" title="插入排序"></a>插入排序</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br></pre></td><td class="code"><pre><span class="line">def insertion_sort(A, i = None): # T(i)</span><br><span class="line">2 ’’’Sort A[:i + 1]’’’</span><br><span class="line">3 if i is None: i = len(A) - 1 # O(1)</span><br><span class="line">4 if i &gt; 0: # O(1)</span><br><span class="line">5 insertion_sort(A, i - 1) # T(i - 1)</span><br><span class="line">6 insert_last(A, i) # S(i)</span><br><span class="line">7</span><br><span class="line">8 def insert_last(A, i): # S(i)</span><br><span class="line">9 ’’’Sort A[:i + 1] assuming sorted A[:i]’’’</span><br><span class="line">10 if i &gt; 0 and A[i] &lt; A[i - 1]: # O(1)</span><br><span class="line">11 A[i], A[i - 1] = A[i - 1], A[i] # O(1)</span><br><span class="line">12 insert_last(A, i - 1) # S(i - 1)</span><br><span class="line">• insert last analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, if A[i] &gt;= A[i - 1], array is sorted; otherwise,</span><br><span class="line">swapping last two elements allows us to sort A[:i] by induction</span><br><span class="line">• insertion sort analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, algorithm sorts A[:i] by induction, and then</span><br><span class="line">insert last correctly sorts the rest as proved above</span><br></pre></td></tr></table></figure>
+<h3 id="归并排序"><a href="#归并排序" class="headerlink" title="归并排序"></a>归并排序</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br></pre></td><td class="code"><pre><span class="line">def merge_sort(A, a = 0, b = None): # T(b - a = n)</span><br><span class="line">2 ’’’Sort A[a:b]’’’</span><br><span class="line">3 if b is None: b = len(A) # O(1)</span><br><span class="line">4 if 1 &lt; b - a: # O(1)</span><br><span class="line">5 c = (a + b + 1) // 2 # O(1)</span><br><span class="line">6 merge_sort(A, a, c) # T(n / 2)</span><br><span class="line">7 merge_sort(A, c, b) # T(n / 2)</span><br><span class="line">8 L, R = A[a:c], A[c:b] # O(n)</span><br><span class="line">9 merge(L, R, A, len(L), len(R), a, b) # S(n)</span><br><span class="line">10</span><br><span class="line">11 def merge(L, R, A, i, j, a, b): # S(b - a = n)</span><br><span class="line">12 ’’’Merge sorted L[:i] and R[:j] into A[a:b]’’’</span><br><span class="line">13 if a &lt; b: # O(1)</span><br><span class="line">14 if (j &lt;= 0) or (i &gt; 0 and L[i - 1] &gt; R[j - 1]): # O(1)</span><br><span class="line">15 A[b - 1] = L[i - 1] # O(1)</span><br><span class="line">16 i = i - 1 # O(1)</span><br><span class="line">17 else: # O(1)</span><br><span class="line">18 A[b - 1] = R[j - 1] # O(1)</span><br><span class="line">19 j = j - 1 # O(1)</span><br><span class="line">20 merge(L, R, A, i, j, a, b - 1)</span><br></pre></td></tr></table></figure>
+
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">• merge analysis:</span><br><span class="line">– Base case: for n = 0, arrays are empty, so vacuously correct</span><br><span class="line">– Induction: assume correct for n, item in A[r] must be a largest number from remaining</span><br><span class="line">prefixes of L and R, and since they are sorted, taking largest of last items suffices;</span><br><span class="line">remainder is merged by induction</span><br><span class="line"> merge sort analysis:</span><br><span class="line">– Base case: for n = 1, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for k &lt; n, algorithm sorts smaller halves by induction, and then merge merges into a sorted array as proved above.</span><br></pre></td></tr></table></figure>
+<h3 id="寻峰算法"><a href="#寻峰算法" class="headerlink" title="寻峰算法"></a>寻峰算法</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br></pre></td><td class="code"><pre><span class="line">• If a[n/2] &lt; a[n/2 − 1] then only look at left half 1 . . . n/2 − − − 1 to look for peak</span><br><span class="line">• Else if a[n/2] &lt; a[n/2 + 1] then only look at right half n/2 + 1 . . . n to look for peak</span><br><span class="line">• Else n/2 position is a peak: WHY?</span><br><span class="line">a[n/2] ≥ a[n/2 − 1]</span><br><span class="line">a[n/2] ≥ a[n/2 + 1]</span><br><span class="line">What is the complexity?</span><br><span class="line">T (n) = T (n/2) + Θ(1) = Θ(1) + . . . + Θ(1) (log2(n) times) = Θ(log2(n))</span><br></pre></td></tr></table></figure>
+<p>二维情况下：</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br></pre></td><td class="code"><pre><span class="line">• Pick middle column j = m/2</span><br><span class="line">• Find global maximum on column j at (i, j)</span><br><span class="line">• Compare (i, j − 1), (i, j), (i, j + 1)</span><br><span class="line">• Pick left columns of (i, j − 1) &gt; (i, j)</span><br><span class="line">• Similarly for right</span><br><span class="line">• (i, j) is a 2D-peak if neither condition holds</span><br><span class="line">• Solve the new problem with half the number of columns.</span><br><span class="line">• When you have a single column, find global maximum and you‘re done.</span><br><span class="line"></span><br><span class="line">T (n, m) = T (n, m/2) + Θ(n) (to find global maximum on a column — (n rows))</span><br><span class="line">T (n, m) = Θ(n) + . . . + Θ(n)</span><br><span class="line">&#x27; -v &quot;</span><br><span class="line">log m</span><br><span class="line">= Θ(n log m) = Θ(n log n) if m = n</span><br></pre></td></tr></table></figure>
+
+<h3 id="最大子数组"><a href="#最大子数组" class="headerlink" title="最大子数组"></a>最大子数组</h3><p>算法思路：<br>元素和最大的子数组有三种情况：在左半数组，右半数组，或者跨越中点，第一和第二种情况可以用递归遍历解决，第三种情况则分为两个半边数组的组合，只要从中点出发寻找最大子数组，然后组合就可以了<br><code>时间复杂度分析</code>：，其中线性时间为跨越中点的子数组，最终需要时间为O(NlogN)<br>![[Pasted image 20230522103507.png]]</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br></pre></td><td class="code"><pre><span class="line">FIND-MAXIMUM-SUBARRAYCA, low, high)  </span><br><span class="line">if high== low  </span><br><span class="line">return Clow, high, A[low])  </span><br><span class="line">else mid=L Clow 十 high)/2 」  </span><br><span class="line">Cleft-low, left-high, left-sum) =  </span><br><span class="line">// base case, only one element  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, low, mid)  </span><br><span class="line">(right-low, right-high, right-sum) =  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, mid+l. high)  </span><br><span class="line">(cross-low, cross-high, cross-sum) =  </span><br><span class="line">FIND-MAX-CROSSING-SUBARRAY(A, low, mid, high)  </span><br><span class="line">if left-sum~right-sum and left-sum~cross-sum  </span><br><span class="line">return (left-low, left-high, left-sum)  </span><br><span class="line">elseif rightr-sum;?, left-sum and right-sum;?, cross-sum  </span><br><span class="line">return (right-low, right-high, right-sum)  </span><br><span class="line">else return (cross-low, cross-high, cross-sum)</span><br><span class="line"></span><br><span class="line">FIND-MAX-CROSSING--SUBARRAY(A, low, mid, high)  </span><br><span class="line"> left-sum = -oo  </span><br><span class="line"> sum=O  </span><br><span class="line"> for i = mid downto low  </span><br><span class="line"> sum=sum+A[i]  </span><br><span class="line"> if sum&gt; left-sum  </span><br><span class="line"> left-sum = sum  </span><br><span class="line"> max-left = i  </span><br><span class="line"> right-sum= -oo  </span><br><span class="line"> sum=O  </span><br><span class="line"> for j = mid + 1 to high</span><br><span class="line"> sum=sum + A[j]  </span><br><span class="line"> if sum &gt; right-sum  </span><br><span class="line"> right-sum = sum  </span><br><span class="line"> max-right = j  </span><br><span class="line"> return (max-left, max-right, left-sum + right-sum)</span><br></pre></td></tr></table></figure>
+<h2 id="代入法求解递归式"><a href="#代入法求解递归式" class="headerlink" title="代入法求解递归式"></a>代入法求解递归式</h2><ol>
+<li>猜测解的形式。  </li>
+<li>用数学归纳法求出解中的常数，并证明解是正确的。<br>猜测T(n)的上界，将其带入递归式，求出一个上界，随后寻找一个N0证明对所有n&gt;&#x3D;n0，递归式T(n)成立<br>![[Pasted image 20230522140116.png]]<br>![[Pasted image 20230522140235.png]]</li>
+</ol>
+<h2 id="递归树法"><a href="#递归树法" class="headerlink" title="递归树法"></a>递归树法</h2><p>递归树是良好的猜测递归式时间复杂度的方法，但由于构建递归树经常伴随简化，所以用其证明的话则不够严谨<br>以递归式 T(n)&#x3D;3T(ln&#x2F;4 」) +S(n2) 为例，来看一下如何用递归树生成一个好的猜测<br>![[Pasted image 20230523212855.png]]<br>递归树有 log4n+l 层，<br>![[Pasted image 20230523213613.png]]<br>![[Pasted image 20230523213754.png]]<br>由于根结点对总代价的贡献为 cn^2, 所以根结点的代价占总代价的一个常数  比例。换句话说，根结点的代价支配了整棵树的总代价。</p>
+<h2 id="主方法求解递归式"><a href="#主方法求解递归式" class="headerlink" title="主方法求解递归式"></a>主方法求解递归式</h2><p>主方法为如下形式的递归式提供了一种”菜谱”式的求解方法<br>T(n) &#x3D; aT(n&#x2F;b) + f(n)<br>其中 a&gt;&#x3D;l1和 b&gt;&#x3D;1 是常数， f(n) 是渐近正函数。<br>![[Pasted image 20230524215056.png]]</p>
+<h1 id="比较排序"><a href="#比较排序" class="headerlink" title="比较排序"></a>比较排序</h1><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016192215938.png"></p>
+<h2 id="决策树"><a href="#决策树" class="headerlink" title="决策树"></a>决策树</h2><p>决策树<br> • 任何算法都可以被视为所执行操作的决策树<br> • 内部节点表示二进制比较，分支为 True 或 False<br> • 对于比较算法，决策树是二元的<br> • 叶子代表算法终止，产生算法输出<br> • 根到叶路径表示算法在某些输入上的执行<br> • 每个算法输出至少需要一个叶子，因此搜索需要 ≥ n + 1 个叶子<br> • 高度 ≥ mod(lg(n + 1)) − 1 &#x3D; Ω(log n)，因此任何比较排序的运行时间均为 Ω(log n)</p>
+<h2 id="堆排序"><a href="#堆排序" class="headerlink" title="堆排序"></a>堆排序</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231014112423645.png"><br>最大堆的生成</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line">l = left(i)</span><br><span class="line">r = right(i)</span><br><span class="line">if (l &lt;= heap-size(A) and A[l] &gt; A[i])</span><br><span class="line">then largest = l else largest = i</span><br><span class="line">if (r &lt;= heap-size(A) and A[r] &gt; A[largest])</span><br><span class="line">then largest = r</span><br><span class="line">if largest = i</span><br><span class="line">then exchange A[i] and A[largest]</span><br><span class="line">Max_Heapify(A, largest)</span><br><span class="line"></span><br><span class="line">//Converts A[1…n] to a max heap</span><br><span class="line">Build_Max_Heap(A):</span><br><span class="line">for i=n/2 downto 1</span><br><span class="line">do Max_Heapify(A, i)</span><br><span class="line"></span><br><span class="line">/*</span><br><span class="line">Why start at n/2?</span><br><span class="line">Because elements A[n/2 + 1 … n] are all leaves of the tree</span><br><span class="line">*/</span><br></pre></td></tr></table></figure>
+<p>时间复杂度分析：</p>
+<p>Total amount of work in the for loop can be summed as:<br>n&#x2F;4 (1 c) + n&#x2F;8 (2 c) + n&#x2F;16 (3 c) + … + 1 (lg n c)<br>Setting n&#x2F;4 &#x3D; 2k and simplifying we get:<br>c 2k( 1&#x2F;20 + 2&#x2F;21 + 3&#x2F;22 + … (k+1)&#x2F;2k )<br>The term is brackets is bounded by a constant<br>This means that Build_Max_Heap is O(n)</p>
+<p>排序策略：</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br></pre></td><td class="code"><pre><span class="line">Sorting Strategy:</span><br><span class="line">1. Build Max Heap from unordered array;</span><br><span class="line">2. Find maximum element A[1];</span><br><span class="line">3. Swap elements A[n] and A[1]:</span><br><span class="line">now max element is at the end of the array!</span><br><span class="line">4. Discard node n from heap</span><br><span class="line">(by decrementing heap-size variable)</span><br><span class="line">5. New root may violate max heap property, but its</span><br><span class="line">children are max heaps. Run max_heapify to fix this.</span><br><span class="line">6. Go to Step 2 unless heap is empty</span><br></pre></td></tr></table></figure>
+
+<h2 id="动态规划和二分搜索树"><a href="#动态规划和二分搜索树" class="headerlink" title="动态规划和二分搜索树"></a>动态规划和二分搜索树</h2><p>实例——机场的动态规划：</p>
+<ol>
+<li>机场维护一个跑道队列</li>
+<li>未来的着陆预定登记到队列</li>
+<li>一架飞机着陆后就出队</li>
+<li>有新的请求且需要着陆时间t时，如果k时间内没有其他需求，则需求t时间的请求入队(k可以实时改变)<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br></pre></td><td class="code"><pre><span class="line">init: R = [ ]</span><br><span class="line">req(t): if t &lt; now: return &quot;error&quot;</span><br><span class="line">for i in range (len(R)):</span><br><span class="line">if abs(t-R[i]) &lt; k: return &quot;error&quot;</span><br><span class="line">R.append(t)</span><br><span class="line">R = sorted(R)</span><br><span class="line">land: t = R[0]</span><br><span class="line">if (t != now) return error</span><br><span class="line">R = R[1: ] (drop R[0] from R)</span><br></pre></td></tr></table></figure>
+Goal: Run this system efficiently in O(lg n) time<br>常见数据结构运行时间分析<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br></pre></td><td class="code"><pre><span class="line">• Sorted list: Appending and sorting takes Θ(n lg n) time. However, it is pos-</span><br><span class="line">sible to insert new time/plane rather than append and sort but insertion takes</span><br><span class="line">Θ(n) time. A k minute check can be done in O(1) once the insertion point is</span><br><span class="line">found.</span><br><span class="line">• Sorted array: It is possible to do binary search to find place to insert in</span><br><span class="line">O(lg n) time. Using binary search, we find the smallest i such that R[i] ≥ t,</span><br><span class="line">i.e., the next larger element. We then compare R[i] and R[i − 1] against t.</span><br><span class="line">Actual insertion however requires shifting elements which requires Θ(n) time.</span><br><span class="line">• Unsorted list/array: k minute check takes O(n) time.</span><br><span class="line">• Min-Heap: It is possible to insert in O(lg n) time. However, the k minute</span><br><span class="line">check will require O(n) time.</span><br><span class="line">• Dictionary or Python Set: Insertion is O(1) time. k minute check takes</span><br><span class="line">Ω(n) time</span><br></pre></td></tr></table></figure>
+BST的定义：<br>每个节点都有一个key,左节点的key小于等于父节点，右节点的key大于等于父节点<br>所有操作都是O(h)即O(lgn)<br>动态规划中需要找到比一个值大的值中的最小值<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line">next-larger(x)</span><br><span class="line">if right child not NIL, return minimum(right)</span><br><span class="line">else y = parent(x)</span><br><span class="line">while y not NIL and x = right(y)</span><br><span class="line">x = y; y = parent(y)</span><br><span class="line">return(y);</span><br></pre></td></tr></table></figure>
+<code>子问题</code>：如何计算小于等于时间t内着陆的飞机数量<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line">1. Walk down tree to find desired time</span><br><span class="line">2. Add in nodes that are smaller</span><br><span class="line">3. Add in subtree sizes to the left</span><br></pre></td></tr></table></figure></li>
+</ol>
+<h1 id="哈希"><a href="#哈希" class="headerlink" title="哈希"></a>哈希</h1><p>哈希有可能产生碰撞，需要特定处理或者数据结构，检索元素时间最后会由负载因数(n&#x2F;m)决定<br><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016200400451.png"></p>
+<h1 id="线性时间排序"><a href="#线性时间排序" class="headerlink" title="线性时间排序"></a>线性时间排序</h1>
+    </div>
+
+    
+    
+    
+
+    <footer class="post-footer">
+
+        
+
+          <div class="post-nav">
+            <div class="post-nav-item">
+                <a href="/2023/10/15/houses/" rel="prev" title="基于伯克利ds100的数据分析项目(待续)">
+                  <i class="fa fa-angle-left"></i> 基于伯克利ds100的数据分析项目(待续)
+                </a>
+            </div>
+            <div class="post-nav-item">
+            </div>
+          </div>
+    </footer>
+  </article>
+</div>
+
+
+
+
+
+
+    <div class="comments utterances-container"></div>
+</div>
+  </main>
+
+  <footer class="footer">
+    <div class="footer-inner">
+
+  <div class="copyright">
+    &copy; 
+    <span itemprop="copyrightYear">2023</span>
+    <span class="with-love">
+      <i class="fa fa-heart"></i>
+    </span>
+    <span class="author" itemprop="copyrightHolder">thinklive</span>
+  </div>
+<div class="wordcount">
+  <span class="post-meta-item">
+    <span class="post-meta-item-icon">
+      <i class="fa fa-chart-line"></i>
+    </span>
+    <span title="站点总字数">250k</span>
+  </span>
+  <span class="post-meta-item">
+    <span class="post-meta-item-icon">
+      <i class="fa fa-coffee"></i>
+    </span>
+    <span title="站点阅读时长">3:48</span>
+  </span>
+</div>
+<div class="busuanzi-count">
+    <span class="post-meta-item" id="busuanzi_container_site_uv">
+      <span class="post-meta-item-icon">
+        <i class="fa fa-user"></i>
+      </span>
+      <span class="site-uv" title="总访客量">
+        <span id="busuanzi_value_site_uv"></span>
+      </span>
+    </span>
+    <span class="post-meta-item" id="busuanzi_container_site_pv">
+      <span class="post-meta-item-icon">
+        <i class="fa fa-eye"></i>
+      </span>
+      <span class="site-pv" title="总访问量">
+        <span id="busuanzi_value_site_pv"></span>
+      </span>
+    </span>
+</div>
+  <div class="powered-by">由 <a href="https://hexo.io/" rel="noopener" target="_blank">Hexo</a> & <a href="https://theme-next.js.org/" rel="noopener" target="_blank">NexT.Gemini</a> 技术支持
+  </div>
+
+    </div>
+  </footer>
+
+  
+  <div class="back-to-top" role="button" aria-label="返回顶部">
+    <i class="fa fa-arrow-up fa-lg"></i>
+    <span>0%</span>
+  </div>
+  <div class="reading-progress-bar"></div>
+  <a role="button" class="book-mark-link book-mark-link-fixed"></a>
+
+<noscript>
+  <div class="noscript-warning">Theme NexT works best with JavaScript enabled</div>
+</noscript>
+
+
+  
+  <script size="300" alpha="0.7" zIndex="-2" src="https://cdnjs.cloudflare.com/ajax/libs/ribbon.js/1.0.2/ribbon.min.js"></script>
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/animejs/3.2.1/anime.min.js" integrity="sha256-XL2inqUJaslATFnHdJOi9GfQ60on8Wx1C2H8DYiN1xY=" crossorigin="anonymous"></script>
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/next-theme-pjax/0.6.0/pjax.min.js" integrity="sha256-vxLn1tSKWD4dqbMRyv940UYw4sXgMtYcK6reefzZrao=" crossorigin="anonymous"></script>
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/fancyapps-ui/5.0.20/fancybox/fancybox.umd.js" integrity="sha256-q8XkJ6dj5VwSvzI8+nATCHHQG+Xv/dAZBCgqmu93zOY=" crossorigin="anonymous"></script>
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/pangu/4.0.7/pangu.min.js" integrity="sha256-j+yj56cdEY2CwkVtGyz18fNybFGpMGJ8JxG3GSyO2+I=" crossorigin="anonymous"></script>
+<script src="/js/comments.js"></script><script src="/js/utils.js"></script><script src="/js/motion.js"></script><script src="/js/next-boot.js"></script><script src="/js/bookmark.js"></script><script src="/js/pjax.js"></script>
+
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/hexo-generator-searchdb/1.4.1/search.js" integrity="sha256-1kfA5uHPf65M5cphT2dvymhkuyHPQp5A53EGZOnOLmc=" crossorigin="anonymous"></script>
+<script src="/js/third-party/search/local-search.js"></script>
+
+
+
+
+  <script src="/js/third-party/fancybox.js"></script>
+
+  <script src="/js/third-party/pace.js"></script>
+
+
+  
+  <script data-pjax async src="https://busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script>
+
+
+
+
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/quicklink/2.3.0/quicklink.umd.js" integrity="sha256-yvJQOINiH9fWemHn0vCA5lsHWJaHs6/ZmO+1Ft04SvM=" crossorigin="anonymous"></script>
+  <script class="next-config" data-name="quicklink" type="application/json">{"enable":true,"home":true,"archive":true,"delay":true,"timeout":3000,"priority":true,"url":"https://thinklive1.github.io/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/"}</script>
+  <script src="/js/third-party/quicklink.js"></script>
+<script class="next-config" data-name="utterances" type="application/json">{"enable":true,"repo":"thinklive1/blog_comments","issue_term":"pathname","theme":"github-light"}</script>
+<script src="/js/third-party/comments/utterances.js"></script>
+
+
+
+<!-- hexo injector body_end start --><script src="/assets/mmedia/mmedia-loader.js"></script><!-- hexo injector body_end end --></body>
+</html>
diff --git a/about/index.html b/about/index.html
index 890f83513..1553c3f8f 100644
--- a/about/index.html
+++ b/about/index.html
@@ -196,7 +196,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -287,13 +287,13 @@ <h1 class="post-title" itemprop="name headline">about
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/2023/09/index.html b/archives/2023/09/index.html
index 3b8652fa8..299ca630c 100644
--- a/archives/2023/09/index.html
+++ b/archives/2023/09/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -481,13 +481,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/2023/09/page/2/index.html b/archives/2023/09/page/2/index.html
index 66efea99e..c69210cd3 100644
--- a/archives/2023/09/page/2/index.html
+++ b/archives/2023/09/page/2/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -481,13 +481,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/2023/09/page/3/index.html b/archives/2023/09/page/3/index.html
index 1ebbd39ef..f62970b22 100644
--- a/archives/2023/09/page/3/index.html
+++ b/archives/2023/09/page/3/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -341,13 +341,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/2023/10/index.html b/archives/2023/10/index.html
index f081a1780..4a443a684 100644
--- a/archives/2023/10/index.html
+++ b/archives/2023/10/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -252,6 +252,26 @@ <h1 class="site-title">thinklive</h1>
       <span class="collection-header">2023</span>
     </div>
 
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-10-16T23:11:19+08:00"
+              content="2023-10-16">
+          10-16
+        </time>
+      </div>
+
+      <div class="post-title">
+        <a class="post-title-link" href="/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/" itemprop="url">
+          <span itemprop="name">未命名</span>
+        </a>
+      </div>
+
+      
+    </header>
+  </article>
+
   <article itemscope itemtype="http://schema.org/Article">
     <header class="post-header">
       <div class="post-meta-container">
@@ -264,7 +284,7 @@ <h1 class="site-title">thinklive</h1>
 
       <div class="post-title">
         <a class="post-title-link" href="/2023/10/15/houses/" itemprop="url">
-          <span itemprop="name">基于伯克利ds100的数据分析项目</span>
+          <span itemprop="name">基于伯克利ds100的数据分析项目(待续)</span>
         </a>
       </div>
 
@@ -458,13 +478,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/2023/index.html b/archives/2023/index.html
index 88378b54f..b82d00fd8 100644
--- a/archives/2023/index.html
+++ b/archives/2023/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -252,6 +252,26 @@ <h1 class="site-title">thinklive</h1>
       <span class="collection-header">2023</span>
     </div>
 
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-10-16T23:11:19+08:00"
+              content="2023-10-16">
+          10-16
+        </time>
+      </div>
+
+      <div class="post-title">
+        <a class="post-title-link" href="/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/" itemprop="url">
+          <span itemprop="name">未命名</span>
+        </a>
+      </div>
+
+      
+    </header>
+  </article>
+
   <article itemscope itemtype="http://schema.org/Article">
     <header class="post-header">
       <div class="post-meta-container">
@@ -264,7 +284,7 @@ <h1 class="site-title">thinklive</h1>
 
       <div class="post-title">
         <a class="post-title-link" href="/2023/10/15/houses/" itemprop="url">
-          <span itemprop="name">基于伯克利ds100的数据分析项目</span>
+          <span itemprop="name">基于伯克利ds100的数据分析项目(待续)</span>
         </a>
       </div>
 
@@ -432,26 +452,6 @@ <h1 class="site-title">thinklive</h1>
     </header>
   </article>
 
-  <article itemscope itemtype="http://schema.org/Article">
-    <header class="post-header">
-      <div class="post-meta-container">
-        <time itemprop="dateCreated"
-              datetime="2023-09-30T19:47:32+08:00"
-              content="2023-09-30">
-          09-30
-        </time>
-      </div>
-
-      <div class="post-title">
-        <a class="post-title-link" href="/2023/09/30/%E6%B8%B8%E6%88%8F%E7%AE%80%E8%AF%84/" itemprop="url">
-          <span itemprop="name">游戏简评</span>
-        </a>
-      </div>
-
-      
-    </header>
-  </article>
-
 
     </div>
   </div>
@@ -481,13 +481,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/2023/page/2/index.html b/archives/2023/page/2/index.html
index 74c00d3af..007132be7 100644
--- a/archives/2023/page/2/index.html
+++ b/archives/2023/page/2/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -252,6 +252,26 @@ <h1 class="site-title">thinklive</h1>
       <span class="collection-header">2023</span>
     </div>
 
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-09-30T19:47:32+08:00"
+              content="2023-09-30">
+          09-30
+        </time>
+      </div>
+
+      <div class="post-title">
+        <a class="post-title-link" href="/2023/09/30/%E6%B8%B8%E6%88%8F%E7%AE%80%E8%AF%84/" itemprop="url">
+          <span itemprop="name">游戏简评</span>
+        </a>
+      </div>
+
+      
+    </header>
+  </article>
+
   <article itemscope itemtype="http://schema.org/Article">
     <header class="post-header">
       <div class="post-meta-container">
@@ -432,26 +452,6 @@ <h1 class="site-title">thinklive</h1>
     </header>
   </article>
 
-  <article itemscope itemtype="http://schema.org/Article">
-    <header class="post-header">
-      <div class="post-meta-container">
-        <time itemprop="dateCreated"
-              datetime="2023-09-29T10:18:45+08:00"
-              content="2023-09-29">
-          09-29
-        </time>
-      </div>
-
-      <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/vim%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
-          <span itemprop="name">基于北大前沿计算实践课和missing semester的vim笔记</span>
-        </a>
-      </div>
-
-      
-    </header>
-  </article>
-
 
     </div>
   </div>
@@ -481,13 +481,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/2023/page/3/index.html b/archives/2023/page/3/index.html
index 0013e6264..dcba15d4a 100644
--- a/archives/2023/page/3/index.html
+++ b/archives/2023/page/3/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -263,8 +263,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89rpg%E8%AE%BE%E5%AE%9A%E9%9B%86/" itemprop="url">
-          <span itemprop="name">迪瑞克拉rpg设定集</span>
+        <a class="post-title-link" href="/2023/09/29/vim%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
+          <span itemprop="name">基于北大前沿计算实践课和missing semester的vim笔记</span>
         </a>
       </div>
 
@@ -283,8 +283,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E4%B8%96%E7%95%8C%E8%A7%82/" itemprop="url">
-          <span itemprop="name">迪瑞克拉世界观设定集</span>
+        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89rpg%E8%AE%BE%E5%AE%9A%E9%9B%86/" itemprop="url">
+          <span itemprop="name">迪瑞克拉rpg设定集</span>
         </a>
       </div>
 
@@ -303,8 +303,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E8%BD%B6%E4%BA%8B%E9%9B%86/" itemprop="url">
-          <span itemprop="name">迪瑞克拉世界观轶事集</span>
+        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E4%B8%96%E7%95%8C%E8%A7%82/" itemprop="url">
+          <span itemprop="name">迪瑞克拉世界观设定集</span>
         </a>
       </div>
 
@@ -323,8 +323,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/black%20souls%E4%BA%BA%E7%89%A9%E8%A7%A3%E6%9E%90/" itemprop="url">
-          <span itemprop="name">blacksouls人物解析</span>
+        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E8%BD%B6%E4%BA%8B%E9%9B%86/" itemprop="url">
+          <span itemprop="name">迪瑞克拉世界观轶事集</span>
         </a>
       </div>
 
@@ -343,8 +343,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/cs106b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
-          <span itemprop="name">基于斯坦福cs106b的c++数据结构笔记</span>
+        <a class="post-title-link" href="/2023/09/29/black%20souls%E4%BA%BA%E7%89%A9%E8%A7%A3%E6%9E%90/" itemprop="url">
+          <span itemprop="name">blacksouls人物解析</span>
         </a>
       </div>
 
@@ -363,8 +363,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/61a%E6%80%BB%E5%92%8C/" itemprop="url">
-          <span itemprop="name">基于伯克利cs61a的python笔记</span>
+        <a class="post-title-link" href="/2023/09/29/cs106b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
+          <span itemprop="name">基于斯坦福cs106b的c++数据结构笔记</span>
         </a>
       </div>
 
@@ -383,8 +383,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/blacksouls%E5%8E%9F%E8%91%97%E6%A2%97%E8%A7%A3%E6%9E%90/" itemprop="url">
-          <span itemprop="name">blacksouls原著梗解析</span>
+        <a class="post-title-link" href="/2023/09/29/61a%E6%80%BB%E5%92%8C/" itemprop="url">
+          <span itemprop="name">基于伯克利cs61a的python笔记</span>
         </a>
       </div>
 
@@ -403,8 +403,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/linux%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
-          <span itemprop="name">基于北大前沿计算实践课和missing semester的linux等编程工具笔记</span>
+        <a class="post-title-link" href="/2023/09/29/blacksouls%E5%8E%9F%E8%91%97%E6%A2%97%E8%A7%A3%E6%9E%90/" itemprop="url">
+          <span itemprop="name">blacksouls原著梗解析</span>
         </a>
       </div>
 
@@ -423,8 +423,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/%E7%A1%AC%E4%BB%B6%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
-          <span itemprop="name">基于苏大ppt的计算机硬件笔记</span>
+        <a class="post-title-link" href="/2023/09/29/linux%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
+          <span itemprop="name">基于北大前沿计算实践课和missing semester的linux等编程工具笔记</span>
         </a>
       </div>
 
@@ -443,8 +443,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
-          <span itemprop="name">基于恐龙书和苏大ppt的操作系统笔记</span>
+        <a class="post-title-link" href="/2023/09/29/%E7%A1%AC%E4%BB%B6%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
+          <span itemprop="name">基于苏大ppt的计算机硬件笔记</span>
         </a>
       </div>
 
@@ -481,13 +481,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/2023/page/4/index.html b/archives/2023/page/4/index.html
index 4f1513f95..c66d9efa2 100644
--- a/archives/2023/page/4/index.html
+++ b/archives/2023/page/4/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -252,6 +252,26 @@ <h1 class="site-title">thinklive</h1>
       <span class="collection-header">2023</span>
     </div>
 
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-09-29T10:18:45+08:00"
+              content="2023-09-29">
+          09-29
+        </time>
+      </div>
+
+      <div class="post-title">
+        <a class="post-title-link" href="/2023/09/29/%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
+          <span itemprop="name">基于恐龙书和苏大ppt的操作系统笔记</span>
+        </a>
+      </div>
+
+      
+    </header>
+  </article>
+
   <article itemscope itemtype="http://schema.org/Article">
     <header class="post-header">
       <div class="post-meta-container">
@@ -321,13 +341,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/index.html b/archives/index.html
index 8367a4046..13277497f 100644
--- a/archives/index.html
+++ b/archives/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -252,6 +252,26 @@ <h1 class="site-title">thinklive</h1>
       <span class="collection-header">2023</span>
     </div>
 
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-10-16T23:11:19+08:00"
+              content="2023-10-16">
+          10-16
+        </time>
+      </div>
+
+      <div class="post-title">
+        <a class="post-title-link" href="/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/" itemprop="url">
+          <span itemprop="name">未命名</span>
+        </a>
+      </div>
+
+      
+    </header>
+  </article>
+
   <article itemscope itemtype="http://schema.org/Article">
     <header class="post-header">
       <div class="post-meta-container">
@@ -264,7 +284,7 @@ <h1 class="site-title">thinklive</h1>
 
       <div class="post-title">
         <a class="post-title-link" href="/2023/10/15/houses/" itemprop="url">
-          <span itemprop="name">基于伯克利ds100的数据分析项目</span>
+          <span itemprop="name">基于伯克利ds100的数据分析项目(待续)</span>
         </a>
       </div>
 
@@ -432,26 +452,6 @@ <h1 class="site-title">thinklive</h1>
     </header>
   </article>
 
-  <article itemscope itemtype="http://schema.org/Article">
-    <header class="post-header">
-      <div class="post-meta-container">
-        <time itemprop="dateCreated"
-              datetime="2023-09-30T19:47:32+08:00"
-              content="2023-09-30">
-          09-30
-        </time>
-      </div>
-
-      <div class="post-title">
-        <a class="post-title-link" href="/2023/09/30/%E6%B8%B8%E6%88%8F%E7%AE%80%E8%AF%84/" itemprop="url">
-          <span itemprop="name">游戏简评</span>
-        </a>
-      </div>
-
-      
-    </header>
-  </article>
-
 
     </div>
   </div>
@@ -481,13 +481,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/page/2/index.html b/archives/page/2/index.html
index f857e8262..3d0fcfa1f 100644
--- a/archives/page/2/index.html
+++ b/archives/page/2/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -252,6 +252,26 @@ <h1 class="site-title">thinklive</h1>
       <span class="collection-header">2023</span>
     </div>
 
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-09-30T19:47:32+08:00"
+              content="2023-09-30">
+          09-30
+        </time>
+      </div>
+
+      <div class="post-title">
+        <a class="post-title-link" href="/2023/09/30/%E6%B8%B8%E6%88%8F%E7%AE%80%E8%AF%84/" itemprop="url">
+          <span itemprop="name">游戏简评</span>
+        </a>
+      </div>
+
+      
+    </header>
+  </article>
+
   <article itemscope itemtype="http://schema.org/Article">
     <header class="post-header">
       <div class="post-meta-container">
@@ -432,26 +452,6 @@ <h1 class="site-title">thinklive</h1>
     </header>
   </article>
 
-  <article itemscope itemtype="http://schema.org/Article">
-    <header class="post-header">
-      <div class="post-meta-container">
-        <time itemprop="dateCreated"
-              datetime="2023-09-29T10:18:45+08:00"
-              content="2023-09-29">
-          09-29
-        </time>
-      </div>
-
-      <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/vim%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
-          <span itemprop="name">基于北大前沿计算实践课和missing semester的vim笔记</span>
-        </a>
-      </div>
-
-      
-    </header>
-  </article>
-
 
     </div>
   </div>
@@ -481,13 +481,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/page/3/index.html b/archives/page/3/index.html
index f216a090a..bd7c48495 100644
--- a/archives/page/3/index.html
+++ b/archives/page/3/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -263,8 +263,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89rpg%E8%AE%BE%E5%AE%9A%E9%9B%86/" itemprop="url">
-          <span itemprop="name">迪瑞克拉rpg设定集</span>
+        <a class="post-title-link" href="/2023/09/29/vim%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
+          <span itemprop="name">基于北大前沿计算实践课和missing semester的vim笔记</span>
         </a>
       </div>
 
@@ -283,8 +283,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E4%B8%96%E7%95%8C%E8%A7%82/" itemprop="url">
-          <span itemprop="name">迪瑞克拉世界观设定集</span>
+        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89rpg%E8%AE%BE%E5%AE%9A%E9%9B%86/" itemprop="url">
+          <span itemprop="name">迪瑞克拉rpg设定集</span>
         </a>
       </div>
 
@@ -303,8 +303,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E8%BD%B6%E4%BA%8B%E9%9B%86/" itemprop="url">
-          <span itemprop="name">迪瑞克拉世界观轶事集</span>
+        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E4%B8%96%E7%95%8C%E8%A7%82/" itemprop="url">
+          <span itemprop="name">迪瑞克拉世界观设定集</span>
         </a>
       </div>
 
@@ -323,8 +323,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/black%20souls%E4%BA%BA%E7%89%A9%E8%A7%A3%E6%9E%90/" itemprop="url">
-          <span itemprop="name">blacksouls人物解析</span>
+        <a class="post-title-link" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E8%BD%B6%E4%BA%8B%E9%9B%86/" itemprop="url">
+          <span itemprop="name">迪瑞克拉世界观轶事集</span>
         </a>
       </div>
 
@@ -343,8 +343,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/cs106b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
-          <span itemprop="name">基于斯坦福cs106b的c++数据结构笔记</span>
+        <a class="post-title-link" href="/2023/09/29/black%20souls%E4%BA%BA%E7%89%A9%E8%A7%A3%E6%9E%90/" itemprop="url">
+          <span itemprop="name">blacksouls人物解析</span>
         </a>
       </div>
 
@@ -363,8 +363,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/61a%E6%80%BB%E5%92%8C/" itemprop="url">
-          <span itemprop="name">基于伯克利cs61a的python笔记</span>
+        <a class="post-title-link" href="/2023/09/29/cs106b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
+          <span itemprop="name">基于斯坦福cs106b的c++数据结构笔记</span>
         </a>
       </div>
 
@@ -383,8 +383,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/blacksouls%E5%8E%9F%E8%91%97%E6%A2%97%E8%A7%A3%E6%9E%90/" itemprop="url">
-          <span itemprop="name">blacksouls原著梗解析</span>
+        <a class="post-title-link" href="/2023/09/29/61a%E6%80%BB%E5%92%8C/" itemprop="url">
+          <span itemprop="name">基于伯克利cs61a的python笔记</span>
         </a>
       </div>
 
@@ -403,8 +403,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/linux%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
-          <span itemprop="name">基于北大前沿计算实践课和missing semester的linux等编程工具笔记</span>
+        <a class="post-title-link" href="/2023/09/29/blacksouls%E5%8E%9F%E8%91%97%E6%A2%97%E8%A7%A3%E6%9E%90/" itemprop="url">
+          <span itemprop="name">blacksouls原著梗解析</span>
         </a>
       </div>
 
@@ -423,8 +423,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/%E7%A1%AC%E4%BB%B6%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
-          <span itemprop="name">基于苏大ppt的计算机硬件笔记</span>
+        <a class="post-title-link" href="/2023/09/29/linux%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
+          <span itemprop="name">基于北大前沿计算实践课和missing semester的linux等编程工具笔记</span>
         </a>
       </div>
 
@@ -443,8 +443,8 @@ <h1 class="site-title">thinklive</h1>
       </div>
 
       <div class="post-title">
-        <a class="post-title-link" href="/2023/09/29/%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
-          <span itemprop="name">基于恐龙书和苏大ppt的操作系统笔记</span>
+        <a class="post-title-link" href="/2023/09/29/%E7%A1%AC%E4%BB%B6%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
+          <span itemprop="name">基于苏大ppt的计算机硬件笔记</span>
         </a>
       </div>
 
@@ -481,13 +481,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/archives/page/4/index.html b/archives/page/4/index.html
index 4ee3ec13e..e6c011ed7 100644
--- a/archives/page/4/index.html
+++ b/archives/page/4/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
     <div class="post-content">
       <div class="collection-title">
         
-        <span class="collection-header">还行! 迪瑞克拉共计 32 篇藏书 。</span>
+        <span class="collection-header">还行! 迪瑞克拉共计 33 篇藏书 。</span>
       </div>
 
       
@@ -252,6 +252,26 @@ <h1 class="site-title">thinklive</h1>
       <span class="collection-header">2023</span>
     </div>
 
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-09-29T10:18:45+08:00"
+              content="2023-09-29">
+          09-29
+        </time>
+      </div>
+
+      <div class="post-title">
+        <a class="post-title-link" href="/2023/09/29/%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" itemprop="url">
+          <span itemprop="name">基于恐龙书和苏大ppt的操作系统笔记</span>
+        </a>
+      </div>
+
+      
+    </header>
+  </article>
+
   <article itemscope itemtype="http://schema.org/Article">
     <header class="post-header">
       <div class="post-meta-container">
@@ -321,13 +341,13 @@ <h1 class="site-title">thinklive</h1>
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/images/obsidian/20230519142006.png "b/assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/20230519142006.png"
similarity index 100%
rename from images/obsidian/20230519142006.png
rename to "assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/20230519142006.png"
diff --git a/images/obsidian/20230519142707.png "b/assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/20230519142707.png"
similarity index 100%
rename from images/obsidian/20230519142707.png
rename to "assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/20230519142707.png"
diff --git "a/assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/image-20231016191822017.png" "b/assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/image-20231016191822017.png"
new file mode 100644
index 0000000000000000000000000000000000000000..ac6bf1f4c2459a23d061dd927801a499e433e14b
GIT binary patch
literal 39885
zcma&O1yoi4_Ak0YN>D(hL|UawN*YB8N$CzzI;6WKL_tcrMM7x-0cjAoG+RJgx}+PV
z@7#LMf4q0^ePg^cIF9jyz1LpryS{7APtE=Mv69SXd`f%-0&)3~>_b%q0;?2(z`()7
zf!`#{;)){>bcja}@2k6~u8#ZJTr*FX*mN5m;EZz>c|m<9eEZ2*q0o}TA9_L=M@)Rl
zuNPV5<cVE>3%r*sqOSQ&y4<m@iAS%iXPRZJ^J<)wRRX`V;3X~ow~I{0I#>1b3-B#W
z^1`ZezBLT28;;K`jT?Hod5KI)Z2RQ$rf-$FQ;D=M-lk7Y+UnxvMRoD+Z0%%8lSo|&
ziYgOwTDbK6`*-`JT}$L{)r2QOmECv%YEex=!eItW{BZ6Xm4vT1XUro!`XFLS_@`?$
zn1GxZ4~tt+@MGfHdhNzcUyeK;PGIQL$V8lz$GwEutLT>zOSWM$;bFdQf2K0Y;_3mv
z8c`t*`+Edp$!%gR49x=406LPrdV9e)3kwT8IibXoWC<G@!We%)rv2Gf7Z;Z}C25Uo
zSQw?+m!z|<P_=3Z3uTAij(H?{ve}Y+cx$LG_#rV?kR<)3%a=1NE6EPl$72?Xbjop*
zK9qla+JvdCEVf7TM*69WW$B1bVrptox7h<aV&>&q_=H&IS5k16Q9`%zFi(6XUcP+E
zEi9a$XwFUX$z#V%^l&bQJEfac?ukp;*cx0MH^rqdPK!!8F=|&6I)lfmo?G{L&BtjO
z3#44Z!?NFB)#*01vbNqjS}9?}%z$%m{Db6*Qu;vJX*c@$qS6Po#&24g&v;(Hc!8l`
z=YD0&UH?v`fm)>4K80XJ%Zm%RKPD#|jZ3)h6Ho1VIxPQWv6-mTiBrb9?>}xQV{6NS
zgM%|=FNm*OGGK)aC1o=%A2EyLtQrenSTJ)JO~=lly-1&(`riw>h9CT6Y%ENj6}w;{
zG%t@OPxAp!(nCS2?`NmS(>sU86}s>*nRj@!<anLOHH7;8(8IPh*PFz6?>>BxNj9q*
zo8I%xX|xr%AuKEmFD7kP@<@*^C@6rX^B-D~GBTodPj8*?Odz-Ugp+u&&0UlReh|Db
z;*HLahG5aA1PS4OUAuP8eK!2A`h|A(hwz_X2kXew;{%83uh`w*Umd70Um#$;dWVK^
z?-Ot1#MK#ctxwb!EJuCOK0Q6Pu(Z5yZf@RNQH|bi@5D>d+lhw>-cxBi_7X0vaWe8A
z-8*;mSp{~RwS36%#gAzZGUk4D`Gx=;S(pa*fD@aRkq9}bzCWzk=H@0<?niGMfg7u?
zUOlF;;?Mn#^#(rc3yX+gAaDt(J{}=7OMTedktTO+hCgA@MB<8~Zc-7Vmn19efv_~}
zJ;IO+ZtK6=y$Tm=wb@@*Rtm5i)R55n{&_M%cSXdGGl6YUOqv*rO4Oa0t8P=W9mA!3
z<WlW;M1rAbUiKb53MSI`+0jo$tN}C0TdVOe<Ljx4j&LRw)<aD@qBC29`|IO+eVu3C
zZ`pnr^HJu|AtkrAJGtaDctd8*mY0`FTIZJs3WSD)`1!FB!}VTOge>eCl2(ZMqxA@C
zk!)R$r%#`HTyQlkacjmY(?(d2l$i>8?poY$W{jBq<hEgmXeuaaNOlp@6p6x?k>8t(
zQ8saQCdqs(o3M8U&hEi~&MuA)@AujoHeyrM=rJu{;RX%jm2{S>Q(iDTF<$I1eanVC
zSn&ZXY(%zdUSXP{1Ux2vi+3m7Z!QX#=vQMF4CwA%z!pqXk}{t~ei~a-MRYDXll|fg
z9}rJYOiUbbEl`22sHb;BHIIalT3B73w|;O?6Vc`|o+j*qKR!NQGtUGI7uf9YHsK-j
zznxm^?0wcaOoX$W8~LwWGKMkVXSe8*6yk6D48SdCISSELsC+)j>C-b9E#kF>Yj%Vc
z_K-nm=q^+#ZFBx@&-(K9EY>6i)&Nc)A0KQ#EyH7rO!tK(^K9|`&^2cRU#>nYRSNuI
z;>gxghuQCM`&p`>4qyc~OR2TQ5=-trq^`XNH!!<UDP5GshjYR7Q*kjNW6Z@~3z8-U
z-m)%T{mjRBF)=ar!fAaULuO}Z`zk#>Jsokn-?rcC$&iS=ao6r0Y?}?YVP<=~svAuT
z+$I(lcu+`&6vn=N!?K%f2p=8QEi|mBtaaPa9Qgg}A;a(G<+o??L&BXlc4T2l`?C`d
z%VS-v`}dehzW(_mxISJR!f!qJE-&v<uhv_#!%{3WtCyuN7Hb)X@ZiFxf;E<wk%?Ad
z+!^!~a$8R|+Y!=?VbkNjnWQiSdx?UURz^7Od#++i_R|=7I$}ht!|&g}@3E7$yuQYS
zKpgL{#aNxSMS8(&;MKh&BNy)zlUSNkqb@X!*Sh8GjQ{xY_%X4WvGKhln^Nu2V)~y$
zLm>|tGLzGjo@*9rzsSwatsA-^l3r0!VPR$U*6OZl!4=Zi5AFAsHGVbt++fozZ2BI4
z!(42}h>kc)_|$K`deN+cP@3%>-<>-c>5IL6eX4ymykh&qPd5*}VKoTyJ-DG7VCTR7
zTer(zBTZB}*b&+lRvIdkMzyX*yB@HhO<nSzTBe(}=Q~Sn#{_<Takv1*Cp<j-_sYrx
zZi<KSV`OC16ESVTNuKVpa2+u@fU^vLdipf$y^bDFQV<k4CnsL`Rn9x8EDxaA!5TuD
zVzQMX#^SqscXo5S<@f69x3)Gs-@{I$8TcUWD!a6NvR=4}gC#~8dlaA6;8D0*pjp&0
z@|g!pNNMR6*ca~G?Mz!8Y$g7)g1fuBANRwk<x{$I1>*zg-qqJri;0QBRra05vAse%
zP}S7d<}{)*BuaD{ufArMHr+k+PQD+KnMseVnbYSaA1u<tHD;VbA8l$jQsO%l#ZQj&
zavI_ngC$kPSC*EV=jLuPMB|N)j!x|y!cTTXEY|%dc-tLual**fz<YH5xw(v=D=Mbj
zqHp#I$F$$Vx*uf~*ZmzCMxKL85wK-FI)>((kD#mdg~qrEh3M(CXISWVMMxuxF0vLh
zE86Ug)Tn!Obn~4W1)7%odf&GPs+|@e8yQ6^rU*>Khy7k!>J>c;7IgkijA(ks)180K
z&x2c;?XlbOzAfTMy``0pj~Igeqgfi%cJqglvN~zvKDw)GYZ{6Nhu$;gDDi@1-;+NM
z4wDT&PSJdlcq}4~lU$flXQZ8LuJV)o6qnvJhtB-`87n9%%DyeirFb_<;r-+WdH>R9
z3c?Vnf`R;_^we=Xat^XEtC|z9*AFE}4F##lF5?99p_ZIOFI>0)uTJP|j<3>YXF&9>
zxv~w4iHfH3i*28Fkr0L;?FHGB6>?Ksql<1j)xQ5IO61#Ul$@^g0qHEvv6ccY9u91B
zy>^__=PnhYwOy_H>hPSfk!FF0gYTT>v*WiM;j5_@-A|8Ocj^TB`EM7oQ4zBB5Onfx
zpO{vSk*>7O9USxTT$hg=tn;25>Thbg*E@-dRr-)4n(E=5s`SA`V*V0NpxM!yYb`5L
zZog&kGagGNa}VW}y2Y!6Avv?};uZ<$B^p<Mbz%?~X|5CwrYQ>zDdN$`@dyesuMd|#
z;1{E~6k6-LrmBeAFHR*G_{IRJM|MO(S$U<BQ}bG@1>bvUZYo|&qZQVlMr@#Ko0VUG
zaqr$Tw<t{{n-!fD!<9eY;wLAI5?ZzoCT=ZN3>n5$nhT_qnxkke4dLEV5#mBi6+hio
zyLI(qUL}t8MC|K<-B+!%QhOVw0x3@fQb-jEdEqc$^f@<0ON3_9y3Jywb76l*SE3xK
z1S4Xsem=}np%U{{@2!(J+$qrKm(h-qyf?lGT?n3r;RYWO-~IB8NBxuDJBmnQKxwcd
z`O*=sv(3MMGZ$(WnAuX73=u%LP-hLM7I8)R$41VzZl4}Z%5YP}ZV$oU;Bz#nj3xyv
z0~JZ7E3=KIyi!$7ErxR?b|^mfsmDINR?A1mkXK1beCF2dp68WtX^o0QIJM$}t`$C7
z4_mImpi=F-cE1qZyi*U&YzrI@ngJr(pC0X%*#!b%WxzMN0&U@$q1Rlr3||Un{n^n<
zpSefKbZaCnF82;5_3MWu=W{$pzvkz-W~o|P4E@uTm@eU50O(QfYgC~8UNu$3jS%t4
zv@^c2b9Jmr`G|c(>mow4#E`?MXSMUytRPEMw)tb8n7S5+N{J?ga&ah)y}g-uu2NYl
zQjZtAl6c)`UNfn$h`B72`2RXBt>64gfH1>kf!6MnB<8ixyq%<(q0E^e&#xGH@0waf
zL{qr*O?EN@b~5=v-@-ENLa1*Vtp&x!N-kpi2L~<Bc<9N(@`{BH%L*lGCEtXHV<cX@
zN6O1Ue-kf&#NM#cx1P0ol`_ughNmZ7aYvb<B%aRik5AqHf*Zxmn^)ok>z@9J6hD$p
z?vZwlIncOeUaBoOT0FL<=~9=jz?d_oBlIcxUbW$ud9EXJF2k-7A@AJ1m7%8qM*zR4
z_%Q6C;f?xA=i*ND>=u;Ey2FK(P!$gNBO8a?%(si~^@iU}?!eAL(qa0SeSchR{MLIS
zj!i3c-KMs-R!?qcZLG>+_qWQD`^rdyw%I4fXxXlOE@q*KS#BPl_sKNSgATXn3zq=W
z!)6_>v;|mL>)e2t7nfnUl9#L1U|n2USvlogjzJsGp(jvq{6_Royft5^<RAwgrhv_`
zzq=^mhkl*Sia5C(Iy_0KjTk6klaK##8`GHUg3SBDiiSJS1e$XI-7!#x%W?H?k80|2
zt$Pw+VNy_1euaKo>T~SM;-6b()7{LY!%p@lBEqalNA1ye6CU@qXK4J(M~Q3>#LbzX
zYc6hXz7N-&D&a@N81sm9j^*>hTTx=ZlzVCLAQb6U5r<3P5f%>Z?NtHb1wRHCNRn3i
zYR#x_OglkGL~|hM1lh(axdh~#?}~~p=c(h1XAlJj1`2xr`NV3`n*6TVsIh^4h{_sY
zk6lwFX7Mn!f|1|~esH$;%9eYm@J9Qyw*lHg#Hv_UO0sCqRMtz0T|{By%#F}4H&g5#
zdv0ODd?ezD7c8k=?RcA!i3teCl(TTomG)gmqMzO;Tdk%e-}Rq#ANePVmjIVB=B6Ow
z&w3+$Q-SfCf6|lz9dT283{&seSb=WF$*_WwQar~vRqHeqCRGU=KuTGqr78mo73$l@
z#p#P<vs=b3FE7I$uPcnKwt=Gnc_mqVUs6KU-Q8`vp`5QCE&I?)&i&8k^jjHP8%xXR
z<m%D2{eVDKT^|Q{Slh$V7X$r-Z7@^t-Rc`5T8|9=CWXtXBPLv<j-I&W6u|Io$10zo
z(#7m+$4yI2>5a}8GyDvHxLv||Q2kczsz*4*py=a*3^tD@tMju{*&Nm63d_0H+#kMe
zW@A@GS{?APF!4fK`nD8vRN-Fs@|TG1{Z#8)H0IWJl+gLt@i`L+o;RMls&v!B^C<pj
z>cXW<mza-O^#Dw;8jRqGCUR8Pj~I7TDl%RJ94V(HZ(u;(@MnfV%KSX|y)OE0Q2i@C
z*@bh|p+<G?rBfU2$A#?!OU|4&yQKg%5gp>eb7>*gj~HV@qYv?~yndLy@q2_^Rh(Ux
zJY1Rp-wH@(^{+?Cq=S*yW8`x90u#2I9<as*v_I=B>}8OcEWEkt?dXEY2p5%wa_+F$
zLoKy<=(!)lxbchTUhn-F1;Y~ZtgI~VBn9k)k~jrM(uyKz3Fv;nVw@(IGj(u`!JI;}
zc*BRA7>|T%b7g%U2l1=Uqx{|c^~y$^Kny13^e)PWCj3lcOEwLOUO#~z5*Wq<S91Fg
zlP%++3<o%kFq0PQJYeWV*8zl?l|D2KXU#D)>Y9VSJ&eS>y{3R$;u&1lJJR=wH@kRI
zBnHP}d*>~c{5Q(;baqa5Q1Th&;l;S#S~nKjnKIbLpEx~i;L<(S$KY+%oN!hyV4>HG
zz}9@<YcXhM$8P@>c-kNka`k>H!jPZMZo+AUClfZ9*I_#X^6Q%fb}Gd`8HO|oRUy%N
z=eE?BgI#hnTK1##mpMT~!xAm4^|tL&QEu1YKQapsMaaUYS4YaRar?Asple}o_yM|x
zr@DDZ6xdHJ?{D>WGv8hdzD0}oupvMHM;<X<ghywp7ufpFe)zn-U^Zb+B(+HVjw!Dm
z9UU<qU7TF=k~6EJ?EL+=aF;c@BY}`Y88GS3Rg`LM>oEGkJCstul2cb1dNNFM<T%mW
zOHV!dAcWA8vn3$Jwbp=?xoznF7jI`7p+S<O++3WswYA%KZ7;mTV=yI9!e~PI?(;4=
z6-QJbtc@`Z=zFeJ4DlsAsn`aZDNr!=v=X6XZOw+*`{-5ZSJkD|Parl)81g`6#d5JH
z4SVnI;+|*e(^f($`*;HhTA$tMnUjkFbl6`$KP%9vw(Ms_Okz9Czxd`Z8UbgVzt2m8
zp9ux2q;6Yo!pFGFtem8+%hhn+q?7_G)+d`0o>U<x9Dx*$4L7J1P^1j)lkt)JjfuS!
z7tz819T{3?>WFahUUL?Xmdp7uIGC$*lPyW%t66#T;?9djkD!+6I<6GpXf%;BTbMLq
z$WMOfzKIHqd1Mq%%SW;kj0VknJL1@SCnh4GgP08DYiI+LSoYe!r(DUXylt$mrA01E
zLj*sX#rk=85mZ8sSa2v|9Dw(47pMj8?^(sWqluYkG2(iwgP_NDHeZdAnc8>IdSE}d
zn3P%wMAx~j#4ntES~I(G%1svbsG@fGm3PkDp|TFr)aBp5{hN*3Mq{JyP=*V-u2Q(C
zhk*1pU;CK(mP<oM($HLUygmjs0!>ua`?b647Sp|y?ii#i!;=OG-$p>M`P3DI7lUPx
zTmw2rzD5D)MC#4#_lZHE`vF(QYu+<;w6_xaZWF30MwdPT6qw-F*%zJjUteCnK@!L!
zNJR+v%<>c@DPFE|;7g(?wq$QlQJTDrPZoTkM@OE(da{6`bS7}M0@JWx9WD*9esTvo
z2(Vvx@XRkiEEx)eooF*shCNhb#Py|e96k$fhx5gr4n;*pj6{Qe4L}LI|35H(-YbCJ
zx<#5-{M&ZwEK0Q>h9Mb}6&SDhTL5#b8so_AUrJpm{R`M(g+W&<<xF3csv1k%Ikv0P
zoAWTlqC4dUW-z&dN;ce&T=eJ#s6TD5U13-|UaUQ6Qu<0wO)Zq~0x`hq883MMmRP)R
z<7A00lZZ4hgwhBA_oHjB(eOr4li=^4$JX9MK@_EdgYed`Qv5mfU8-yA@7@=QmSv8}
zM4GgFbP@0a1JNxStm_m?Q*tmie)rBrNm239Vl*{T!2m0qzJt5Fw$nIH;C&aH&k;8}
zy;kc!Ihk=&@a?=}4h@~{*r_w4#E+J}mF>i-TyO&Fq3XOfW15n6`YfCcK!2p?i163x
zPv|88s;0|M2A^?{ih?4lxUtK-y)q_gX!uUI>l=J}qmpsEgyM>a4D?5*zHkA|+s=1h
zhJ;8V%Ej-Fd^(OBbYKXII<&F3fBdWTX^534v|+ck(VXP;H3OjpN)-~Rv{{oN;w0EJ
z#x^#WJ}75sD)_AwRoSl$asU-T?p|Y3nu<{t@2$9|Es2*W9Y6=d%M(Y(tI*LZDoFSC
z_OS0xTR(r^3g{dVrnIzl6yUvNcI40B#udqe5h)srTe{l1JO?3bPL;MGw&4XJvU;_*
zKbp=Dm*|frr>1`U^T)l}Cw)E!M2iJ%%?G)OPmw(s{_nT-GKYoO=f0FXsoPx6)*n;4
zbrs~?hYucH0H#jRBR{fjSXozCK^shka-=?oodKHi(vl@`ovh4E464@5^78U*TXv%c
zD$tm2yS?KY`t|Egj(md2vu6*hT&_yW@_(_P#sqy42N##Lf70i`K)=TMVzcq%J7QzC
zj+~SIw{y^lfnI6`&60Gg$p6&T)acX~E?1mN_I=$Kx*-;*`1cxweNVo;&&XFLb>uX^
z_Pf)KP)?&u=%)xZD2UQo4w`BG=JIazLmGFERf=bgw6wGyOK2fSYu&hja@pN4ghCFF
z-1PJlgFzWQ`moD;f29s$Nx7?dSdaDeL<*)Z(hn2@&=Ex~t~wP^Fe#<_w?BJt9ZW1~
z_S)(%5ebUYd79?6GV&`l%1T8`E93$$;k&9TawG38sYfevj4>2cRNvqRJIhhi2eFH*
zU;8J>cO|z>|1edTl+2IoU;366DX#1IZa>L9{l1&q-GQ&LX|DbU-tL6b;Q_dzpr*z~
z0A^(%#*<C+j;YqL!rcw(!riDppg{`+&v=9iHp&qc1=Ro-pSgY%qDR;1g}BGeL2y^T
zjN4g`?(Xt|=IgpKQFLtK1YibEwY2oke@n=+IEdKXe0(73%HB5usCEVWp9WkK`xJ`@
zARMsQ87OOs$;qs&uRy`a{)9*Wkcs3k$3-Jl%%1}Tqy}R#m>WUF?`fC+bD4k52X!$}
zkYtm5&W|Ts!MM=q_uCAlwa{cUDtmU3#(VSr!>rzFSsERzvp=m8GcpoKS7<=xMeh0?
zSNUCNb@<a8>8qX@du2Oq^8D-o4R@`qtknC@w`k8xCG!}<x-Srk`Zu1RZp10!phau0
z@p><EzvHn<^^G!MFfHe28|V4COjj?8Zr*cnDFCD+n{<jgKOtJ5Y%EDWn>;_AOulL9
zbG%md=XAp_5@4q<=UW-F7ZNAaMB0@$*L_cBY1wjHXB{?0BY`t&Fq;N>FSZa#e1p}{
zAmV{e#~73M_e9{AZ%P`^YWmvg(2Ji_(r|=t<a>Dg3>ZCIuHWH&!k^`WlFe3$GnG51
zVO$N5Pk*En!7}GbN}Mh!JDmL4l4A;FCl+yA|5j{J`(u2(DDmviY-ASfCIbTlQn~B&
zlODe_L%7AoBW}ybGv@-`o(d!q|M)l`t=3D*W^(F(@du>|*b8#kZPJH4fzv>en?hYd
z;-B9XI*Rk({r&e1`85CTF`7ui+Xu3syN7ABlcfyQ1v6ZI4N|YB@b&CVWobiJqLZ;i
z007i4utwt1@7!<qF$tEWKUuij*k1b!?2#WoexUWO#BQ^0l@UDpc~bDI`1rD|!Y(1m
z!mvSdl~Gf>1}x<cY_RC)X#8wPJK$HlXf%19G^@C{_$v!T&Q&Z7r4QGDBmufdAb@m_
zkB7I?cwItl&V+Hz^rVTzDdb|#KS0xo3H}9~I2ov{@8{?=Wn^$cekHjpj`*Zoq+Rb>
zv3me}T`5gC*j<#f8?ADJXC$wPNq;L+_ErEm7rK<;cE-ktqM{;h%5bp7qGhqPiuG0W
zTgbw40$4a3+uI*4@ro68`+<;YYikRq1Ed5b$cI1(00K;SEK=KyRTlL<`uXrMidfPy
z%PqY6{`?jCXAM7Woh3tBGMTl@NGai{G7(hw|4N`i16IMPMYhh8+W~YxO1Pi(I#ug$
zx{D$Zwd0@;W_{rV{ey-W4gat)^TQ{Gctsd5U%tHSUyG>Q?UVnj>C5%&OiX}21JndD
z*CRjAdbg}7VH+NEl3dD3ezL27ZwxZ^;59IZJ3Ks?aAX9yXu~xwY*_byxQKvHp|ZR5
zK$a6AvnO+@ZqcS^y%6opKQh;}bE1E{l&&x-F<mesaA;+~r~cVGv<oOWm<U}xJ^lo+
z^C+PI#Sf`Qc;n1*Ml#c0m3-B(ux#)&GjsbDF^`dY;Zrw|h6)Do(FR7Jxfm!0V9q?Q
z+PlI-3x`@Fmrq|ryLIHdVp+Yfpi0W#e_;ij)nQ|z9`?O@9yC#(p1rp-_JY7x%X+wE
z#IxYYlB`*&8<em=SwFnbx_0C(p7$Ny?J!^5YhNM3!Vqy?{n)YaIH)TJTBU3T$Pr=7
zV@=ccu{R%;&+K^uEoM!-q>7xYAlPv^JN`<*#e8&X+!2lXC<-;UgSE95YDQE?Uy*X*
z2<UO(O!;@tV<OPR2Nb$|G%hYStPce%0f7*(9Ss8SM8j(h+FhE6n;f-pIw(nCyCM8R
zpJy|i!Tx_b1*B}6;1pa0o%yF(dY4xK9kXFuhWB>+`v#EWPJI0a54Ww$z(Ot1Dv>rf
zX9Cl-XCqb60TVc0lR^fmR*4}JWR+60Zc0!X1}c~~zU_el5qd_+vq1`4DEjZ<N%Sr8
z4HoJI!o%0?CAZ+F&2-?It)oPY1*nMyRAF1y@vzVF=1ZVcyDz4>eKJ9Y){W_Q&9$0>
z_ya6L*gOd~)aKrh5nC>445~wgX1+5-cdWRm2nkj}4&f?1^dILvhl~%76t)+f;d2*J
z83|`S?Bv7V`<K3*H8{-Tpsfd=<9$+ZBiynCmP=lKN$KhFeb+(sS^p*UtJY0<`CP@2
z69*Gx$w$VzK|ga|1?-gn7%;F%#<SnU!3KG^NFv$xi`WJ0-Vr%r2*FVgXo)ju4f)Qb
zT~(MUDh$M65-AmhTUXzM#EkI@)Z|dpQ{P5DB7cjjF#x0-HRE<j&kwn|4*{P73RI+}
zp&|1~CkOdCQAt`g0zv}+vH&0Cg)Rj#r~ZFR-?wf1HxAf}+3K@F0|xvGD3S^e)iV7F
zt$Y8&#--XMLqxTPaBKz+z^u{Y2*9kWK12V}$@})Y)^U@LS6pk++BE=5G=9XQ1DHJ^
z4tEBQYB5nF_sGc%ju!J9UIi{S@*qv=1FIOw+0iudzWZD|zFKeA*X_3I4<^(UH<p*L
zav9X{t?X%DJ3M^mai?6gS5-m0zg)B<foOi%#T-mN(CS~dJYhj~_VZ41=#)J?Sx9-V
z-tXe84#e%LXM;6p#!H96aoxJ6o`O`GVzaQVkZvPBNsAuHO80bfSUJ9a4VxqeKP6+!
zC#J7Xl911M9v$0qQ)C~cbR8<(nZKg<VZbUb{ldsjI54Q1lAtK$)BiiN4aF^W^g+R5
z+_kE97Ea^;jl@s3v6TJLuZj^PlrbK(=IYgK$#g424y$yyqJ`$&Zc{OJ`l1Gr$C9(I
zXJQPl>+tzDF4sN}YN7pt9ng#lgZ;;G9<;`DL*9(>jEC}PusOhTAjQBrtiKn@SB^W<
zHG7Llp`BJ2?ve?bWdMr^MLc175sD=K_IC09p~Rs_=WQeL{#x{c@gA`4<UAmW^Y|R)
zZ%~15d$(xoC;0)m@0@AJ%HDd22t|aSwDRny(w#e`o*JhY>9bTSJdya(?q?5FXl8Ts
z)8{uQBj14OkcCM_n;kZEG-_FReA|C?_JFEof54dAg64r_+sqyE`-P$VuaRvcqj3is
zU-Jje-fC%F4r!6HWg`nSUCRh6IsiGG%PK8MJtb1&O#7(L_tev1(6T}oxSai;%_kZz
z4iU4P6J8q_iA$n!8V=^2w!glp=vJZ~NWLDR+|PJ0+I+hgzb0E)>eM*1AdJ1e^^?u`
zD8ULS7bs=t?+&0d2EA;!)~#e&u>F`)1Z@qy10NNf2b9=BDjyVIFX#mD05;*$di&?)
z<)wBrw0C)cjgg!`YY4jB_wUj{l9_J@OWZtSxoCNyMfX~$*EG!iwSME>?34iqvW(S&
zs2#$$5q@{#$I1FYfz}hAB$DnG!3ecCFH@90Kw=|%VH_Yigc7h3-7g$NIn)Fr0NlBQ
zqMdEoY)ni|P2D#skfJ!65Jt|$Kyit+k9|_>uv{&3z87Q=v@ii6cAyR(2t-u!k86^$
zLK;%U^1ct^y_WMnK)=}hsitgty1u*XtTF~7)+cRt_|X~j?7y7Y<p#TIXb(axOY{n7
zKNx`oFkusWi)Wa`enHnwRF|^v_B90W=@rs~^73mqf%J<}KgzE=*i~BYAETwlk0m8C
zx2~$3K5Z@m8RZ#IUbU^qJ%W2ZzASBSf)NnXXo3wf6MQ>P?#WoC?d{9jk0Z93Gql-p
zGElfN?b#z6agdm3YC?bxTehD8XzSK-Ezah6q#P&!JGhZx=3l6<ug_oFF7w!19>_lg
zTGzMOwcYTOXFghnrgzmZbj`fsu<H3_PmLW1w1+KsDrM2Fpat*9)(a3xnVz10KPZn!
zU#`*{F@F7!i)1@N3XINtACSri3B3rK9jJg9s`uZF#^W?<5M9~3s;US*<EDXD`Nd17
zHJ*F<yFyy`OyQ#eFCff>PuV~36CZ;F*9JEXA{Z))L|B-AerH978X9Gm<)A%Zg#AL-
z^*qMJUjXNylxicoexW|9*`2yLJ41Zq0?0MXUF80J!_77wQI4@Pho6i(#zsfWIMozy
zz6R=7(Xn5Q(e-PRh*~%Z7IYGDWay|OfGxN%XqQsY)f&>k)@I&dQ^}1D7_dO?KVWQi
z5b{&F6+|qiA*IMJbXY>>2>1#jBCs9P($Z>d!br(LRg=ASRmg}0FG+c>v0+K2{IOvH
zEBRqd_(X*&KDhGJj@6LkX>v%lQ)CHirind1J_e-pc87N06D!w;{@3W_&i)PVYi+E1
zw==2cqshpKb9&QZdrRnUP<rjJVsNXy1jEAe=x}H8N!3`VCvAEGPY%f{t{fVC4ZNG-
zFP$53g`SYFDG9QpJXbvy;?LT1zXH7?Z18~9J}6BGlN&}^nQ6@Aq(nKko#e2Sg~gF@
zN8^^t8E6RsH;0ornDnCsnY!}l=jFSNhl;^!(yZM;y+GeVL%H|8%>GHa^yPWY>c!j4
zw5%z>_V%~ytr5Hxx^Ow@vH?wZNoZyU8TMzd#Lpn!StDP8MT#N%-NH&xRA_;_Vj-JW
zv22Es`!qJP4$S0%2+Hf%d*>H8@i0fn#$bsy_s5>Asa-0gOX@b0%D4ypp3Bl_+h_uR
z?Osi0W@ff687pWI;0K_IZ3wNeHb0S8wQwra(UV5wMaUVU(;BDLk*x&925qrfqO3nb
zcU-X13nDK2F$X~6U-}Bs^>bK}G3FK01o6(o@MD5pJWEcLTPW0$IMrS{vX#$diHD{S
z&ltW+|B=g4{d0)&D;^W5H{^mU1C=Fz!89St(O6>^V`{EFMym01XZx`WGoN68UmwrP
z8tH6Kf}x}+%@Eb)Pgk}3D`4H{4dMfS=kTU<_Yuf&CRN~uwX@B$MsDkrn_c!#x*{>(
zt@jxV^F_7nRcMuL)f4<YYZLW)M<=7!CDY$tU(*rc;gZVfh*kY$p5l#)380G=rG#L_
zoLVWJCQs5gs80xlC~Ed=FhS@c>|!u`npVe*tjC{?L{;iib6zWp0?98=KogYy)>)RL
zV|H#j+W14bLpqHunEKE`4va`QfQ$;I?cLY7jKMxttMp}d%e|)|0W?P%uhr6Oxxs+%
zJEFc@VMZi%b#?J3j78p>==<+6$qbOSt%fk6Q-l97gIF?Os=+N>0g?m|1wx>S;3Yyr
z@M)9}oR?H`yDEx{IT5_5m}+7BDxgXgRs;IC!-&gdHEz8E#`ei>T=?5xnhUzXK*`*8
z$X-`6Z8gKm_Fh{-U0H&|e!zCG3@u9~J@}GS4A1BRFhkx8f!aZs9lc<?6$Oq2$hw4x
z(0j4oc*`~w;=sYM(-+asAad7RkyrxQY~jvag$hqUOXEx4lF4U0I(@%`$`#8`UR1$J
zlC}W_6iB&@_8sM~1tTrM^M#Tm6!>yGSwXk^5q`J1XS~cIuuRKaogmx5#$w%nK#T=y
zD&$*Iw&Cuzk!%-d28%J}sIrJ2{mv5di|TaaLJjWPRhr7(7NR0t^5_GT)2y6jKSN9e
zf`XP4eBrl(x{PYDOSNkq%uGx$1L*D%V?AWJ0zYuvLdcasNrEN-3;JibUzwkP)PrPl
z-mw{eX1CBm5}=OJzK<kamSbn;Q)dM&4gLHiBr}OIU-<8`o&J@8Nt8eWj(cf5`RPgE
z?$rxjzX}aF6RaAcOac3{o2X-{$1Ar6%jTn%3y>!Cr|MM^0%_L5#<CGe*<Bd}V?tx-
zB?!n`Mn1t$TO;y{m%M$Lz0VF8br#!Gc!a44;cSO(1OVY7_r!&T@l(2Spf`lHya1YF
z(izXuCn}KEzDKMhm%OsP%+1YBcRCKyAxIRWWoGd3J_6nc;e#`Lx1}x6>}Q6i1AuxA
z;|1+nea`N>Q@HL62(WC;oZjjm7V6JmiISkDfe?YG15iD*b*iWs9-9EBpt{Fvv_lVA
z>a#r+)4+F6I7KH;5q|zSC*Mli7BjtE#N;W3-@&>;w~P64X+zY;B5Nd61TZkN8v~o^
zKwB*JK6FH{Iy6D;QWL2jU0u+VZj?R*HTbh`5d&(6!9VpJ>LwcW1L6gFx^4y9bm+#7
zOE_rN7dV1*?RcLvG+ymVbYJ!YM4g<W^g#-KllZ)9>_3Pc>HFvOOqGa;erBov19D=*
zaKJeO#Uy^bTAsfINdj^p;~%^r0ny01(Rscl$^{zrooLxPeH0q}(Ez^yx&aB1*KqXI
z<YZO$6o8E%`t!aNLt+9Dy_Cwy`dPF`MqAzf+|q)FVGYr%_spPCvkank>P$|zmp~Oa
z0T`b1`hOJjDn242qA;{({bt;*YQ{GXjtClhO-Pwn4h;m9kOvc9%KY^O1@d*yOK&;H
zKHiGQg%>*8p;x0+JG<^CihN|Q!`w4L=5RYxpCOtU@-oZGF2ZTpaXCB4x3}fLJ#RRa
z<~InDA(d<s)$DP*%(3d5v4Ym|Rlb)WyD>yZrQhV~yyS6R-6m<~;8+7i16Sv%^dtE>
z9NrcbZVjQY4Mqwcz#REAYyr-gxfEWcCqPY2z54<d)W9wX;OnCm^89}_Tz*IkjXcng
zgGe&aXn=yJp<k0VEL?s-CIPf}$SsxV6!DXV-6zJP2$z=f+V!5inXPT!liEByOrew^
z4(ivS-g9)WNi`&^3nFrx;3iJ}*_t(dL{ys#Y7#vjCR&>)De)ezz`W-|9rvJkMQrHA
zX6Q)&$=HzGnEpt$6O-%OXfU8g<Zdgi9~HnXRU`5pQns7JVtVPV*4EZ45Kh}HMa7{y
zG-ybzic6}i_kTPfnuaG%yX@I(6Hi6O%lRiN!Ng_$pGIq{lRvIJfl9*v@um3<Nm-Yg
z|5L(#G!Q`dUjf_nn}hyf%G2T$Gm!6k5`t~GRu3Cw+Pqtf^Hgbt7mjq>6DDkS!Y=nL
z74?l7UHU9dlWI$Y+DmhclL>ym4Np>sJTVp&aCGF&baK$9GuG-JN+2joE`RuU5GW#O
z*-n)MLOL`)yS@2D4Cq*?<{tlF-4_1%P&t6EX=N{9R?ykil_6SoYN|O<&}l&-Cq^0|
zDDFQm8xBK83c5`~C$_PfvmOFaGjM^A&&uH7bN9P10{=&UP?#KKcxIl%BeZOv2wLG@
zX7XQ0AH)->9Dsb&_7tFlSXfy2cbgSBzlArG`2X|#(XWt+>`g}7haCUX4FAqt^8b(@
z7lMLfM?lbg1?uL<T)z#k$xh+ZW?b5DMrYdze-&a-e$iS*!S+uOecuVCMaiKR+OyNi
zb83k{%|s;qejwJW(cE@|C?w8%W{@vUw~WsBjQ$)?o=4E0ZHB}t;nQm@c5*d7gp4<6
z&&_g7!BHM-D<zHJ(MR-jJ&rv8Lxgy&cn%7&^3R_?Nh&VGLaCaaANZYz04~$yKSf8G
z2bUmV2wLNw{;f!M%q3^a^KGv4fCM979sX1F2l5Bz1$9+4p3HOoS@b(I9|-J%zdbs5
zz+;Y<lV{-s3Y~d6W=i}{+0M=m8fQWER>_G04fYYx4JgJ34KgLIL9sJq&l{0dlfGeF
zTMpezjmP5~B>jzt3pY+$Bu*ZvjJ+#}jbhzZKHpWQxN)PvnWqi26cY2RqZI^Tx`ZwP
zr4;n^^6DKJ(D<vLhtPQ9_4oJZzq5i}jTWV~m^FgfslZ_W)1Pq`WOTZ$^>2MXNSv|&
zW%w~Xti6;?%u{0U#UA6uJp@Rzp-USL$DEu7HQ*C`O!QsoN_s!(m8bkSX#JlJx%V$i
z@ZXzks1v9S(g?pIF&19H<DTySOe(+*iNcmXpwna~k%ags+*qgwk;%!F;C;5N?1B8;
zWLI^Q1b?Ys=kGrM`%jtw(r9UI%d|ggF|hsF*Ue4tE;C+8`!X^z+HX$X&sJqYyi<9J
zek}gIM^?p|z~o=54#a!wq2d>_f(S_6g6s=X$!4f5kUnz~U?Rb~f3)t+o6)cIKkrrT
zcD7b>hcG0f33Pt`3qt?WG3cQL$Po?h4X?S@zvcS?g{{u;c}~pz|9N8>-4fZiBM3oY
zAPzPrQ8kyqqjvuNc<>Mw5bUjzTiw_16GJ|H0yNM6oF-uS=01*B70yelh<kjLQn#+Q
z*Q5ev1W{3=|7j@&D0I7WJ*hAj0qypm%kl5}+5&R)GPEJ?+qVeF4w7Td7JOEmUXb`l
zP69oGs?#?KWbA0wS(vmF1UP%DkcbFEz!+$q5%KByq_}>)r$*^2=!)Q6G1)#fF=1Fa
zQTTtUi)huer$-4Xei2PiSO#cn9cEwhm4N$*AQ`jy`@r}AQZ72&{tR)NrZv|K2ymGo
z!uko831Ba>42lrQX?<zd691_saCa6ij9ZzA9sF|YTZAAXWWNf19-87*!F~MXdwNv3
zLKrM*FG!``;4K8#&MhSL8iafByTKBLpSq*v0{ClUdOAR&fX;bIhUmvO<#0j?Tt<Vb
zT#Js?Xe4Xd=zF%4G5a%54R9{0K4-#beRi@3@V`Olly0-nm6h)s8)+dDWR6PL=-OCa
z#cFj>^_<%QyBE$sIVA-e0~dB3#4V4Gj$lqDw4p&97H&xdZX?>zr^6fm;&2ma^aYSe
zz_ORBxtNy?(g6O{Rmt6JuOC7ffHmz+J{caC;~*u|yv(BUlXpC6QLDejt2TRuiZ6`^
zXoCa;n&y#6oLuI=B$bD9A$Wlh4=3>}_p|xd`0^zVdP_Hfn*lM10Eh#$SXE#q=3V^m
zK$Y&j{ixg4o(i{o<V_$h(Skx4WUwL9<*>7$2+Ix_+1c573g{++Tg@x9o(g^;rC17z
z@S`OGpg}w%n9l!ZEFj><uM9zJetwoC3a};6mjx}wJw0KcAhFtie`6B;;6VQ6>$E-G
z-lrgB#@R`tL(#BErH=C*LL-I@(V&`3@+5Vo6z}i5ey*y@0$pWeTbGJZM&+0cKUlpJ
zKII>#)}S;gP2}TJ^YRiA8`k<^vn^k}6wR2>nUnt_#S*rk`FTv2NlzBs6(nSvVF}Ap
zI#=jO@E;wFq2nSDBeZz_99838ks7EP38M|)pf|b*4Z?1R<v|IBx>c}zR>;^`Fgf3K
zU+;~f!@IqRl<X*!>~7^L&|P<$*IcU0mx|=$zk7Gl$1go{(Oo>AKMAS?25&_W=zlo~
z0`7hpO?i0&8-cMxLJ|V;_CTqP#&hw2W;&=f;8#Ou!Kb<Y*m~|EBQajn;?DGN>C^lL
zHxMEE7MGTm7!DZj4rU~#_F4pu*nCeH^UAgaBn#UW>;yD_Km#8wEf~Q;$6{8;Yqcu;
zwga-F5-7|5fWWnTaDW=w2MY#L4z;OcYu_RC4u#mPo}*+)Z?oZIfIs-kDh}NkO(3yB
zT@OaPS@`(n^F}^<8lOLZo`Q6F{=GppWw8oon$>~<UX-Ys%Zp>xev&Zc)RueMnRW{w
zAD?W+YbTv959jV=ej#gBE-Y9)y-J&;7+a9YcK7#Z04KoY72*1?>OiiBKMaefwUj+C
zXj*@hH~ztfz<r5))n(YbKr7T-a#XtUIr<lCtC`jQuJ_Oi2MZUOt{JJ7c)ZSleMSla
zT)l>yp`2pO&<c7S35E>bI#nOKM=U<oiFq_cM}|P}(|%=%;Bh-G1tOe43mY4CKEISA
zbdWZHf8=O_br8T9M%U_t+?pEUOGHF1YpyH%VUneDWAlPap2pk%mFN<zg4@nZlMT1r
z>z3`fpKU?BhvNG6yc*w8Z8~qDl%Y!?7eR@T7NybZniV7jPbUbPNN<)*&S=7$ZnMB<
z<0k8pdd;(MF;df@AOs*yROTxb1X7CLB@`i3Wyb9e>U`Y`1V9jJEi>)p%g89x!CRyQ
zpOoU#Oq`ZsuWecgAvKKgrQAhX59sE`bg+HyV*TmOUQYJa$L<bLTU;WVZ?Ge_C&m_5
zgwmgzDl(1>yC%S?fTjn-A1xro=0qQB8|hRF`;^2&Gy&$WV%lRXD#7BEQ6aK$GX1ag
z)~#zGpTHUCd;1#J3mQIIrBZDL%3C1LV1SGoYR!<OAa~l{POAWqn)+Cu1z&#g&BK$f
zjd->--3zy$Il;7>=+?Ju$wMI{HZRB4q+vP;opZF*L!Tg!!tx1}A;?2u&ywn^Ip4X0
zg#pp#{E-fv9%KGdplBM43?%sI6iSnV5a5Xz{*3WPKUx4pAe3r#4e?IGK9#-2!(@q0
zKTuP{G?@LM>0AYdPz2k@R09PMbz&?ek)^K3n<od=P&(10g`3Bxss}jm5P9GRKRKuY
zo6VA17e%JqY2Hb+z0(>0Byg~8!_7v5iHT`zK+7o4>h;3thDqrxpO{$DXuKv3`vMhW
zbY2eX0cdmOhR=gjFVsi$LIpAAN#a8#iLPxwrJsz~)UhldK|gqq>}|+5dK1dhKOzp@
z0C`UyQd2@11@orD+&ed+YUpg(>ULVE$s9Ue5*e~Fz6FCglPR4%rUE>;#T|DO)#zK*
zeGMkT+j8--m>*N9?kMa!_CFalTfD7zU4XWuu$tMLCnIxs=V-{tujr7vXue$RCb`pO
z++w)BVBr^Wd>=v<^}i#6J+(xh*(@aZ7?00Cb(84D$Ms8cS(o+JGsZ&+`390aU3flj
z7gm|;>adE7E%(S}12#PMHITtD5P;iM`R8oT^EupQ^TUQ#;*xWqlbXPNf$5u2U20&M
zFadT?UOtS$6O}6gEWWSXD587lsF((HB}31p+ft+OJaA%DIKF<!0Kx3OkMDI;m6$4R
zMgpLW;|2Ib!hZ@fm_oG1BS-l~I(j+a<MIgzn0R|r!FmDOZ-OlglHrfOzJS-SFCrhf
z!ZiV!E7q?LfaV2F7HG#ih!XG7b#4#C(;p4f7L6kk_1gw;ryvcNjlh&wv$ZYC|6WRC
zDeQM93UiK-s4L@a83f^32!d}}?@qN9Jaz$~$4B%=-;{AYOP1j0556fAVGQxd;ZIL4
zz<3tKBhlkDV&?e4lEY=D1Xo{UB_}8U`1vzvwl$Is$2@w+vmSmQ_IVx73LPi}2~=I|
zCgdd3#^U42psz#EngwQw@V`6ht>&4i%oqbp*91d7kVnt$cs_0aCAQ_Guo7^bFK!#@
zR(jj_uBvqjA>J|bg46@O&~^RSMFe`j3&xsE4kb}93|re4cOYrWu~NFUy!;jNtt1EK
zutt`imEupUV1+@IB#nJ32i?ltqbesys-qkne;C{PI^7adzMrzN<(_>^Q7aAyevO{?
z5q}E$4w4tZEBZnf<cm){=3zbr%!jCAC)e=u<3IXwEaklrvT|DNVcGW>uW`}2AR0`g
zcIa~XUIi-nbAG#qna}Cokf860psubidMM1&2kg~kUkFonyCDxBo5j@@K0(o<2kCZN
z;nHDRH0L-=|JK!JxKjYaSjNd)TU*ikO!pqS=cMV70Kt1DW#xhnL_HQJ#_F%?YfudO
z#9=b{3AE|Z`CYmGk#h4bFb>QvE0F$oYhPV_1tUWkvgaVJm^6&7#V?q)EYyy#7j_1<
zJh7~{7u4VMuJj3Pe!SZ-FQ0%kxq|TuVi~^=kyPYGr?=zWU}n0ss!EH0d~xSBO8mIc
z>S$}W6$$=xw^ZM))f&h~n+T_AcBLdIU&Z(vJzPS312aJv4y9r+nN;TER@o_%rUVx3
zGexh4m1G0+!#)@Sk^=P!Mw%c~7|?H5HAbLYssF!AE`6yVTEW?y;2Npt-VudJYxn#=
zx0!##CwQ*K5rWe?JJKwcW!mi63Cgf#K9&_yZhwT4ssE8)>Zu}G?W#mJ#B0axAn}OS
ztN6zOHKHe?l2<-!v%l|OQdhVEZZnAE%MGld??L7&7w7uq#gE#_w`OoMKrRHT!YJ$e
zDvdTF<6&{VB2A=^xKl=$5bk^J(K{xK3`6|g>nht$F!5BL?v?w4Cr`WaXrSa9<Sl;J
zD5<a)D&W2o_5(v~hw^EsIn9_&XZf++0`EQHv>sjGS2GF?Qyzvc;#Xe>Ss6GP<aX_!
zpfxE`l(~U<W~(|$SgkZKsjAt?-@N9MwzUD5Zij{$zkoof-=7v*X9IJgj%1qyy`uSR
zuY({w$%o?dx{J#Fam=ZwxpAyP4`#O@H}^ZCl2|^{m{z%JrCn89)9(MfdQ|iCn-w6v
zV|f@MkCDEL_4x7HD>*1q8d~y&kGGe<1$9aL`8DR(<N?wew`+x2Tis0cc}6@;NDdo%
z%*Pd4ay_Gl%sY|9iG9yJXpGmCMPC5f$T-D6#5nzL7GTvJI|pS_N|&ZY{(04;$#-pF
zS#R@qZ&q^WWTT&vlgGcL3K~`&F*(P>QMyy^x)^PsgY(OUJ_5{<W<wCuvReN+I+{-*
zlsNL)@)`shHBb*4PuHGnXzUTuioXGEv3s-^Mw}s?t<n>n2EQxRU6d@b1d@I^1C>y&
z{L`f8e%^4oN%3ejfO42C{=Kmg0+HdCX}B-nVWh<|olA4<S%Y|_*$#T%y@$5dK^x|R
z7JMO^nkwd{c_(sK5a=IE@uU4qo1I2ys(Y839H@?tkD)l1<ywM{j?PKXctb{S-j-9V
z2wY3nxIS+#w%x?#%qX7DmA&`1wKt$`z|<$;S=^pfp_l_*gIA`ScT5$by3TBU$(Mc)
z48v=q{zIYwH@Cmb%AjSs5$Mce$hS`4S|!(O<30m_9e;|ydIVLh&!v9;Gesw*!O=Gm
z*{>OTtyR>m#Xx2y+?X4W?tuA493AT8q4X>y8>RLt)a?F^^?p!F>+qU&6Qt4@k4RM~
zge~7dlZcLh0Suj?`tXq(+!e5AR}?)VGva=Jdf-$XsF8$nGYWmk02g@cm)%{^JGPcS
zWRN*?9Rmm7;VjpN;TDsfh3@25#TBYDaqBsWfHr_DMmzK+zd$;GGvfz|%><UHZx;r7
zC@$fQR~?L)XFOROt*9wU$Q0ET{?LCBTzD9Cm;$1VKwtWF^<ugjzlfPnaG5wq#jUHa
z3%ldyZ!&U`0jTWqYUEg;iVfZCe9NV{I*(4cLs9zTx~AKVYI^<feZC>ZqAE8<5Zqsw
zl$W9P34;HV0LMb2RUz#Nekre|oCL>Wt|SF3fy=t3CdfL`?*VkOH@Q1I-@%j@^NJh3
zSgt4Y=PsDAhDZhI?=L1dxC9d`6Fb>~4MLc;Zl^~CCXKj3&E_pMYNUaIq}b)t-Tk$(
zFJ1?BgJv-AJc0gJgEG5<sN;2gxaoq9b9nG|0AVsT9#~CXJ4Sqz9KTzaO+F#)p*t6^
za8w~R2Y+Av24P%Cp#xTB`-7OH41Mcjaree{!X^af1|ATsaC66u*x;acz%79doFII?
z=bJFuAijxdm`Pd6gUWzlF^g_Z0GnW9!uUPtCWF1#sQ)=!Z!4w9iq%=;T+-?AG{%ke
zMQKo;DCW5#VKQTs%LdHTz-0DUNYVc2?R^1(R-5q}Qd&rk_P9(!*fZts^Pa|QVd!u&
z7~F+I$}0&^;f6uu(d>?zZR*;CSwAwE3Xvgg+jSQ;T{1F;yZr@51lCuunIo6mr|p?L
zrXVScPVN>JDfUV*qjm({H;pw2$#^G8JqhKIz9*pZcZ_6~(BZl74QM^7&;_2|T_+KX
zIVo1KkUwAX!-499pi$w|W!M~#=DGC<6EFTyZ|U6Ef5NqX_xXhSTq7tL05!TdNIVtx
z9$O@l;s@IURR<Yqb+XZjKQW4owftvbH~=iPyy3pneU}uK1IiA1)X=&9pt}O-0BAf^
zBCZO1XK5UQTKM~C8EZa`x*U~d(g_Peg><N)C&%G8?jjIq2O%qVDCn&lg|<z|>+KsJ
z3tXuIbW`1TCx4#MfE;B%h49~yR_R*h`?0b&gCsXnH^qx-$1-Ld<(MQBA!9dAkjqi;
zz5rx*X3M?#_(KkOb6Y~?xiBOOEEWI|jTm=KYMF}}c;X|4X+vhoE4p{s5otv+D1Clv
z3fJ(3nn^SqfUrkgF}>!guof>ij7LPaI^nF5r+@<Gy+2}}Oub{}@@8aY<h2E#uEqmI
zIZwy5eb<P5KkUm*c>b0e3_G%pWEo?UCFmemfEKU6xNp5T@q~ah;7cB@c0H0%G29#z
ziR3a$9T?I_Pg`SjIb)trhtQ%GbD@+C1TUBJ{KsA)BlyCSfpYd%2RMCn6lP`=$RS91
z$)+8WWS4NZpkkIyUFi)Kg2yVm3m*#;zL5b5+N?E%RAI%@)9gZ%xAVG^EpZY(-hgQb
z;gMzdYJmN<n#tpZQQ+d`gnf@WVd1TEGCzQb3BvKa>S~=KM(?oF!rt4jkoemWbU;sW
z@6S#-R)d~|556eqbOV8nqL^)-y$9~1f&hOJ^PRT|UYfS}rU7q~^75+vDc}rFJDiS&
zjf}4&HDL%z6!_sFUPklif`|*z?~h5Yng*_r<^vK5G_7}6N?g<&W@rGELMH@`20eie
zGaWu)TCzlBoJ=$8ol}58j81c&t*@-Kz*3=yao~$hehv=K?4TqPk{z$UM;ddZznp}W
z9l}9h{LUK~wDG%s-ipGlhi^z}nT|?s@5%uq@(E;%@-drN_Q=%xqff1pij0In4uhCK
zE9Ni=rVw3g0Zpo0T(sO;VCZ8=*k#y#FmeM!EsSE1nPMJ+*V(P>1ZM*QTl7%B*$Y}c
ztTLRd6-SStGu+1gCK%Cwvh{+0t<AL3auk#))jak4S(2oI+aCd=V8LxzsGovqqWt7S
z=&ztpCle*IQ)IPP4=ykALVS6z&9Gc!Rmj-P>kWLP2gHORJ6$Z4QLlb7$0QMb6gw?Q
zI8<!VdF*&cK;R|RzHE~Rm0F{KeL?i&lUbs=aYK!N#{;6_z5V@JhpAMrA3A#-a%d&-
z+z>?-=q7-qB?`1Exs%*W;d;?1OhMi<&+xf-#=}O8hmKu^QbO{W<2hYeN8v_tuo<uu
zKv#FV&B~|Ixt_w(Z$~lx1)>nCS1po&Z~LGsoEB6X@CJI!Qu#Q7&vv5jI!yOu7zC6@
zB`BgK&g<+X0ysy@%m&AM%n@|L0AeA42Ahr##&3`&(b8v4=d?atT11DCf4dVvzw#ub
zNKG8j%`@tHhBPJlEdBNb<y%+#EO@}x+dV!_zM1qa_raMD2e5!qnUnJ?6Fdj#<YWA_
zhasini}0ywn2Os7Zh6vcRl(ZVv{U!nS-3nx5<-xL!b&#T0bQrJoIZ@oFhRf%!jD%W
z_X3f;oM_o$W~Py1J%Rk!kkf>rpV*L*nz@@(pbpC(TyV85bFmI*)L7kS7fZ6Ng6}I4
z<{*>rxguJmS+Ky&4YP8T(~rfMe?h*_c@6Ui6?Jg<B~{A-0pU#M9x4d|{2R3yANrRH
zv$D~%n>}2ePH-tZb!E}I!!`4ri>x8|^Ki~yJe>z{q?+f}26uCEU)w5&ooGYQlI8NM
zQDv`J{_V(66Au}tXDIAd+8d_o;)>~!!`1CnNw33M+tP2&Wm#Rngagj*qpZwQ^8}lN
zALuC3IT)?GZf4bM2gjs~n!XZ0DU&oBXxS&96&n$;PnI6P6IDzaW8SCw<i*Z*VGb3i
zd$2QtRw#R$n*8zZxtxr=GG5hhFB$9FNo0wZeTCqYxyBY}n01XzO**9I36f{q`~q0Y
z+oBnJN%TAEU=aiE=id>zVX5l7u4C9n6|H>c`!)%;e4MS*AeZF$S4+AF`0=sNN0?J}
zTRjC@W5d_mig6F`aNP1UV=EtiWwGjBHru-HwCeN7`o=ta`7TA;r(dSw%%Oc{+hu`i
zOhr$>PuR{M2Kzv`mMy(Hw0?tU+by7LFX4!=BZ8$fgq`Tq$w&SGlRQh4tQ2#RbY$vN
zX<ysrJwwAH({BAYO4>I=-+z?hW+%bV8(m<$dJ#a@`~M6iNgaYI0#%~df?Y_meem|A
zKv>;^UKJf)UkPq-b{Yo?Oi|zFxs}+1fw-db_7Rigv}$VA>;E_37rv4pbO}aonwT=Y
z1Axk-OnFF$xeThedAVcUMz~&h>X+xdHF|p3m;QS1CVXL#OSK(9I#8&l502R;a(&SX
zL4`Fr5INF*TE7zq5I5h$7Z^#hs1@Yp-Diky^Hh#KKhl#;@2ogk=uRQ9I-?Ai-hwF*
zBYuPQa{`Xp?Hm?z2vUGKnijg2-;ssb{NK#saJyqs@;Os``U83oan}6?jaT|B=i?i`
zT0h=VLl&?gU*+CTQh^g49wz0D8xB)V7~|3s&Vp0`J~UO*w#o9rgYY}*&)6(5I+YvR
zi;p?+)oJt5^j#0D=0Y)wB^_)`OiTnw%XuA)ySZ3?<sCCmuNKbTDe5{}QuYgtj=lnF
z%yPrJW7K4o|H+2;_K9lSHnOAQ44REWt?Rr&E96hMAkSsp6SLSNnUN+pVy@|>SR$^I
zl9B?}mx~vQSwpBZ8K%@>%+(mOymwB=-6oMxz}1Ud%Iet`-|NAU{d-$+oKiA2h?77^
zUs5$*sxDUTPM{;R#&-Z9C6qTx6^7ibYCPrGa72gMK^hwAS9^t)>tUX|rjA=njRu=c
ziP&2F3RdPjl?ISh;$3z}k(~d&|0+SW!?3S&?=3HFp!QBXn6$Vj5M1l7{RMS>3zob4
zekkj6@i?6wj#vB{-T;iy-wHM{?+b)evwLf3$G2<Hv{XBPCaK^TY)!0E=j&-OltG3G
za}~>foGZ_0y$)!8{q$KR`d_WRc{r8r`#!ofsYodbDP>OPl$p{ZLuE*jDO2WDBxBMb
zLx##&L_`RgGLtbvCCN~xOvyZC9{2h5e%|kK?BB5W@A&S$j{fL<W3A_T)_q_1b)DCF
zp4Zyw{a5TNVpSo!ay)GmS|i7VbB%g!Jg+Mb3gpBv*2ZU0Zwc$(5=s%&T=S-1L;0fb
z(TFMQ9z&Iy%!6Wv;{FGC8Dc)hT`#-9^~&#H&J#cSFvG)2HM^vL?rQ(?>(#*am%C~T
zbhX;XTd0rxat#QOkr+_yvX>cfy_k3H;IXTn%t2TD9e_Zi=!4*u5441k^mhv{uSggf
z{w_D1XV}j6-k$J`f&TW%zN*Am7m|ep1$Sg!m;o$wXfim8b*^~)mcaLeam>vZH&9E*
zF<o)+*W<6o@oJLErw(5!Zgkvc!)*k1E4b=cu<xdA*mn0oWr~U-&y9NJ%lKfF4vEui
zk&%(%s*}>Y4~5i*b96Zc?0o;A<Ra}UIsUL}8(ngehr@1vvy1}H^E@F&*<_XA47C<P
zA9*r)3s+d(xmcy6w8YDQzbJ<!iS<9PSheuV|N47yH9q-2uXriW4DbKExch~OxB2IF
zC{T&_-``MnK5b0<{-TZ!lWjrGT=H&9@dm|?8;xfaRaE{QLaRGsC3F`@#r-Y2mZJi9
zah_I`6Cs;yPZRK7N2N(gt8TjU`gq+lKkm=ScHSXxPOS4$fW+z@x`I=O)?lLZ_qWkA
z>7H|2hKlIPj%^LC6~k1qrR$nbkm;V1+n0p@AFk^^H=<r^vh(4;ccQUBNc-O#37-1@
zeCxEd@q*CIyle;`5%k_!ZXr@`mCY$h&B_{k->72`Bk=^e`^A|9Ouc@x?G^$v+(P8p
zi(wcE86mi-muS89efTh@aq!7L1v%~13v_$-upK#aWM~7#_2lc<uYb%LP~~x#ZAa^B
zta#4gW2E>lNKMIRW}Nu7^>4abTfHGu=Ma=zi|t6j8hQHkse7&o=;u$LZc(Ru=@Qr=
z_p(88;P_imucmJ)14>@VkM`|~ce?#c(I=K+CVy|r*j`nKGjYZjMZen|8!UPzZg2L%
z`tf7M*?cCdjCpEMmacy2rMK+}3k|I@-9tRCSoNP^5uV9!R&1y;&HDbLaWLKN6YlA<
zxw%Paku#fnw6-%?;V+u3sw?F!xp_ji0v0G=UikB}GgK$FD(PH;aZYh}%7w$b1q_(~
zj8@$REP*gbXy9S<grt=cp<W2oL;8uM_P;)!xOwyDx|h@R4{t4wLkbu!dt0W@F27zl
zMA_5Nj~Z(8Q#1QtdK#ov1IjkZO#SggXK;ybdy;lb<<gN;%4sd99L65JUaC5$zbi?*
z`3#b8i8S=USnmBUinr^a^GQibN&GBdY!HaZXIyr7<B1lk+_A#~0@c7w6`1R_%ZUA;
zzLV&;aP#ooRgT|U5T%oP)+d4|TW6c6+#R&J*d^(hIA{PA;d+9DgYU0AgA`vqx*ZxV
z3tQVNRPF2EWFh7On&?by%-i*P%tZgBi6^%&fz;qy#^>%lNVqoq4s}QC=xlHv|LIp-
zYG^#Xy{k3>4j?F>9tSpaA3l5!#0iZgYS&vQb`&*3&$UCI7J!UAYK6?q%%V^)Ws-cY
zRdy^Y;KeogrQG6|GNui}@4PoILzKB!)x)`2u5^XrkUE_ag#2rVLzKZ-#-Xsfy82>#
zuGJ(kCN_4ROR)@RM%-5X%&`c<Yp`_f`t}_6n>UYrvvT;@b6t!XaK+<-5jr}$`ADs?
z-d6N50mjeY5cp7AyLFzi{JZ<x$+@|?muYGBT*qz?G*8$IYma!$Iach;T`JuBTYG-#
z<Hd^?!=;=vrwey|l9{>j`^&+;fdR^n1gmVOkdP3-9utYGKem}?eMeVf-GQR<2Lp@8
ze~({^>(OtypS41!O5p#~H_qT4`+G)zX4&9U!Ht@MrS3N>cef;rt*^4h*Q}Wwfy>}&
zIWsngUi0?+K&f8at5@e1&upH1_R;3pdIkyGRkF?;g@+#hDND;kIM_{GY)<XXA=Y*x
z{hmF&kn!HZ6X)h8k@|l9VigdmHy@!UPS5e;J;-K`<7sT&x)lbLf$i;j(NxV~HW1EW
zghL!rl#Q?Msk=bz906EXu;1ErVu#?>&Z4}^8xVwiFct3W@876bU0jTfYXlHS{kBZ5
zs?5R$qJemKBNc9%RsZ<R+?-0k*LId!$zMK8tpV{|9t5qn-F`bn)PmN{yr$S|z@;dv
zDY3{5hU=dlr9%F7!pzL<bX5{S0qr6uA+kF8#0iSbtgH-RMu;4Z!{Hzn;6h`Plc^XP
z8D$2HTwPr?+X59(kz>VP8~n-<-70let(|Z%wOjyJb}y%NhrIft0k3xYai*5buoWYD
zpkw`GpuE%On8{?%djcj3`2OzJ(xZ@&{-d*>73T)80keI$n{R7=CkWEWnC_(Kh$HAR
z5j*JXxCK_L@R1|&?Df~IvVT}(DW^M4_Jp@bzAt>^W4h!+XRH4Ul+ZYds+EXzt0o>i
zEG5xykGVM}k9wJ@BF63Pkp=bpC<Swdo+-xbbkL2>p3Ap|UWDL?pyrFKzXr;WshOEe
z>cAWGcAuYMeMGzPG6Mhz7cx;Ot<+?9h)#eRYq@cT-*{*dKdW!@9s{ScY@mD5cK6DD
z0_+S@UBC_L0hBsRwh%cBF6-ABoJ32(0=hXLXW$@5E?z-<Z4XHc__b<2boYnq>+2nx
znwuAG5(*33ID%^QAZ3uL^Y!)BLoTIW&6E_xrCMMr{Iu(GL#3vsW}gN(ol$CAXXpOe
zg2&tf0**DN!YwE?>iQR5)|MoXMUnDq>*`GQ*MqyRj|y^b$$j!`SJya<Vc+1L7I_cz
z@i|aT;2Eu~@O#R2JFbA#@F?SfggLnTgSEIA2S>*xUPLiRdV2bW;8S+)ex^$e;HCM`
zw?j3%ZFt#kZERlB-0Swc*jUz*HeMbcyYpIFOC7U{CH7-^<qKEvvolL=i~<A<u7Cdg
z`Ri@&4i4GLiHVAfXRgDS<|f6&_k^aVrZ?~$jGm#~v}s-Qt|+<DLZ_CaYzP4gF7GxZ
z*DXI!gUXNM_TGw>fW=)(9edIWI3Holv=olNi%6fN;%sm@muMpKWHiC9LqyNr{atcQ
zOxbv*h5Ji3aWA$719^>lcJRdPQnfS66N>Wlzt13@TnMHt(4u+3M;xp?%JDmepQ2&4
z&7dFW3~tRp^##sKNIr+=lwviK$mh?~LovT^F1!Mg_sFy6AER&T7rPuCyq7&Z<3iAs
z^Yilw)p3ULMqn`vnbzmj)oDSD-AQ-Z?Wl-|;p*~&d$rAC+S;N($#6ZG0pp8^Q}Xii
z>YrW%*XK{sFKoUly7Bp0FSPCCXUNi>ZK@BDx-Ud#Rmfg4G9p?g^>g!pn;$xB$v8f|
zqsDi}BTYBL&-3C|dG-5e6Dn{#+$sn@6rvm)7Ph3n29Abj{UTIf5O#gB%4Q4T>U8*|
z{hC-zp!5B9*uV9zM{{$tcU2bEDRzf0Z8ViatQ;CG(w5|&3SU+(ZH{H@UzGtf<nXJu
zjqk=fr3^|~NYzAW<IWejIXpb9uBS)+@cmtU?{vF&FY5g)tXAaa<C`f=#Q{i|T>5No
zdx$cVS|=)N6-I0P{Nr<BCCeLed;WDfY%wjvNNYVdQtgH|_Rz@QP$JBIe#}vYJv9L_
z`=UO$K*(j?noFD}S&^iyy!(YX@S&!L@wybq4I~egfs}d)B_+2jP3~8^F4d&p82tKZ
z80R>I00iY9AR#Ns5Qzl(q$(d}lU*Z26syQX<Kuzf!yRjkk#MMSuX7K;=k<U|I;X?J
zz|<$n;8h_MJDGta!Y{rcB|o20;yF!xe7u<B7_-^O@H^lU#DdZEYf@fk&OfApQzPku
zsQ+w1{U@tzV=zmIk9?&XO=I}G@JB;KcaTM3sH9P3RMh^)Q5U;F6N&wQb6@pyJRt_X
zR}e#)W!xA*6(WMY?Qf*~evC&n%wAs;oqMlhZl2JxEvU(An>gQ;;>T!N7O+hM7jCja
z)D1sSpQ$N3%?lS|<Ko!+KFz^8@;Z7TT-@dJRLxs|p<FUpQ&m;12B4=7ls!z_RG1O8
z0op&!+kJkx^E6tB7%0Ic*YEXf9$uZd+^?z|SH2Y&7D}2<y}z}7=h@`c22d_3msc1%
zjZ2FS?CtIKHk}A`)ISnBB#eyV-TJYz!huf_USOM5P0z7DDY%-_bQFT40?W58w@TG|
z++cv4n4J8F(Oy8!j-P4lzB`0=A1MtTxjytX)LOqabd+Od_4PfQ@W=8OUs#>GzP|tR
zvRm36Be)d!1_T5I@Ab>XlP7GPjV0JFpy4b&4`6oZpV8gOYWeuKAvrxr`TZz@HR>n#
zxx%g!X)W*$purYAArOh(0Ow{TdnqSXeZiX${8{<~e%EIc8qHT;o(inui$X!#gNXR@
z=2Fs!?rZa-Q|C1_?t<b_x$IP6o^F@>Ve6~p<hlg;_ZIOQNe6;z*3nc-7kPSWBtiZ-
z@tVc>5V4bz>fo7F?=cRUNa_U>w4sF7iZ|zu?X^Y{tdVNVH0r=Y0uigy=BxKL&^jzx
z?`sbcHeAscHLG|1&E|RF@}hA5e28j3D4t+8?@3D-vCC%$)*mi<HLA<hr@?|+jK;TQ
zaw{a^r)^mg_f@lOU@Q&zc*Cs@MH3wqln6!IS>m25bn@_PAf4QEzpQ|Z(O&_J!$tbC
zR&vw9T^Gkp<6U{98{VX(P@j8sdXllOqWjv5*RN~2%3h$hytR0vMD<FC$ujv!MCjQB
zgvlw%9B)a+-towcwo!L;ihcX*6mw;tA(N;u6r4X3N>E0L_gN~qhC_PnjSLcoEsVNo
z4r1v?rS~}(A)Lo#W_~p<8JuxR+MAF7LCOBhmoK|l7a++{@35)D5pA|KNoT3wjI7Vs
zcWZS00bf=y_}Aa`oN9T7-17l*E_eHX)>U?aWn7zTe1X!A4bfvsvD|XWP0B52@8kt3
zM5P^J@;_L8q-bq*X%Z4Gf8L)5kbhubS2^r_*s;Y2fgRgRQC0O63LUse`HYO%5Q=^$
z7;CAWKi}Ud)h;b_#@3b}6@(us3P?7$6TTfHXFpv-D#gB=Pv<^i+?SsI#d-yLtHi78
zAe%|Y8GmTCF#%GTP=QM{2-)Ce5Q0ww(en+JaTk)+FJAPi@Y=p~B`U4KA}+xZ$u&rA
za|KSInN!}<3Cj~$ye!N}KmilQ4ifv`>hNKM5|+58moJ}4(nReS3**|-FGAAj)z)W7
z!V7-t&!1CG;YwxT;z0UCPlO~iZ}9N}5R4P{g!p(k>9P?l5fpZcsr2o=)zq?Gl9G}{
zXfT1M^XqI!@6|l$fM{U-7(AQh>KfH?1^-U)GL$Fr#<-(igjk}VT<?sPuV!EnfJ4@%
zJ+Hxhr8`>m>uBKprR8GuUh4C8wY7gA4KLvKHR#={4_9?)pC(;gib3@qjI@tV7@K@>
zAyub8#G9#88hmeVx~&8k9a7?Q5a#e*2ke*jh1$jh(74RxsZ7-s=aGzRHFb50du2P)
zlOxgYhL;C&5Jo%Km!9AX{>fcIjT4Sjgt)=XOkvcwD%I!WHDVxJ+I!5VH2BcDIFrU7
zKem!!DjCr-JL6KU`jEfAH##V&x9K%EHmqU}OOm3jeVoHnWaK<NQw!8+HKXE~mYlq!
z@UrZLqE+p`TmV#%f{;g`VcIzyKH8eW_IqH<`MG@mYy|wtHxaBW9sW0#jt@1R!J-C>
zChtb)?95Cz3RCU37PR=LAWVd`>gS)r4iJwZVR%tg)IM;;YiKnOw$_6OYbP8|*-^I>
z&j1{|z^9Z4*dG6~%h#)+xog2I=`?WwJ7E$A6;2_t5FruWAoRMmoMHP)7>>ZGRN%4E
zSB4xUwNlexPQnK#UTc96E+d854KC)xnkAy9i94O7`G9%2@=wy0x5HQ4^Jodu!3QzW
zVXmQ#LFs>K$Nh9loq*{hdHF#~8LuB?>+s!>*axbQiA*n(;El%TAt9c~2J=L!OJ<sN
zuY)CYI#R45S&EO3&uodCA>tFK^!aTAVl=W{CbzN(tGwOx-I0MAdL^l;pT?=REBFkG
zTDck?)k+0kmzqtA;P(CS>61JXz|!$pJZ_NlCV|gXT|Uiy8}{oDOIByn2!-t4mN~|n
zt4RYHHMO<A3!g6X4nI?DS%c~`05&$FrhcdiU{7xTVMfkJUVryzA%;OAs`GQm`M31B
zb}j8kvG3X5-hRK>TnsVT_r_92N<=3dY;C&UNt^l+br0bjy{Nx?aCJj$Tf&%^SO$}9
zeaDk`+1W=gb8Qeu^BYY)q*_`F5bfUAGH~7qQJg{low1O6Mk>IneBs2+`cB)oe-Yn3
zLE}AXYvS~z@(TN;m+ztQp&=_~v1=rW=lq;X2{>!yV$|lPw)uykwttbB$Q>g}??X5E
z{-<Jn*tMGeDR0|8ll)bj`RSI8uhMgbo{?Sr*g6tyVd;g#j0l(|ZGd8M%cugjs2Fm5
zReZO1@*Sg!Sx29({4V7bGa(gC{bOHEcE29mJN(bF^Up1hq3@qQ^lIE~K$0TNzpu#O
zELsLPkIMRPla+tXbwUpH`t@s#V|PNhfx6K)gbOm63rX1ZdDm-GH8^1}_JnF{=Up@U
zV(Tk%^K`_qZ7?`gxykVI8E_Zq*Wu6DHEw$HWJTU6&(Y3GlLu`L{MsGW1rOFet})dv
zxM7)D;q9%*A8467347V4=P9N|Mg(xitrV<$`D4_pnd#|DQ^`9MNn+}z>pCnx^xJjb
z|B|;m<u9IbCNU$6l{T=ORe|mES;c=5w*Lt#{O?0@MIvE!{RP8s3ZLwwYzXhS%SR*j
zTH_f}&-1Hblu~%8E;vE!AmTRP?Nvi#@@)|{+jac&L9F}~yI9kCz=wiH<@eL;&ehD7
ztlcVFnQg0~xyQ|IaLMlyvfKAq+d=yjl$VI#14_*$Ngb<R-*49qIC5%1X5(MCE3_sm
z+yl3ezWn&XbnlwahiF0*jtG*Nlr+h+1}mydMN4CaPOxt+t_|ETy|t{re28U*o7niT
z7Sh(_x_jQ|L4Z?KYYib3@NbhTQ~4*XY>PS$GaZ-%F%Ltg!Se=cY96_P`%E%JxRvYo
z%Le$>1Z7xh>mMhVuD~X|^_;5FRBA4#Bweg}YQMkeM9Gya^Mu$bZHjQbf<TPgeP#HP
zYe+Qa1E6~uI~PtOAs17BpiI8gezWb${76>4+dFgE?Nk!L>bccVSKW8z7V3r1FAVrl
z2UVq)S+@vUer1ogA0_<41P|`gN;`X6!<2k!X`*8L<LA%)eRdVsR}(t-T=z-&C$X$d
zlJDUBb)enlFo50Vd01Wv^@r+CY;%|Oj(sw_Fp%fIQc!=ZI!-BQBJlQdMZ$7Un{7qc
z>TIre=e<!MpZ|A=d5enir%3T5JrsrbS&a@#me%y!B@*9_b`Yz{-+7CYF>)thXWp;Q
zu(Pr%UoI}bz$}we_D0_sra3K7_R$bO*AO1|i2VW%TT-c^;BmV5<RT6rdwMoMf;T-M
zGgzJsT)NhFWw3_Ei?|+(c5m06buj2K&QM%y8J?MRS3wDt=RA9H&+Fta*zha#_4A#%
zDfV}r_bRjpX@e(E0EDMGp|tHN6z#mK^zR-pIjt9@9m`#ADr_{|oJ#03NTrZtScp{p
zx$^JLTlhWQQSUE$^yoo0w)Gqw93SfH?ww7*TY-jQ<=}Kg+$Yu>6%1gv<H$5@j`f1|
zK|Xty=5=!N!Oe2yVTzOb%(`HOf?Y{Ej<OT@)C-NIqRuuXB?J`r3LJ-%u(V!tyv?7B
zR(iV3URqC8X6E~XmKv3H*y1_!uBYjqs&!GhU-fp&coTEH=UJr-tT`rt3sR8!?8H%k
z8fIu4=C*-6bL)wMEp7;x0nRNj&P^onZ%-ndkBybn5jb*Wmt*_&Qy*pkOTK8ZAd#5-
zH{s9*OF#^c+n_Fkb+SJ7!b5O*Eu~4^hYp=^a5xHsZxVv-X2R4&YaJDXvK3Au2IMEi
zSd+Jf{@zmF_wI3bWl@SZzA{?NFiF(O+SD}Md;+&H=DFwEV8wPJ-I&sdo01Z)E)&ZF
zx3@G!ir3IYcw2nTn3?VIDUkT6&Yiy2D#VQDlzOa2+4TkCS!OYhJ6P-Zy$sn^+H;($
zRrW`ZK2m-DY$V<1iE`mpmQ8Q;D;A>mpMEOEm@qU%BDn-@F_(~heB=rf$q?7jdftHM
zQ*B5Mbr|=c)2M1pB_Cnl1!oEM3l}&;u5=WfXX?8J(2OET8^%#v2$Z%K)LkSQ9)NL-
z!CWA0TljL@cQ(5W4xY?9HF!e;ATb?1y%Jv;KyFO~b@e;w<tZ!ioY)a}ne-?sYAmSK
z?&^9Hx=;O%;<Wyeou=jYJU!K9CrBPK56kX~+ozAul~h+CdAV7)+p@#81#Q4;mQ&*y
zCT<cZ$#f<q&a2K+7cXwPY|F1x|GeVIrIoFzo7TI-^mqRKgKcWReyt;k9M)o8dABt2
zJ4*WNHpvDj)8cCs>s#KONNXy$$u_RZx$-6A^zRZk#_~8N!LjeX+3ucay)NeG7adHv
z?%%RXr`%pu=>qRnq@iO?{%LV>8@76`BYkOa2ZGu?myJpZNR6)4*)I@45CtH9;A+w2
zCiHkS;LexcY|oX_-a+a0$1kI}xWoLSv$OM;@GHk6RLcXrjeARdc5&xFp4gvva~mmr
zWU@M=KS4I6w&T_5DC&Vyl1*{(mcSry3*M}mS!2U%YRa1W#W%NozC)2RAGqcb^Gbn-
z@<4~8_Ud#(T%~d_&+H292+!$J8zwqz5e!bOeI`MV73G{dyxRFzKkrfN0Ur(Ow3S1_
zdF&Zjw6Nzy>OYe8v7>kgX_ne`afhFI>{b#^#>!#osSj*w+;oH)&boJjB|_;|R#tH(
zdzqNrLR(r|UcP<%?J%PPxdE5ev%2sno~rPVv^2@%^-=5j;3wYPcYg5em9nXXk{AjY
zbLVDGghmB)tt<~vM7!60ZH(XR7(4m9c)M)y8?A!QTYE@q)Av}?>kg=sie?k8RdV<=
z!MYE1c!>{ZeKYhLTVlDZ*fx}WvpNdpUD2kHJ@O6ahO^yRP2ZTTiM(AX;xs3r*vQx(
zZV@@W_M2_lsauY8QuNHeV|z^p2Pp(rKNqhY!{2Pqp2mXd`FUXX$0$7QcMF^(Lr7i6
z|7bFMOp~Qf?m)!o4egz}%v(4vGq{#I@R@>?bG7xS<BI6$P15n%eU6o~VzG4Zt#5BV
z^|88gr#$V_-1sR4g-yO!MWXke<qRS;X@fUnlagwz1!u^pG5^lJFa$9Vz}JbEOEC99
zRDhsi+ND@zeav^8P%}gJ*w(2c@u?!qDJ}KyF0S3o3?8hKZOOV+w6yZ|S;Obr7XFYt
z%ANl#zZo8*aadbknB4BiEng#DK<(1$M_HiYJUVjm!`H^gq9zKg73|7~{ys!0V%t)X
zhFj9M=bb%!Hb6vs5elr3FYKYH@IgDKAi0|}QIq2}l(G)*hk>!O@pBZ@(5nUN7Li5R
zzny99-W#OAd+9B=kr2+KQ)9b1Hc}MaWVW%SAPrhdG&t=UGHbWVE*BT{fQzwcFIjZr
zNAx-$=bhFB!6EPZ%iz8(eE_q(I&6tQ4HnZwJ$nSeBt}1k=ywslu*qTg2Z0CHL!VV+
zDu<ZJ9LvF~8e{t`ASY)XDU@IPQF=H!MiFX!%FJN`Ds|^Y3s`pgJI2^nsYZ&gCmD2X
z_o<RJSUPt=Xy2|ntL$>yTm);@zJjRrMWV-!RS8p<pkHwLG6$g_f%-D`N}?u@<<0k~
zJ8@7MSNSm-<^E!geZ0k?(R6s!vp8+L?}&}%ms7e|1<ZL4vifG=b9HP#P8Cgg$p(i;
zq+XzzINPg}7;(LkWtDW%rQpU9ei|CY4^Cd0Sj`G73C>qaDbUBV$;!&6#03nH#^E!G
zY$Y^i9vnZy!hA;)?_D@)ZXgj9OPqqJlpiX&k?FJ(BRFq=@)^G5{#5h~nJl#XwY*Qs
zoBM^UOC`N54C=mH9gd8RDU0<Mc7+hvVR`Ii?4&p1(&>*+w1Fq#V?fp2MsyzH7}rQI
z&>*-FGv6=%(ok17qD6R4%%EE>x#>fFJ*8mqhaQhH^5mYOS2Zj5?H$x<Jz}V;uyZ4Q
z!@Rkx?q+jO7F~4Q{@EJw(cb)X-$!*3Th9VU$4k8_`URRilJ1Klg^CS%Rm9D5D)Fk*
zsh>Z;kpxs@`;r4_lV7_~Av7C(GK1|;e2EuV6sx{~fPm_vZgLZ#61jxNn7ll~uJ%#E
z7OXiGCp4%}elF$fUJ3~dJJt01p?CSN*Nm&dH9^Hu*M<z7DB5-ke%{|e$#R1Np1jZJ
zf8LwV;pSA%!57mm`upK{{wbcemE}LJMONp_joFotVr6u6?VURs@ZCy&aWvQ7!;z^4
zhgca|I=v9QX0$(X)>Dv(mK;(_1hjQG52K6RntPRn;9RFoAzB;t*M=bVErTcyI<2_N
zI;p!cDGC)xjL7Dqitf$U(xgXq{lqMz0->QB62KFd#~e#eDk*J2%?kWv<fbIdcOC#5
zIr`Jw;976Z2jqvniZ|(L{nZjJlX7LIcZAxsZ7Qz0zgibYK^mgmuW0Hm5>PbdyBoSO
zr}1K%v?=|<2m3?Y9kgVAeZ2S}HumSP$Q}O2#xfMvWph(_fX+)C`V7EcaBxq4c*0S{
zm~efx+}}0sxM*+kL*MkdF9*MsEDL9j=dHg5G5-xV=8`arl%LtM8+SSEQ~^?vkigZ`
zl4vV(WIIf|k>gP6pW+Ym%8rWANmam&Kwu26ltxl;C>kg)U%WW(D-e$E5N`D*2fOm4
zv0rAJgE%)9S@NhSed+po7x$qqXijrAocoRYRL~Douj9dVuf^@Zyt{q-OIPa;KHc<!
z#LbAgR?TT%ZbRQTC@2QIL?tKP5ffvWaAk{@pf9ctP*Uo_eeGo2uddwl&vjbArQLAQ
z@ClFRRBb9CC<L;=%i3f*vKW1k+mL1_FD)1vV!i$oW_N#EPbHnBwW>XA^p!oJ|771C
z?2M0jD#r5v<hmfeihqy!n^qH<_1@FQo-bO45Bjo(^6PI!ukL!U0+4$9<BtDwM>ZJm
zJiHm$CeT3A$@Nw1Jx+5{N&J>1@@?YvzVl2C&4CaU#V4R3UJI)+wYYNS^5K8kBe5Gy
zR8kHgxx{Rj>*$UG%>qconf{-O!25}ZQpyheGqT*EeVhJyOImEHvHSn#*8h73$KP^M
z=dFc$X72%}EP_ezHu-)}-e^vnTW!hmluEnHaH>rIrCSReoSk+mtQDs%yJ|m_t~vHA
zXI3y|%d9MQP5SHFmWjTb+?F;)w88QgeqHT(6(J_Y%F#759NSfM4t=6W?n|Re-rR2A
z?Zg)elE(?UZ?ZB=)chVTdwSKzrU!o)I|+R^ihFB)dui|LU{2e$b2>ViCl4|;$*lEI
zxy`=cGoNsKk!yUaUbY%=>)2e>eAnt|*F;;_>ah``a3i!o#yj|F7wj=G5s@(EVpdgh
zyH$1%d<UyfZkO&m-`U*!VBGCb#Qfl`IS%2|OckpyV<^^y&1vB6(0l$J#FCnC^tQZz
zYpLYx_uG0dEDYN2Dz5K306VwABx9Xo$KHo;--_hvz4?3fo>T${#tZp*&m}$Cx0Qq8
z_Deb4^XKlZwB?>;xOwjk`LXj%yLhBq?>0>RD@!hd-5yK|2<ETW0-+UaDOo-Gx8R(c
zG<(Wzi;gVeMz-Wuk7NWk`);*eF2j6rg?fr$29X~qnY4x^YfXY~*D|2zx;U6{Fs#Pu
zjk+@7bgG6T7?v?EA&!oYz2mo|*LB{el^^(1UqY^mt6BcUHPs92x^T|T^Ho}xIEY&K
z%H29oRoRtq1Mhm_#$Ar9xmDXSSNr&9`2PXjrzrTeG59a7HaU4$x}cMPESI(UVrp|-
z$!(s|?f<Uz?${_T{j?UM=Aj7NvwL?e^volp_%$@CDM%130+)ZejkZ)R_EmiRMl>Ul
z-5-blF!}oXC)~a$?}<Q)sSLpWTaUoDoC%KUhkj1M1&e41jc8B1Nb~UUkO*BUqNY(v
zD7L|7(&wn7J+&b+bo3kpKYa0js=N||v_W%R#89QUsmGi?$eiO#mKGOdw{0&~t4jtM
zfpB6+uTAK?nFyMpL|c5r1$MkUS-lb_DL-c}!YD3=sVunWufYU?B+;tpy}7ifq0L&}
zdiaRbFdx<G%q5keeLL|l{@2yHGTIUUi=N<P&B$%)$xXy)xJ#G1ymN&j!J$C)hTH-D
zrqel$+Z=~8A;GjK6Ua0s!o;9^L3$J&EgQRGHwpY>637#?-nrd@+`c<D95icVLsk9l
zOPlrkAXWa-4#z#+x?QzpS90UIBvHt-GI1G)Rx)+o<$AV3p{QUXUPt3HYDc!SuMtp`
zZmXi<SxGqJ7aPd-v@Bsd1;`Um-i|#(aG;aT&*za^8fmFGpv^0>yii|rTaf^zOfD(Y
zjGTQL2J%hbb(74B1OI%vu|f}&czu(mrlx`!9R2<ieyT#l9k~2B=0<MaJuv^=vcCHo
zA*KaRb|_dmetHeKI~x}lC3pf4z{*)#X-{L}my~QXze%p2Q$`yPc5<i#cfU=J9k98N
z9$7h<fpLr!=Ll68{0UH@FOP}NO#${lAT7Nw%j}aJ=o%!&;fJx_03?%K`+&5^x9p*#
ztGrRf#}r*zb^<4fe32h_sN8dFsXad47Gll&$d7w*1U%7DB9udfgYx>ymgZ&`jtrcx
zz@y_sWj1cy2)mTTl$7ab{q?58F@Q`*$f0`tUVwAq;ISSfH^G@YbmEs%a#IhknVXll
zlJM}sb-e%|2>#5+_4S{tmQyh>u@IwF!)0zsAVb7yKoDTi!!%i(9;6+AsePTR8B`j=
zO_KW4H8H~fBv$@mI(p<Vhw}c5USOYK=In(Zr$A;w2DD{`T14i*Rn=D=7=3q(0Y%_|
ztBc^}DbvW;$?HkK&u~T#j*vgUwIq40K-!??ERIr^^N1c0A&L}9Z&o7h<hcAq8{jPZ
z>#+WyXi0kWM&ZJR(BMi5_^KkDf5BDd>+y5wAq|dl>e&)0;lML8CmQjI<N*(=k{SVj
zg?p%5ov$=XyBb3%U0Yk5ZdkT1jbf~065ZaeVFwhqC|LpDP)WYiwijatcq@mR;>!%-
zvJ8k(CHnl14cPlP92}fe6Eu>5(ts&PLGtwUWNv+KEO%A7yR2L;k;REr`sKZ0S)_RD
z+)`I>H;0N^A)$XR9&R@J4omsDRw0?^G2xj8c?5*<qQ%N6M<>Iy?HC@y^rd&yINcfM
zMkaMi<Ps`U+Vu=Hv5!rNXHfn38B|q1sq0ru($vVTWI-NmYeNDifx!~o906F`B8hp0
z4(eh^(W2ZJEg?^AzPgSm84LvtfnUkg<v6+d%u*+NAG2-W48u#9TrU-!P11}7R6fFB
zawbVrE?&b33<Qc6kknwi=N{Jd?OWwx5mo_8kf&<=#}WZ2P>@2USH*IcrxP^t+mOT(
zm0W7BX!rH6tvLjQ@vO&~bW(NmotOy!l%#X&#kS8|3dSBL=1}d~xtATJOS=E8ea|Pt
zd>Q5aPfedmyXMqSrKIo<UIoz5BwWkl_;mz!wwv=lgU&;u=4eQ{U|l+6aC^mJ@G3GE
z$e6h4d_8(k(C^-@5NxA@d7<mFzK=9zpW_ds+(+rhy&G^s-tASl!SXRT)$ODgR-c$;
z;^XeSj8|-rw|_I-;YdM}mz}35ytRW?{rJD@t2$A|*t6&RzKoI*S;L)Z?<O``LF#aS
z<mT`FDTIrKd)Sh-x&ugWB*mdTtp*JqjCi2KLxNk`7La~G1&!-FpMJrfobhF?;ne(O
zxhLsCl;O=*n@8~pltuHBbF*#uTb8)c`{4g&>3#LB;iq@K0rQln$mByl4wUMBNb0*8
z?3GfkjY6o#MBQnYwUK#4XIB4tb`u+YoD>ACv|m2B#<A}Mt!1Rpy)qI81B1dMbVq(m
z_jl9QMa+=$Sm;`N*X3K=+(reQh3@-zAVr+K3QS9V`#WT$1QORhH&1&mO?A;lV#@5J
zqG>pp94x2pxI;bw>19AL<F3OE=v&|z*iIsPZDe)7!P$<E4WJDf7j%%pt3Xy5GK)bP
zWO@0G1kqKDIe`7tsa~c3D(CrS-FhW+-5O%=zbE&qCQ|WaHEqR}n7Pdr7QH|WC*ccF
zxQkCyRA$e>j3158x&E+A4^DI5gCoy+Q8U@ioUKmU6*Z=r7IF{ws?)KZl>z0ZXtHWA
zTo4|~XrXTj0l}U>eJtt+#?0n7QY==mT)DE5#H*ivz(}ZJe%H|5Axr@w{cQ5Qk26^G
zzasB6duWrDJgOdzPF?=6UZ~ti51t6G7JP8NdE`c*J-s&wm;{hZa6wAd9;Rq2Pye2A
z0bJ^p{idROLfOeugo%(f6csU-swJlot-DI4zC)Tv+)!GN+`6S^YOZom=7)=`__;0b
z^>E|=7Sty=P*5|Mt>1xT(v^7D4~Qc7YmhdYb=poQ6FH{;K~@R4yVOF&g>TP>6GO_#
z8rJ17?UJV@l&F}QxQ!IvtFH9)(=Vs{`-Q-9EOwnUJ`w(XXm!;cPBTs+aE*d(>ozkM
z?h|3kK9Wo;az`uXS|amS`@`Y~Q+$jMe%lyQGIqcW9*vKYo>Z~?`($=yv0sQ&q5`wM
z!GchIK6&ya{nDP-hxNcJAzvpUF-i?ie2rsCNfUX(nMK!zSb3R_tr$GH-{~g>xJk-c
z2QO%9D(a6fUpYr7j|Sa=9&PDMEL(7qMB^Ti1ckZH^Z>-(?sZgDR20XbC4Ko+%p#zd
z_mlo`kPe-{+NX&QRWYr?pk&PL>uRh>ays-%PG2p*zA+n^>g8(HXtN`Ztg+Yq{<BNU
zDtUd57G*y+Nb_p4npwc$&X^{v#}N_4xJ-iSLiRS#?42HLlo@aA=-4L`0N$)eozyPF
ziXfh-UK2i@w;v7<5;OuGovnt6R2?95676WTyiJgb<3y-v&$o}?tzW99^&Xky;8Cz7
z?}E93(GqY9L1O0Ny#G=yG_ndJy<JFs<4WqEOTr#%#PRlCe+3*Fpc%x#s_)^0ZEgek
zEMQEybynNvs_3&zKbN`11Rfl+B7=UkvNj5S^VdjgsjxYwvJ_wuhi@!e*g3Oh*Vzs#
z0mBHL=jrnnZkruW^uH6o9-Uy8Oh1_0_4$O0<ww`Gm6(WWG-~;39`A_X|L-?><lv8O
zIKv@TQO=soKd-5If5yd8<NZJBkU?q?kWmq)ZM*sPHiHuV{Omxs8@OxWjk=@(;ZM6?
z2PgrqU@pX<W`e1g>I+Y*?WFLd*1LgHf;Y{}XD{&_&*!AGvp8YM6{5TmvVA1*CU_q}
zL5Pm{gD?po;qH(6Foo0$;EFAen9JS+T6Q6MBMH^E)Y`Jn7sF>H(q2;~@(Im97S`4k
za07Zks91m~8uVV>7~5pk@Z$#&_|u%icrWgp$|j-8AQ@WlW<uF(DeE*=53pU%!Nlbp
zh}}>}cH_%-0{4T01Vd3u5?mM;-&Vd(O1gvTj%Gq1>+7rGY;>!c&6oVY0xJYLtq=HC
zZY<n){3q4xCVBZ**WWvaF1a&)cWl4&u4I+IAXRr4BddD(w<h|E!6NTKnM{?-_wJn~
z`cb63r7>1;yy%^syK{56m>&KcOHV(m>$l^O^lqr?c&-K}z)satwXl<p$y|<iL5U)N
z%NF?F9xZwJ@L`K~^k>Yn<lo+|$^_wy&~{<U`dv7(*ULQoGf)pskW&b-X|~4xa@Dob
zuAPi#%7CZk!bP?KAXxvVH_wf6B~0LCxQLIcfY(Kcu=cym8xdUC<Yg||g)L04Utg<6
z7xGYM!+W$+D$B}V41{5f?lzuU&e6yD4rS}$Oh=D|becz1MWw>NKEE`XKK6I3jcbP3
zRpI^AUs%0+?m1Ndo+$R(U*0BA;&;_;<~$1Hi66H`B&VwO3g+aXU*;TAg7GO%{UKWD
zAB>#e|Jy)3JW<ye2rIiL`!a{U!nt)+o7e2A?h3}<BGW1Ug*(2zpx>wdw(nd5>$kKV
zLCc+2k9&J7mKWUPwgc8{_(VqX;D2xgTJ^t8^nd>A|4)gCz$Y}Pv5<pC#H!fC>Ow|#
zR7E!AsZvr>PNMO=4>oJb%Md&eeb|ZAtGDVBmh0+ePc8P<Z1K4&GIGvn%G5jB?a7Fs
zLTX@|UYYEfXZPD|3qKVu_Xb{Hx{_<uBU<t_?t}NcW(cKGClW#%o^kZ0b4#8-k4r2M
zdMZxOa@$QD-O-H>D~nut;-e~?bGxEO)VRyuNnT;<T$`vc^?LkO2H)_xBS(l<x7W(E
z?iqUdz$KB{oyDhQ0euKLtw_8B=HVK$26jgUIN!b>Kb}sTf+6+tAKA4dHzf31$Au_J
zAb6VW;NMm)U^L=ib?ZlC<2|A+O!T3P|Cag~QGrPQw}@xslHOP6K5>uy;OSSq6y!7c
z&X3yKR61s637J$;r`e%^$+u^D-&f<yF0U}1z30;MA)rpaTXu2&U8%j_U;75Hu9OVE
zikLvZp9Agr7tg@BSzGNr+wRcv)znLF%T4tAyQ9q~MR~%t48Gs*3JyETFk2e9^I^-<
z%dX*p`rdE(_D(<VP!`pK`96uU4BhbUe5~aROqMVX_U<%UM?#pAs8#dfeuQn)1B?M^
zut7hJYIreWT6F>8<k6U2cUx}fvk!un)JwysSd6;Y7G(dS^AO|{KR-q^!{6=u8AA4H
zY-peW*Y+=tk=$hE<|Rr`R$p4qsu#Q-OMS_`rfYffSDir6z7s>P1N-*c2_Ko<CiCck
zZ!Mo_mmh&;a8+aZ3v@qs?3_F#`wzp2&1HMQ|C!>+nhq@$7}tU1@SlQ~yPNaA0f!hK
zw0V>>XP*mL0Uthpt^%fnDg?s@-d>e{gX9DZbrK2QBL~Ckf|zNEGmNlYQjQlUkU@@5
z=)PYY`gS$_`b#0=e>8C0&8C1zHXW0gC_(%We<lD1%F4=W8X7$zrW77vh<}Wd)?K`f
z$?!DHVi=jk&({T$CrzI7Zx8xW{ly@X9#w+Gk0=iZGB1NPRV!XHxdyO+{Hf}Lk>Vz$
zaY~t{UMI=qm!&hqtS+vp7FTX<x>|g>tYp>NGV>%dp!2b3jq{O8rLkXlu^|NbHPj1)
znG#g-!J(ljUD7XK*bEGv^avhhJAFzp6a)6^hDgnNC)r}Jn>4->Auwdq%tCC*es)P_
zyyr%I5N6PCB!aQqu&y|;!)a45GFgP@J+BWvKLki%f1G&Pfcy%$DI+n;%>XujoN{*o
zZCuuo0x|@0=ir)4@&2YJn@wlPy%kyY1#u;=uBqwTH<bJyczY|{Yu5|WS~1G_Jux6F
z$|VFeq~Va|`a+P?gF|VKMvwmf{b=>oH!WDJqFeL9^kj!QXjc(^|M^0_EmBm5M(#sG
zu6!RK#o*6OC)(r_3p0rOK$VQaZY9C<v&ICqz~9&PkcqMTQ5#Mi2Q3}|0qG~4Rvzf2
zZkm{3P^)mhsf&7*7;rqj2EygwOjI3Ei>+{CUs=OJ2nu%@QsjG|Q~r_W-2Ka>+)72I
zuBNu*+G(DD6+>L_A#%Hp0*64Mw#&>PK#g2fa0ZAK@DI+PcB&}9LCJx-W;0XncN@aI
zju?9u8OhA6m$w7d2cf|?-$B6pM@)49EfI;c=mSmvm@E4SMHsY)7iJOYJh&n-2eRqR
z^M)z9Sq>v-Ak-e=NNPuqYOhZG3GCnq`X4C{Wb$Mc_)bbzJE_n#)92yH!00g`lLx};
zGF)b?QgpJn5-jxxPc~QV+Jas+&=c)+Lkfa@-!AnnO)t3#N9lQ&D}ZXiIO92dn9$g_
zprs10Gzg5a0^utKm!59;mSXR<W|?otgJxo40udt40dtE3SY-K&Z$o5&lnHt~z$M_l
z60C|0ZNdVVs7TNNBlHM_2^$_lbieIbr8aEIL}<>#P@?PBVCSzQ=RXtR;+SBTF5%vO
z@ggJL){U?j-6^s_ACM5`vNce8mcb)t<&vi629&iJC6?U8BwRL-9}VR1mRa`4j~^@d
zIkwZ<6%+L`1KBQx*suEf+fe)&{?;apU1hSQp`u{IFqbOCJm4aXO)@Wk|F_VZ|27B1
z+k&n;Th{Z*x3T*qw<kQnMM)2KvICKNRGXEVxtzm}rL~SEwa^#zbqbIfh?Ey}2EN3c
zBrMX<Q6P-%;L!B+^d_JbfOE>tBM<@5bwmCWrn9G}-!94FEDBE0;@-NWm4jw89wX@|
z$h1&IyoVhL@eVlCK)fNH^pOB%1@E%%Q~+}syvY4fHAhN0Yv|Y>i-^A>$xMUv{2&+C
zJhe8^Eu{A4pz#}tFsW;3tV5&##0KdX0pM$Au>L+KClv7s(GH@%pjv=wJS)XlyWV-E
zt@H({#+mdt!;TNKKfL?Sg@px@hpuftN6O6CMlZ7)KGWJ;?*445<&l=|;JVY_xrqdZ
zZr!+@GBcWFl-P`gm#L2N>uv%*mJV!aO4?OT(2?H{L`Ihm2|z++!EINo!3gmZ6AK5+
z#k(r9OKMFjDkX(H8p;<ADBgH9&3z+E&(-2LG!a^<Puv49b>wajm0j5qIQBhg<Pl)U
z;J;tWH2ZGSp@sFNzwsN}_G=~<UhTLwSV$=J$3v)hZJ@yJ`MQQG-%x}p-t<12WL5T4
zk(cW~b#Pn}t7m^^Zq0pS2c-2Np!0{o(G^?}@?wcjYN$*dTs;xKN9eN#%&%Bm2i1ls
zb7=C=BdO{Y<;=y<u>+t<fpITW2YUDx5+3D=T-sW=rQU<WB5ma-qocijmR9+PAmE(J
z@#Rpg$7TNS`6jH=7sf94_xGPL$@y+0vqe%lU_IB_7kvs;CBW85q`LjLnRVS4&n2~A
zsqL$|MnhfN+!iq*hKDDN2eoMvWz5G<8%cWq6V=3FGJSbaRmmsBf_LfX`n^L#zNe;t
ztSmK&xrX+(YFGid^?b5ZiMPJ5{u<Hf77X^7w2A4P#ULc->;k(#r+0jcl5R84H@A-N
zR`Mf^oj{}sl$ug3&0F?Q?mI>(08*>kqmO)>0@-~-dyXs)nwy3Dz)P4b)I<LmP^;DG
z(Vd95XnF&tp1t^M%wRLgmDOoz=xO3QH{E{EtWL$i^BDdx?RfI!z4|GbdE&IJGG!KG
z634BLMay0)I4IH8xSj;M)q_tDe7tuij+Sqf0#@Y_^Jf3-I~i~(CJUq2q<-eHXHMUc
z*~jG@vt1^=`~4nK<4?~96s8xOlD9dn%p_c2d@ED+nD+f95NenYJ+7Rx*>)5<#<a^(
zeBlIzKJ9YD+t5ij7RNmb^>ZVGgOf~&dUWqS?tS8FLq$v~O`dtmbz%oX)M%41uLjCU
z8NSYTskxFG)4SZhkQ^)ePiqq!`Y2&Gd&~IP)6-7ifts)g%Ezs}44mloq@tki5OMem
zqn)&W>Ck;`pwoRXE}3Rp@jon=b|-F&TYt`wN|(oPcMT+okp_L79vqmM3+GlqZ)EcJ
z+Bhrk#mx1LjBI;{dYW}NLabCL=I%y`EI}yX5w{CLC5a>NtZST@d_*D~s&I<vUl?wY
z%_D@IgPpsrK|cT$4l)aZYunz*#WY6or8k=eZ5doNLDdFUu(S+upC`d0MDA?4oJM{)
zt({+J0kfFjGnZr^3&Z=F+Amm-gD2$1y*}s0zO>lPnOTBaLVaRls9BCoZb&xBJ<AkV
zJi6>mI^JF6?A~&vupxFCyrW&am>a|lk!lF6WisUFuX3qx)lzuC4Ci`!roEz-+`_S~
z#Li|L%-ZF0lU9?P&YiNM*+K+{O9Fty2`%d<4@b;`A$s@^RrE0Ii)p%}Ys4Wb5n$)f
z5s!vzENqU#4beEtEvrh1Xke{S>a=$-1ExP;M|?5p=8;*6)b$>6>6@p)QlPHTbXhdy
z|AXm~MfPV$Nm7!yH-E|QHB_MjPomL>TSDs%alx?vQfhaxp5C51o^O8Cz*+v`nC+3N
zsrfIV8oRKb9>sBGoQ)JaxH2l9^MqI>;8~<zAW$19s*{$qq;%>4UqD)83^gAph?*aB
zSp*Qa3_6C4FaK{CIDRU;74ohrn348>=iJ0w+%K?{AOs8A1%@Zejgcl^l`3?ccbyu|
zbGxYXX6gv%AzJx2g@qe~IBQ~UJ^Mo+AFM`SE9PadJZA>?<w+2Kl&l=(z{Ah(#2m#F
zy5lG~bQWFVw1M0=P{o=NL=h15aAYBct8!bKBw*9hwbrvyWc6uDF?T_%BJ6SqI}f(Z
zoR&Lw?3lu|3>)o36G%VegjxtAQ)EJnN6h?uLmhjSz?Q*I{vUuuT6I6qq0R<76NR54
zvdb}VK~A#saE#@K$Ohus&zpa29j>LPBp!5y*HJMy?R$r{n8jS1y@y*?y7qF@dCvcd
zj_9QqR@Wp5BkX)W&=FuV<yI29{}u3fz58Zdd`B*}W{v6A!x=jd!DSE@d<Wc3PQU*F
zAqk1vf0QmITNB!AG~8H!AfqjO939PaL8BTh6yz%rpLRF6%JW>PuC?Fvk(hu3?vId9
zpfT6CGeIT4DrW>rK1Oh|#xhVf6<1u+D%ZyZV9>lQs9n*xH2X~5etBr*BAff42<HzU
zK9mnNxwJcWnOS6CoR3~RL?!02^xTo=jNN;R&O`M0Hts4Z@5C%3V+am$iah#DP?(V%
z?zlF_IDkg&hh||KFSg$~&|NQwy5^WdXz@p9x8>ni<OU0oucbrCCZJ;;{)6)$oA+gU
zx?t>Xh5vzOL}nv>!?d0i12)=ZllTkC@y#|j3!kqqNO++pdS>ib6=*0VYUyI}zYwL5
zw=u8w98Epfz}M2EJ^Y4aAD>2w`&!(`G3T!Or;PI0a{XGcQD;#IH!t&0lik2`<@Q^1
zUyiE3;P)Q8pnpflik5@e6XD_hz%rZ8fYcNmZYN-EX<3FN71UG;5)QgAgEx$FW3O{5
zQExhlJA|dli7<%vm-yyvlH!`I!1sWv5$(svK|$+1<tWf1B*wiC=j+NsJWEfyHrXRz
z(solo)^RNIt^V!0m11|N@+y0hBlaG~5M<xCvb9w}cMS3<VPRn;x9SE4`|VCAcaLlR
z&lD)@=9Ed_Ci{}@Ys^vQ7X_Y~9Bqfam>N2#bKm(bP32~M2=G$N-h==zb=OsyvMv6+
z7emPksLXBR&NjzR#>G3-4HopTUA-jLv*)8+<1#zyWdpemAKtZ_t-)e)b?GGE87OeF
zUkvN#3*R_1Vk>^M{W06gpuKR)F-x1u?aci7rf}*c&4zmR-SMoT$O)?FR%Ys?qVU%i
zvAIA(+J~uxaR~_~u!kUu0is-48ZTjiwi^;q4}-KoF{AVeg+J4Vsh80-bDzzMR$7C%
zv;Z=H5J&L`ys2-msYu6cS`VyT;tzXCP#$#=4++aVC~D&w7yn^GZ9;*tZF6Ts!$H1t
z$xUe6l742jgChC%t)`1Ac6CpWaY-5`e}NxqkQ&n-U2U~eu#g5K5()#6cR@?H{$t$y
zduB0xE(29CGI_T5=MYZ(6?VOKh***$-1D>+unFT@tVEbJUGzR!W$Re3<$D(H7tA!F
z|8RHj`gN<oFKF^;I8@UkI7zLGUrr+BIeu061PIZj<13}>eW)K-J%(SpTteZVh-2|F
zNrS_-qlGv7jZj4YzA;yB+_3Tcx`y9<`>om4=4eQX2DvmubEr2tP41lT!&9NW-QNbt
zqJTXCu|92md*}>Ppw+c6K4&7nrdyt4LYmajF<K&er^NIdpoTcp^9ofh#eA!4vtwNB
zwNe4S^X9ELTZD#vuJgRy_dZhMsKfUgFXICaANopO;$oXM^a^f$vz3<ij>3)2uMZZO
zsyuu6Ff-lg21D$IKWfIiQhF}a>sB}nHCXKojgrnYkxD*06d+UocD&_^`yZ*reP#^N
z1H*GmD;&BT&Sf9q<k%^&`;UeP$NOwqjY;j$%i{Yg<=A)8QYqE)KCpb|``%cX+C(AQ
zMA%tGi~ez=aYpM62p>#NC)_B~f&fVZGsVEZ_`3fR%D32t#5ekdX1XPI{l1vJB~qM!
z0_alM+vd#aPoJM#26CKxziE?cUmy3QFwp^_lWc5E%#4p82UToqEOEQF`1YN&n>JQV
zdMfP3M%x@O1_kY9_N8_jn7^JDC3_npQQo$K>fXmQ^|wvCi#|u~zp`!9xg5$WyyZK$
zq~)Tb;I1}pgMqfTkog;4&8f-PB<OgLOUc9)6u5a-%<%AKJJLzHyQ%CE2(_FWdx>s%
zN3r^;Q}=%S7`idinr1&HBPRGI$$sG7Y3Gk?HQ%!$W^{*D7w1QH6HeaAo2@sMb#zD)
zXF6|foqVMjUf3YL6gW4&i>cI`t4)eaeSS?m{8bV>;j?pd1s2Bf%sy9owe33j=c&N#
zL8WR}z?3tCwS0N?ZmWVD^DeIQ;1G>=W@|r98VpKFS8kdOdwzvwrJ?J#*4J-RDPv=1
z+qTc~Fu%#&7qsj=ZY{bYvJ~IWbsNX>_h=AksH;C74pRKU3rl@e@`u{CQIJR^F1p>J
z78Z%-Rf|>r=l&R7DsgYw+1k+|)nUx7R9sw=m^c5$&)&<+H6*ClJe1ADulI*CZ=*<p
zxf!^Y*09y$QjOBYci0$numa;~p1uN8#E$Vn3|!0;b8<rOjNv1$J%27)lKaW<^wh$-
z*RQQKRO+_Ze&T~>f4ugy!OPm(IxDN!#3L>0JeuQtQE6qx@x0oEc!)MhIKVnc`>`S!
z`iLiS&z>a-i~=4FUf*$NZg6BIa#e~$_7cX7fc<+@m=~X8cp*kDKaNS--Oajc`E^gv
zy{(?JR!(BCdU{SaZb?>4)SH}takuR0K3<>uNnENDn&+EDdc{fCBwKQJ*|wQ=Ddfb(
znO5x(G>n1bv43tUfn{mMUH+x|>vX*LPi2`)#|s@<n(k4`eqJnUvF2uIznq+hJIdlr
zXCEBv@ZL(L!tk5s09$^}PHS{$3g9e>(>vkr-F5q<oW2Y`nxKI1qs#n6jBR_~!3sgm
zix-vFQQ@86<lMe}?`-7e&pQ6uJ8)%^j-QhY3Z7q(BQe%wEAd)dnTtQjW9wLV#{(y9
z*X;wu#bA<l%+SzHdDf*Hzdn}6?o!iAb5HQ~ZM45&N#W6!pYwbNeu^Z>!O$L$AJfm9
zXo~%O)jGLxc9i}{me;;~3R8Y9Eo0*AC%xKmuTWFBEj!V^q8rAL>q&L>CKp3P+T*t!
zU-S<Mu)@?`csk_FU~I`Clrn@1$dy~BrsU?nxMO|4_|3!LgpSS(Ik0x$U|>wXZK1e2
zGu;1Y!DbkJUmdvF!9U__%m)w0O_YV%urYF$+TZ4)r4{zBwV){`@t650<RC&aV>cL%
zE8ni{RbHO)$;|o_NwcxeX2vSIs=D{ASGSdF^sI%hddvm4>Bo&RBt||Np%_^%&bKhW
zZCh+@4Tpg<)CV@YEc^B~p?7fplI$9LVRa@i95W8`QLHc30MFzrYP?9A^&~UQh2%MN
z`n1@-O{9;tg49o64c=fN2_~y?$3cSP%rc(ATc=a*L_8M~$z#p0j99*SU6X#I{eSeg
b;t~qUm~7sy&NB~*pI4GUOMW9~c=!JTUYkgO

literal 0
HcmV?d00001

diff --git "a/assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/image-20231016192215938.png" "b/assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/image-20231016192215938.png"
new file mode 100644
index 0000000000000000000000000000000000000000..9896fb236133c5da22ff67040e80ca0f4ea5f8dc
GIT binary patch
literal 36775
zcmbSz2{@E{*!K`6Ny?gp6xotA$u6?5*(F=bl0EybNJz*sWG~r;BsA6}WMog0Eio9f
zjb)PUyPrDeeZS@XuJ5~Em+KtI8P7cPfBw&X|F-*yyr!jmn3|Oug+d)xRZ-AIp(rr$
z^CH!L_~*S$(QXuq6Q!ykr|*;gb2QkI-aAuv*S2)QnG{o+@MX40QhdT>YW7S5xjak8
zzN6=Uf6uwEsNVB!?LfACiRO)O1_}=S)OQ&_I}5zIqRzJPoU6w2#*J^cPTl>)elFyz
zw`R5a9mkBA#AB~K=N5h()2{XZ={%ga#If1s(Ry(gBX&1PisP95?~QGr;h=8+u~p)h
zay0KFu84oXaLYymU8tk~d}+$k@c;X>&Jc?}*FRs`uP+oR{QG5n>ssW0{CVrMWB>jE
zCR&dB-#_3#5vum@>-9zVWBz@8fg=rn@5_xb|D}nFZkhg^z2U~46Q!ouY}Ht$7b>~B
z32~SH9wPgZ%9&%oNWpvFn!j73m@fzmKU3ZNH5t2-Hol!Vd-u40_VtCH=T~c(aoxeY
z?xt^D<r0FHzsu3k(rPJv`RCpEf9#OP+s+4Xs%!ox^yjaX?fouGT~j#|VzD!4q!`=r
zf1Y~w9R)gyoPNUV4L)ywF0O1{;lCdntw|Mv3U4Npqr-hW&lGiY=(RO{q5v0HYKe1+
z*M8*f^3psc4kxthFF0!Ww%<O6vMe_)N>7-JRNxZxoMS+JpBpH4`(5X|x;&MjowPor
zLYAw{5%}h3_h*8Km8&bARzCgnYXvU@VPT0kwUK4a=K8TBHsXAl^~4DsJ-yK1zx_Uc
z{`@R2Z+}Ti2^9soHHj^S5Z``=NznKn<sqg|I8G&A2KigJP6w?-S$v-e=TPFLyJBIH
zwO#i7IoTm5!F&A#!Of?%;rmvnI|Up#xU;&$Cnj$G+S$FZpsk>g81?7UWlK@W!3!1K
z-7m&)$i|q}dYww^lxI+k$c``;eE98~iQ{Mu<LXSe@|k0WUP<|n6}V3A1ulH6<e$Fn
zrfO|7T;=q&(t%n2Ih~_unvG;^Td1XQgsa%&FJHc7w;iS+f9r<Fz1=78Pg)EcoX7ab
z!N!R`@OPg`P{_T5B|1tQezVf#?k3S%EJKThX20)=w9bducpt!VG<ZS}a0JkqmsLN)
zW(I8f*@<Up{R)tIYbx}1bWyd-z*EI~`hD0TG5-z6UUo%TPp{gOy><-uuRQyH*L!g!
z(l#s5&|tUqy-h_E-tFer#=@ioEu6r+Kbs(~bfDPimZc?1>BZ4}?JS{R!sjWkq24W#
zx>G02+i$<N6#g)|!bwN<SdvcUBwV|0nJt=HuLXYJt{3@PL9D1(?lWC=!zx*K{r$Io
zU8MfA{%BU~ZV4_f*2{l)zuT{!AQ~DP6iPx;Ql0wI+fiqhXeHFUDyLza?PH4}oR%F)
z=LWi36Hif|l9Z6ZrLL;5vL?6Rri*R!tQHUWB`hH!!7nOa*J%?v<k)&1uJR+c*oX+5
z^M8-dKp}VS@J;{O=izGKx-EsDy?C+jo!!0f_+*RBC)=8gLdoj1b)8<ibbXGZ$<i}%
zB9`J}Vg<g^$09B5?5G3`U$S`1U=|zqf*v&A)DngbG3n+|dGQL|!DtLcsNAMY#gM7t
z(vwRLU!K+0o<O;7|GL}R^U6aa`c_-a^ZNReOi`38K5Wv`(r<lMxR``YBQ`d?MpZK~
zuob$pWMhks%97q_^D=}qSzftu;{<G5T6QTaR4V>wKLPFM=jXb+?R&f8x}fP>I!#T@
zRP)OrobO=0*=YBnx-ulsHdX~}x*3>L$Xz*eEUr6Cdl7rX#H8o*XMGP2ye;3(9@c$E
z*kw$rbE_lpNSum-%y=MaG#t)=D&*SQ>R?AW!-EmH^WHxEO`!Doy|r}{&DuLMA~iiZ
z7l*T#Vn6>&oc`!h#`l?j3KsQDcUJPAd7aPQ>svy`udeLgVC_0XMNWPnm2~dLL%0il
z>dm1RR1Zf_PusvHRd}HT|3qKDJd-ginWA9@m4StgO+inO-o(Vjb++de{I3_4l?IGY
zA{4k>Ye%0-dJBm<k3=*z$$gl-`_dG9Y;<&Vc5$&aQ`&!O;p%g`x%v51ROB_awQw)!
zSXjhHpSWxvq6Q`9@ZrOhvIhv;m6esm&D9mZdg9FXXFctS7G{eNXR`uAkh>!~Iy%(=
zS7%-}T|pBjZ(Qedq0an#b}ug+uG|f;Hp<wQgN=nNa=trw;PdAP7y%<I(&8xPcrtsT
za%!)gAl4`?-tB3Q`IWgJEm5dz<<DK>;UlA7$U&{kF1Pwq_f;m~HY1LcM!hYrZ%xbm
z%Gc#XU4hTbbk5{VzPFbbIqFy>g>E5S>}OIO31bT5aP9&|r60!X{U=s8zkAhAtoXQY
z{Jf63f@TeCn<NuvMPFc{v9q(g!jnLTGOhJGT<g8m8cBclyQ>%q1)mmm&qpc-mVull
z!+6+I_#J#Ncs1Ksa<S1C6K_=vO}Ud@QCB}C#eM|79Ys&{5zsXI_ob$$J_<62V!6Dv
zBX;)(1(Z^#N_E+p9r*V>Jx_SVrdE7j-RbAq+>2$Gew1)l`v-h1I>n=r3gl1(QZ$sj
z!!AMvyMLc-fZ~UflarY1_ba{I)5j>t+G05lpaieKzO8Yeqww(*eY8@!{Xo&{*c*>O
zN6kYKW0Vy=dbE@MZztuWIeggQr}1E^S!k2xy-u6v<|DF#`7Yny9K3%81-A`P!a=Qk
zJz6@lcco^v`fWoEfs%{$B=gQ5!KfDU+EH2*?2V*-64?7$r14;m30Gs<uV;=O^tCg8
zp2_d&>52MWU;XGpipHxUN7!7H)d^4+*=R>k*}~CnDvqaU?4KVjOYT3se_zsh3!%MW
z(KJO~hWLFFOi_xNSEN{@?PCNe@4G=M{gigO?AHnXh_*?$@1?o9xi15`aow_)=`Qys
z)TedYq>H=T$al*rC|vxfu_tJhF~_!8-S5DY3$uQWHzZf*Nr+H-Vf@DK=#Q1R(^(>P
z$D&$1x|1abW8F%h!_D}#)5d^~e^6n~2B~H!hV*;ChitPbg@5}ha2*vlO9`$YyWQ6#
z#2IX<<nr_;Uwv_6BH1bHXT@x1wbD_-5&=Tqw7iAPdRXacHP3EolE%lokr8$q-xWp?
zm_gmwQ)qupYfV~Aj0!qNW+pr8MSV1p(mQ8N?bgk5V^=~Sx27L2!+U7D=;=wOcnuyr
z`^_+NaonI*hJ*p}K_6~Mw=mJ(*hE?R0NgASq^-LvKNRaWzB#xF=Nm5-nf3)JE4{d@
zLGO{@f5(@y-k{hJFRfJA<|UCq72f>Hq~zE4&?9Q!&L*^fyvhSj9M|%<ue^`vR-d}5
zhZm~OtPRB08zs^Qs<*`(8V%R^x;Kp}V4i5@_YMq%L4o`cr_8Ps$b`|Kn<-*rGAbO?
z4Qk}z2;RQ1fB$~EXeIn+LC$7QEC0Bfdl;Lfm&WcEy#Dwq_I~e@mPwoow5~XnoGH$9
zv}1fkM1d*Wt`aOu&a?Cr%5#yrMI!^PxWj0Dzpyf0)#Ba~lS=A^g$1fGdHR}9bs`1&
zcGhnrErnTJf3Mx~eeY(8?m-9d2KauQxJ^ev2HlzxCB_zWH+T&8s$nrB%CgeLbEdHG
z7Miu#a4{mn?)P6js3M0I3_!D<E3S@5>mO!0%<wp$q`de_xUfw(mpegK(5!|5?wq!8
zjv!+<VJoS`EcNn%?lX9;Y_p%+&#zIH8`HpseK#xoYI=J5HMx2pwco9yR1{CzZ(E{S
zSKc2w|9DeOjU!;0462I^toCahyFcI2qrJv|k!g;lNQ!>FaU#6}^Xg*l5-wPF{j;8R
z){WymPeLRQF$+-$vwr8VVtqO|f6o8o*v7)}1vL7>xf@j)Ca!Wrq3YN<vr}O_YeLG4
zwgIqLJUl(y@3_>hD7Ckl)Oww}*LzQ2T%Zy@1yp}%+iYU4oG!7VciykK8IB9&dyjnl
zsM0<RK$vjzPl@DhD=urGe$h*X0z71-x&=Gjmv|?+<5C{GY~MBE<PPowK8dR$(xef0
zU((?)c@%ERldCfY{pFr6R!)#$+Nb8dZ{I%OeImN3k9KH7M=^6-+kBo*sCqN2WT@9e
zj_qys4h{(&stp*D+rf}~@HtSZD#s!6{Qea0;Yju*QDNbGuthaz#o_wc{JlQB;qABI
z-`{rt^;pQ(!qMQ>ZIMXLG*L2^jPBMY67z_R1*gq;L!dBg^w;uR;pu?cc#iZ^hc`o6
zN!{5Ak_Dh*xS=qHo1CI8Q_t_GGzw0bUef83<ff8um&=0&q)Yp;ZkyOqGt4IK$AEJE
z{*KI`r`Wjcnfxjmf5=L;sn+e`o8vV5>(=_zQEG=|s6*}n=9&Z+5ZXPHu<v@9afu;R
znY<|}jM{IS){74S-9-E)6epoVX1eDC@_-*MvmB)kdj-wxw#ab+f9W!THFjlL$>x5l
z7rkSL7g~FI=xEu*o)MlCr_)?;WKS0toj(KqtgK{&UQke2*aUs(?#9ody8Fois~6ye
z#4Q=4l_oqS;GUoGsx80SydTS~j%LO5b4M|qi?=vLK@Od}=w@gbxgqS%l6?ng-`SzF
zYin;T-r)v#5B2$B+hp(BwCb5-HA~96j+uFF9KoguU&hCeJlnn*<y?J2DEZLUt5=u(
z>V2!D+9r)_Jor%GKSa`VA3!mmGkKuFb1@HUkxJIh+=q<Ej`sfa_!oK^3^|Gh{F(>{
zxGx4Z6OaLbV;v)-1E^oKFJj@&fDX9~5C9`J<uqF3>GQL^?V6EMcukFjDb|e=HrJ73
zkq;Kr#YEE%+jeKRz^2Df*!KmS2{C*9{Q8_)!MEOgU|S17GOUc<ojbi07sq^OPKxs~
z(T3lh{&d{K%ZrPSijzIIqvNyseS!9vladJVgLOw}091l-+LP~-ErR%h&2g)>qs}jl
z%jFq4-6S%MUs;mD3Wq|^w%Xg>F|Kw#DYH36PjlqRi|T5li$6P;NX0Sr-b(<a?v>oA
zCP&rO)aXmMu>1eK;5b%yJ!o9lwY0qaXxe2LrK?x>ApjETedWfE8qG}m?xR>)Szo~)
zo7VXp)t22sfBW{0lZqV3l6mls=i|qZErH>{rnNqN$+W`eFao4v+XQO3EP{h&A1j?s
zO-mE-(g5ZbXs@8dP@Hiv+y1UZ#;@Mkpq$^<j3`mZulKUHr_RpK&R)wcyI!$hTWW>k
z+wkz&i)ny`70)E7=IHVP$;<{;wZ6X2ec%*yyKU5Y%Ja}^kY99XC1~a2GsT#qa;*{^
z)P36nWdZ+$aL#6`(^0^mv(P+z%@gtE^vOfKORFqL2=xYBd#EYSzVF{T0RTLF_;5e!
z3Xq7mF|yu^rXC(1e@I7cymd#?^U_k<z`#I8NuHxeHO;n2OKr=`!f;LV)q?RDBViGd
z?Bg|!w%zQ2b?E^?3Hg|A{NeBXanPn)tO|`|<I2|%tU!OvwLLjmzKJfhNjQ%r+}p-)
zz)h~Iwm*~%U=HJg4#i`w*#**;0F%BNPXY@I%M}+F7sVK51%(RcnZJra>ia6^QK)Yb
zDra=#CQnNF&>0q2{%AUnEbCXjKjMHL^~Ds8*`Gf@<Y}h4?)+ZAdr}}nYx391q?p^3
zN|+mRwB!DNwFb?*?6C((APKw;e<!{BYZBJp@;p%BBC5aKhQ}C6yQT-$pXBVTYoD!K
zzq2v?73+SskFfT1Bbi(mn@|p=H<~fL5%}Cu&1XPM006vs^X6G@uA<fwfgr~f2dws`
z)uNpQe0*Stf`%m~VHa(?5-;8KKXa_9J>e{XZGkE)PWb!3e3bs<ZIPzQ6@AGQ=&Qzp
zOi-BiM=E5$d=}41MZ<gas7}j2dI&oDsYc#way8V~(=ibdJQV*d5W?SIm**erv=82@
z4vtz1-rGuDt6ge1F}^iMLKA}bNWrl{zt`5*G?X^%9vxFGw`%(h>P9bs@*B=rMa=H-
z_%0K)t<O1n>juQFETP@ya9K`RL5{r@4g-Qk&?dLc-nKhhRMe2qHo-+SXiu-{T=htZ
zOXE(}x1oXv_%~B%Xehw3IR2e9mj+mZo}B&y0LAvU_lqLN_kOl6HHrvXG(0|W+1W1B
zIy^l5?&`Fr=I=^}K{Zy9&S!Ayja#Ej%QLcj*AsSS_f}<pby)0XtL`oB?Yac44;cMg
zFAJ7FKJ<dGDE@Ml9s1D$b{|yrs8<?4kjn3SJB@qcH(abQNe_H#eb@<wU^#1VGt17|
z*)Z3lG3aDg&~Lt7Le_4fns{13#mZI|_4KEdP}%K?BLiJZiUB+8gUI2dfzn*V>?SvE
zQ!dq$*iCNSC{C;>j3yf$ivH&VJPZ$CY24dt{6*|IZ$L;sZ_zqv5e)C<T+k=Gv!>U1
z<dNU6H}d*C`Tda_8yohvp*9gv9UsV_f|gL!xAb<BcAJ>o_yI0&QR2nyC17Myd)uqO
z2FikR)q>$Yzprkh2?~i>oK(P1-T^1kCs+imP=Y3Ni2(Qt^D1~R2+G<mXq-iBM&`bh
zr%#^-zEQL$?Z5GTx-$(#Ch`A8`$Bdo@})C`qvp@;zoVJTNkvET-0C=2cJI8}lAplF
zHw~bFP|fC(jyu+jXakw~vEox%A%{M_><713(Wnh01sO;ZMZTP=ghyS443P@Ued_0L
zT3TMwsxT?}`sNNjT;=7~6E2pZ%(zNq(5LETr)bbo0FP%AcT?~zA-mUW_o2w3_?6d!
z$>+hr$=Ti)@agWgO&01pp9Oj(FUIx|G=^OD<f4p|MNbGmve$t~iloq(3Ne%4zfxIo
zmHq?4gDb6*X%v_OCDe_M<n!SzRw)nCI|b`9BWy$qrTvLhsz8kg901cn@s?!|`gQZG
zW7WY<Wr++WZS5mSQFj%isU3}JXlOVneYV%pP`F^qtG0J^^l<UOqp>mbua2TQ{dd+#
zq+2sx8E`kE?rkmBy6B3iqv<Kh$u|97o0L%P4}~4|u>H0?98{30`G!k<7+ieZ)~|pD
z{%M~dW^Y}|P{L@mK0f_gu14FIszgT8s^|LL0RPNG9$k>jBr;kb9zHSkEWg)I0T7mb
zEyy_SN7Ue)q4zu-UJ$y29UY1pr0@O26sdraMd*EEY_veY#D57@+EzOaKLmIIzwz+)
z);1pX{rU9*v@};SsZ(udxhm_L$Kg6c0|LR}E<o!ym6c7vU9HN2zD^SH9l#n;!l#-U
z^S;qhWvkIskU<;%TH`4ID-8{Cx#<AMJA%ji+ahEr4IcV*t+T&>|E8naUz|R<%^z6b
zu-YZ*D#kXuuuw94w@`xLQ#PewOTJ+;RfA`3W8?jV>-Wk*^Ry@K{hx1&q`Yz-mDt=%
z7Q9X#+xFu3;NW1mqv#<}0O3Y?H@|MRyS)hz$KccE+PnEkyJ_k$c^`Q9I1ry`_5;|`
zuNTkVc<Ir2B)l203*o_G^;I9K<;?(qiu7&)T)G`6^!+BIFQXod7OiD}gzW$d8nS^v
zwiQS%yu$geybL{wH5J-qUMej`)Vh#i$&4<(<Hpcl7&%%&DW#(h>-qA<uy<0|Q-3b#
zhZ~kZv)T$@T~eaiFP1md35zzl^8M#f1-v8d1mxu4w2Cq+`C^f4Lm#OyHMS;`Rra0E
zixA|3X8jl1+bM@|t0!rEEsva)^bJ*OZf-{1i;Ih^lRQDQ|L3>L;_Tya2GB`t6=PM=
z0~F+BSoP8Y`*W<<;z51<y5N;A>Fvx_VI(3)_X_$iRFAy3Y9re6&#$%AmRD@|`5=u!
z+TU<@4>q0KF?+6515h!c-=QAU9v8}$b`WNndfoy+9x4KTsxnuq51a(T*_F<3$VZ=n
zngp_l{+WxQ{Xv5yKK0K|v4=uJ9PgG|)wsSTv$NKZ>FRn4E7$qqhXS_MUsjbTp-8-i
zKMbGT+F?~*F#XmaAYakb6I|Ktc+wVrrYa^TCVoc64`e|7wt@}ny9#I--?MY2B_)_W
zb3kETnbK+1wM5CKI=$sHz_~!{Y6B2n?m8j=rn=g}W+$2FV<OMAwBH&p=wxJ%4W;_n
zE-Lh!ojInXdBto|%?JPjWi7Qb*HO4HCqW{5df9~?s!b2vugk2km|{N5&!lL0*<)Yi
z=O17`Z~g%^6_9)M4^zs~eP8jJ$~=wB)Prg<Xo{#ppcfLo&Ye3~GmKw!|M|7NE+HNc
z4d@D2{GD$;1zHi)PNg6;Jzyka-ivI&dCIL?s2xY%UT_KJ&Cq&LT&&)u%}MtT8o0W|
zpyTDtEmbLYqfYl1+lm*xDHZVc=Z74TE(&s7!ZfQu^|lh%Q4p9)zLV1Z7n72h;6uAV
z?G^-0svH0%+}t46oH`cy3^rcrEw@W(bOG+R6npZp<h?4InEX<>ML}L1Gp{+zP&A)Y
zLwX+09@1i^Q!<T4)JL2qu10@p-4v;SF;~NB+k?xD%d@9;;O2d4SiIe=rL7&Crv(BF
z=z|Z27anp_!M=Fwx6aS*J9V^kjSB18`mNGIefPqn1-Wc$y48plD=yS#7Qpk`ni`^0
zsX&}cgkiD4nvax~kx}yO>ZZbrUS4v#1+Q9=R`5=tP0wcCuv4qBU3zC$BW1F*HF9;W
zGm;DRX~VCA7?`>i6GOYQP(A)7r@Fd2Dqkyubx<6GA91dZoi|pCRFFrfb!Lw`Gv6wI
z$`aM`!BUvl!ks-<xiXL+bIeRA*-kVKza5dy>nFuNP<iCa8<Ucv`AbYu$os6z<RCxZ
z87qTxh0~a;L!mv@;LqT^(Z0HwgA=ZHb4P1OOWP|t@VKq(zEbSs-DYNH+07GA=EeE4
zaN9ur41#hNa)SY5eJ)ddQB`HgcKmp6PIt;h<?XrRvetl+!rM|L`mFB!-$A)<)2o~M
z!;~OPuRDqg*i>9EhkZc7DZxgo8T1G<4yFX0q`~zL<!`0%KOVPOS-H5BnLczct0nNm
z8H=WACIkV!S-F3Jy+A&ON68t>i+Qbe?Td7|v4+r9l>U0um~SpoH?l?uR$S?Yj)xeV
zn`99%7c^^h_K>6D0HIJ{4K71bjgjvWoxFW?{{H@oI@^mu&tIO#lnJc9pC?Gd%g`(|
zscRZMr^h@8%?v&s)!952`Qhz1dB265g{4nQeG3=$zR1DRJ=qE~-LR%^TZ3@b;QD&9
zN$V9#tDuhqv_C7e`sre-N8|W;0DG&cYooQ^QRnNH<$EWm5A#R<@Qz*^3GWyQSCZDf
z#p8X$nlf>iPFKb!(Tz5HrAX<T>gKg4TdyPy`zl{}_a~ONj5uidJ^L8Q63>oP)G<3S
zCG#OF+j#jBoVgs|WeYgtF{9(?B-VY{%TD+pTx-~XJtJ(cxz;kroY{fXU?Gs)b%SVi
zGl5jX4$+T3&ZkmJ^ELYHvh;}%wQRA5tw^GrMJ#bFPMu%f@5pKx4tPV^Hp;v}j-OJ~
zz2hE34?ly-Q!N&K)~z7imB5Arw1qNpkE=^NY%1J_Is-Lvv12<|t~-|)7SDy(!<Dtr
zhHLAAHAS|2U75(Nb)|{H%+z`gSdN_(Skk&1-@InUkl>?i-UIQN^+MRYa3SyuxlS10
zp4wP}`NQ=Rwndc(B6*q>C^5vYLW;+<9fXAigL7?SAdi52FP702a@DoUWjw}zsotoc
z@*A{f=jweZXxZWqlWa0#WqzydZZ&Kzo*=DI$UO-^KseX$2x1~g8>kn9>2KuYK9?8`
znPCeHRWE(+BzWM|>tn6mmIJnUYZ=<CE^NA_b?#5=%wt_ltj%h&d<XTC?C}@nviglw
zd)`PlxK1humq+_H{8n|PL98N<pKsh2x!2p>Wm9nzI4sct_#_ZnV&B_B{YTC2>cUXo
zE?~zi;?Y_Co2xS&5;owa0Q;pbWuu1%IyxE++Jqer=wt0R35q99;<BbJxCX>=oCG@x
z7#sgyAXucMJKC92g{kPEI!`l^luwefx%ztzd%IhyZ}ReZ#GU%{G?#s(+=fJ1Xozh0
zK)0~7w+|U!NFrTgq48PkRmN}gm)$YfR=B9mU8Z=)1d&^-szf)hUto>?0g&S=oD<0K
zp#RHkFJDEyXzl^wD9JlyS^jG8SN1bSFGJ+GE#I7S1&gm!w`;<c1+f!FQa=Ao(BL@=
zO1fPy7ohOYM&H%x_F;Yw-bkBJHEjisNQJ*b;A+=pkZSPZn>$;iVskwi1>U`+?Pl5S
zeW=HG<aa^cWq>^s)YEe@Nhwl<C3!3J@cz(kbNASD=bT)GS<vh8@x+?~$*<$Agjv4c
z<83xxJezCh;u1dO_~lc1jt4-)3ny!zI1N{k-Lr8%VCm5i0i6w8#;$VVLjaX$0y}Su
zv|BfT_(Ok1Gru3C-=atd?pr1EIULJBz5K_vLfo8XrTs|z@LPf#e%Qf_WoNl?m>c0K
z8a(1p0!8EImj2BG093p!k`hAyK)tEZ)bYqM1H-Y%8VvXr;520h5LF$AUMptmpG#=B
z#N#ljsz&~PeyGRh5u2>UO(D1J6fN-!H@SoG;=aT)D28oHV?SxuXe$tb2_7|5X@C4L
zS25EyGKJWF!sm=L*Hh^NvQ?HYRqw{}*ns|3y%_W|na3PUO3(!iV_M^(n!rvShOSrQ
zSDZU&RcW#+YLh#59KFitPfZwTk@Wg`#oPPxy<Sx_3|S9QYvYnH7c}KF%1SS?(9F)y
z_d9aLw%z^lA@X(i#a<ujqnfh0rE8)(v>Y-tS4Q>T=>Pe2s&d?sEmnYO15l0QN6H2d
zS+2<;u;<ru^AS8wk(Kxwu6Rfz8-1rzpDWulk@~YBbE*zkzInsR8clx1pk}sp^6npH
z5pmFQo*!>#T4a-6DJB$u-crTp7+lX`w8{xzR7(hw(lPH=K<U?)bAw*}*8~O)+u-mC
zNw=v8sh5siyhbkmu#pi%O#G>&0Ya;S-24ToL#}<PzcJ+CE-1%FXzOwtK7^dOdGCY^
zw38#?W^M2F9jj5$H&s`U+V<x5(*dnX|EDqisT2)FT|`VPP{`=0DBcR9+X0Usr62?C
zuh_6e-rrwR{&`Q%nmtR$t81ygiS@z6bHzJ9qRx}E9L`j;mdelq>)G->u4sIztuI%d
z?6HiLct%$dNr?9W;M=u0Nf&4ARrB-ab-a7^t`qNHZy4-<*n08o>7xb@ov#&wLpDqC
z4GeGS^SgWCD|U+BO8J^>m#5d2_B`M%ivS^cRD(y47+u-3&4FR~E1sfW96{?@*ZD3!
z^-UGS)MPP$BU0``&}EYiV&e$<^*rynWE_Z5U!P^*bKcRRK=bZ=ViDPClMoy|4i^8t
zUUmtg<l-Oq+2!bZpaPW*MqM5caR2t{>IYyDemY%oyz63uVVqP&<{$jrag4f!5($86
za6O0l;fj8&7-h~*zoP4VSG{-I4sEh_^Zoq#YcjctM`#*(;_vyg*m)nEg|`}3JhgLL
z_243KD!3(2CA80$mR=Z2tbdVn(`OUN;Q&qz?KN4Sm1qTaJ_{@Bd$4GEN|+zM9u6)S
zf1kt1e8<Lb5j!*0n2Qlzjbl0oFOdfis3CCcl}%^rqZvL>H(8_K+gEDYKk<Bt>|AYa
zna!MS5-2q{h(S0G{X^$?pTxRtxy?l0@_$l5^aw>%GB9kdJ#Xo2#Ur-#ri=A00i(sf
zX*C*juLk%<W$nSrFM4152^<W0_M6)jYr0;jmrq>GPoIC;w^nL|kN=`~^KBS-fdlrG
z_d?dwIH`QLSK2yu2Oh6QlY-*a%U-HBdc{<xN8^JKZxd6!u{fGW+EL_+d+l%Dy9O#X
z{-A}KkkOdA+OhopgB3$G-)qOz=r62k7A@s>uqguk%sU&^!quH6K-r;wszkvN&1&HE
z!%f9W;tpA=Zn?CIzHf~jH-Y)Z`urfXqoaB>Q^n9rdj{A>?a_I_$*YG;#A9G5LfzJ<
z_Z2wZhEuvK&Pdto0YpuI^`qmrH-$Oxbfwslty&Heg7`UatbP4FcZOC+qsa_yD5Q8O
zyEog<W=#cZ*6<0mwHylJ+)Lm!QX&^#JQdtx*x7NpG0{zA1k7i9KQHi9UYggl0t?Wy
zDH!v(JO(I&<(^;HLl21(37f?y^Bxjrpa#q1t64&u?sau(p~g#0lZT(uQjq^5Xb0mc
z1#Cd@JDlIor!BJNhE+2kAlk}q9lzIm;1$Q-uQtl+lMZJ2=?>c0Gb!bs#_Q1|cYA{r
zdu)L0XqD5AUXC~bz*4t=y}Q5fR;De`{|w^z2~o$Mk=lgz+hbu8NXrt|Q3fze7J*U#
zw9#sHp;HuaF$L@#r3-N?cIM!MX7}19#_qfFW_SS*^!c}0Lyk!nOA8B(2qt$GTYIgF
zcK*MC@S?AqfVfSka~%Md8&#MAWC9ou(7wQ58d}-rH_$n(MAHW9Y(&#M%ftyL`=9wc
z77y?@f>7huUIuhBvcA3^0q$@Wi`dCHp;#gK->cRPpc8RR6i|Kl41J)Cg(5K#EZ8ht
zq44JCxMVm*Sq@Zo2cG|z%sTNRJ6!%BA3sL$1a_s1|1h!$H0X6VxXQhF7IzE4`30t^
zLfm5_tD6`baxjDr02UjsP88zP58`gYr4l`@*$>rc5qSR#eEsls9q;@nK;^J>Sk3Ga
zrLry|CH{&+{i5$)&^Z&WhwUpL0gV7e{Rdr_0n&t@iCaGx7BCiv_J^jr^II5w8S*Qe
zU+A8{qc57q2u+<wI-xznd(_j2(G5s0fLG7+gSESQg^8xY(+=HgiQS<%e>Wj(Gh5NL
z7T_}Q-Uv%TXp2M(ydTgHVuN1E{}X4=?Z+tSByy1FDn)oaA6oDdH@;mxd}!=DedL4f
zXT{qyZdjsdPU7KX1hVJXtmV<{1GIq4XQRK)tQN9AcHdLIpKLW4;=u+?O;!*VvKQ}m
zXG1erH@j_8hcY;KHR8wY)!U1Q2c4^nS*d|lR5lLS8w?z5vb?q`lXE~A_|CWUX`PSY
zzdf4`r};2yk-$+_Yeck>S6l<31bsOOUUbk;J^CnjeK#0WkJw}Lt)e4S*!7RK;6}6)
zkG#hoc?0ZjJrMS*fw*CwK(|i8wi;Q_$m^sn&JstJ8Rr{<mckjI)}F=d8%-C7x^qYb
z$c(=wXVdMun6>i7(~pdmAoB!v4qk?Z<`JBu-g&h_9exaMt45!BZd5yQYt>H|97Y>{
z>)LiZG>+s~D8v6HbD(%Qap8)zpOZvk*OL&1&5bNIXaMcPI&!(JIt+@lh^Kan3PgZH
zeQHFgZU_(ue@lIl_9@sWr$oU%nXO~)+rX!X+6jX86}0w(qtGyuT&cEqcj~OHoU(E_
ze_&_oC7&OWXF+|CIkg#w3j&AdZ}6kl<0M!u*b~bN+I{>~<d8R_*&pi6JS|_QJ{nzo
zDek2Q*xOk&aPzRRvnx3{mGJMxNG`sc$qJ4Ucc0ehw!r8YZbj;su8t}bG5PXai~^0h
z@iF@>mBwm8(aQ|p_5EOV!QeNrh6A9YfsvrkXWOp_;XAK|Zw4N;c`G=hjeI{zhdc}I
z5YA^{6~X?*>_SlIS$VlmX6zHYn)uQQ=+qEU+NhW`o~<PG5j<39(y5Up`mZ$Q)JOse
z3^h<C|KxRI{T&*Z-DcjrG8TmITdCLjZi`?HA`@$+do@mBc2@RZ=UIJdC(J@UUEMQ3
zV2&yHHj{M@APJvg>1tqB*oJ^%kh($PWX~sN0B)15(FaqWNg6f0mK_+rj<k=<1lG(?
z^Ttc2xnJC0x<s@pduKZ%sm!9f%VR$KZd5s@94od$VxQ4QV}DaqXs^F=4wB*l0ua)~
z31uV{lox$T2PB`t*z_k3(M$2QA+Xj))gi0<a&CAgB7|c?o5zv-B+omLiVXIkgo930
zlz0MhP;j^YCLs@k3=eUy2M&X!H#dp+bebgi0~@w~+@T1tcD$JW9E0Ys1%w>;e@(C6
z{dJ<#9xnIWg{omR!F$X%-}$$h_h=Y|V<r={Wl|ph>=kr{MAPXwmG9xQ+t2xTmUb7H
zo~WEz9t_?YG{7D2^_JQCd2u9YYaz8}2{Jy&fsD`gJt!_LywCdxF)hHm2!1!}Jzj!!
zem(TkS)$j`8-fIgK_huWp??gT?Mj>Mu8w=wCICN=eq|-4<@%+-vcFMQr`xwFEP{6`
zd3IW(Pt^SJ7{&rgW<SRpgGF8|SG<Fe;UjQLe<a;-*2%SK2sj=qyZe?WqkwhySDWmQ
z)o$4~kR8FB2wZ0j+S?j;=!@hpsj6Zca{Lc72ppHf>6%UO#Fs7h)-B*Ny9E&2&jPuV
zhsa%Jg*>{%42+rJ%?^uYh}bG&cDKg&*vEsm&Vj+nzvJDwbrJ$z`fG0?)`THMp3MZB
z=?}KVMFlgnlOPuAfH|YqI2j|kj5t(JFWPEh+?3WbAh`v16+2Wd%q}>5O*5+#pHeO&
z3%YiiiX5C=SBTjd{ARWYxZm2Uq=~HBuv7I!b>q%C=Xy+RslsG=@PFH4VbSN0L+ll~
zgiNjc;wQ+SLcX%+`e-zw6}WuBW{O%A1MLotMn5YoJP1Dd{?ME9BF0V-y$L_U0a=14
z>C>)a{~9IbZS2h{7i}SFQuI{)@3BC6%{|Bu&GUIl$zjM`-KciP^q-_X01*_K&Al?S
z+C1ti@CT%T-$O(z;mJbeSt@eFGV^H2mBH`p;DW&KK@^-N5SrlH<DK*h8U7<WjV_+b
zkRM<0Dh^TGBv*ojC6EjyF*f*q*gOH8jPzj5^ccm>K0gJpL?B!W>cwdW>UIKr5cobK
zy+&tPY8t7*^FmTkOC-g&^bH~1`=9epHJ;4WYqzO*URHJl@(Cz9+VFC}^|_GyN#zhX
zPyuCL+UC@s><<{JvklH5dmx#;ci+ETj!mj$b$B3ror<C;<M6)+%;p!>@#dtv*F1qj
z`F=Fcg$n$01Y2R%CZI$|0ov;3Qh*?ndebu<FkZyiN_}>D!2A08+FBiU5mF=IOV3!*
zD0m(M6}@&8D8xQ`RbCE(J0!vuDwQB7J~a=KZ_0h@fYQ$(i2_YOaE3c;(HRf~fsYSv
z?cd`lpu_MPdUph&8$jB2V%?7n1%7!raAC(}4W8cq{!l=AWGpAG5Cq?uu1WA<1<?28
z>^|9lly4NQ-4lB^M>#sWNCj6&r<&ILF@h#@6>^S{-W1F8y$@LeFlyi%xtjg?+Vkvf
zR^{Krn9Z-{wm`7+Mzz*%FbH>h3m|_FKa@WOX=X5hfGqy_-V};b3N--ryT}Q%Bo6tC
ztgx|pEI57t8HGjM>p!_##W7etA1QXMH)d@I^$u(!vMZil5EB?66$fPbf!x?PFhH5r
zeZcZf@-XP&2qK4U@jz7wCnpO{5z%Zm@SlKw?^J=EHa807j^sUdaP=iJ4C@y``34${
z?0?t?vU{7|cNe~0g2<}F^fJ(Ou#a_m-FXsJKV`{soYl_!00g%O+#|>VTLM%@+@Pn^
z-g7^H>et7DUC6~AJMUaf^9l9heli#@Q_@~%j@^ey&Is1M{O+U@2>bAgTcBq^W=07V
z1;~i(gCH%G^``lCpnzN$wZbkeT#|ILyYeJYZeW$*A?;(yaNQx~XSGf=hnHJ6k&C0K
z9tXvMuI0PxR5A1lUjB2mmf5_F*`<CxX>J{&hOpG)vbaIW7XN2#R~&`+kSO<@H-v2k
z@fCwhE`|_<oS88xx1xl=G8McRBwY;}3f;hNRrF&yhT&(R#+TfPEaJ=1atIPUmA$gM
zwUas%n&K?lVB6Q`b)-|piVQUsTyFfbCy#q!2K0Coz;Gj{EKuVY0Eo_28Vec<A3>C0
z*65lte<}8(_W;_fb=Agq;C1VnQJ{bKOzFg~nY+vW0J#$&>cBi;Utkedf=u)$X~X%u
zTgHMxL~R;G5I36jlJDZ&Ts#RNanWFo2jIS~v7cVGizME1lakayfTSSHA{>Qdd~ziM
z5H5&ZiH%qJvUE*E)6R*H-<oh0`*4jnM|Ej-mJTYrlcpa?g+6ni3-4xCgN-bY@Rwe@
zmmmGlg#pU%v~llUfaBX$4=WZAnDlL6p|2tT0a<Y3I$^~JJ*<WYLH!QyQDUab8FU+e
zwN{$S|G^`|*rK%&{axsjO$B_0)h~?MVkSwgCd$dDnW8X(($`B2JF9>l1-anUZ<NWT
zX<3y&wW}CH6KuQEk8=2Yzt2Bq_d}I5uDiI|f1P_Q%X~-5(5qJ3W$RYnN1KZ5Cd-~2
zTan`{rL~Ji@-eN-_L2z91{@6J30Q=0b(#K&(x>1%VmnP1=6zm|x$|TCoJdhW)*6^c
z{pL%4Kw!XZ!ErXVXd$yue>cA<V6a2Od46HIT03Am#THEnYP1O0-JH2ZfZEGs;WH7I
z-B#iQ_mOZ~CkU&U-o)m@#KdNtRk`u?8F0XSXKuvDZ0&9>C3|Y9a?(8sw^MyT@v10a
z6AQ%%0?76(BU?+2i1+<>vO$4Mhlq0sd$<uMe+pdWNg$%B6IM8OYe)<WteP<x8X4uQ
zRshZ$a{OB7Taj*PVR58-82D}^*l4FQYE8Gno}_Rbt~w03thY`Uzx)=)HVn|?deJRb
zauyaAP3A6`FFie+Bzu7zxW^$uMC6aei~LdU^f2M_0FJkV{`m6-znel2Kr;R@uxv;y
z4s2v(WPrck3ctP7NLynnB(?GN)-9YQK3OZj9L#X2?)1q*X7Az7hlG#k+WI<v)E2_w
zl>RD)kKX9sDIC-TZ|>tqD#%<J5MaDz%B@(6l;J&AczjnwFAXG+QRgx*QJ#^>SXr4;
z_M*+XnQ}i6=Ad2=72isQcq)?HMj~ke;P}1`+K~`4tI4?|D=@UMaY0j4N2q$(Y<c%$
z3eUW>EQH;RU*C>gL?5kVHW<@)CTZjnWexDP=3l=Ej6a~jfDFVwy7pHeJ`TFR-B@79
zVOJ18!RCeUPGNK;`fR^36k0I%HJkgu6^A7MEmo6c2PpeRCo~&KI;Ds%i~_+OT?TqC
z;<C@I-kH9TDu`QUrP;q3Lc2c{-06a{GG!_D!EMN5pp+VoL?r||2p(GP6E4HmF5#oj
zgP&@7D1&4HOb%?DLH>Jh`N$qJS=2aQhP@6R=sr-~^@#Oawrw#dn~}A;F*7x}x|ug}
z*qDw2S#jV1rC+z5VERNJO6dH{I||f4-Dw-&69>9)L5aI5nzjOA7^5j4borRy{5e6B
zHw7=N9AG0{Cq<@Mij28Su`7$QwMLz9c<Oy(EQ;SD?~T9B3*FLWx6bML;%s_P_3Yk)
zZEtW)x2vIHYK#a%z_Z?MO+}jB4H_GiW~)za2Jx&(aVivPqE7MtN{4A^7}7t~rslAl
z8Wvx28G{wdo6_8wYEMAjJFOfuyWv+<T$~UZ5W@K>b$=uJcs+wpXNKKLmYp$5xqCol
z>+{%ZO9q#X8Zv8La$)0PXR^mWY$F06)M{AfxrRlU7+4$;H@G55M`h{b!-AxooHsA0
zXg~tOXTGG`<7`4c5nd13JY;_0vhxV9NhVChbY{WrV&NKhU!Ok=s{1x%s1%?kcK85x
z9oum$OLpV=mF!n9z1DM;+sOjAJ_#+tX;>8U)sLgw`Lv3Zxx?o83ANQjjzyGc@VTkS
zEOIH;&mh2xLhj=Y(wtM7Q6^?E>9rs<cz9<`1CrX3J79TWw6G71P8KIh)Lh$1_s_T?
z$OK(!GqtPpMIS_7qX5ju6bGu%t6vX7c}f=;<qI@=f3GE8oBaxV0!ep4r`>P)=CbFF
z8#l&wauo06_<t~Fo^Maig3kfubD;8!8OblIU!&FEPy#^9OGAeyhh$PV?&(LbZhe70
zoSS3Ckp2uAaXdDWq-(tsjM(d&9Zt0bGb3zPE^)Q1KA8D;x;oZ85$+I2c|U$Wyr}LO
zfS90JgS>T#!9gkqW#Hf-08S2o$m?;FYH(c<+Xi5(xD!|np#Nsi6jBtf6f!5K%;h|r
z0%HMx({OWFQ(^fQe~s4yD}s!G<)SZLdJY^I_W$5o()`j=Tki|y@}M2Rf!&>*o!O-&
zWq0=q=QUG5GnerdKzlF;)eMqpPfyQ1Fr?~MT2FA3*1&^c0mKE<Zcn_^V5AJFB}`|X
zhJhQvAzy2~U79%GKVlSspu8=<>>wsd<xJ1`I5Kziqf2rru|qF7xUp#B)F#{+_(AWb
zF|$|7@?3H67DxZ&eSIgw@Eyq=hXd-{g%aA&Bng=n)tEyP^qO1Qr|L1kLy%2$X_qTN
z$Zuz7Cm{9Sm){EC*bnft$ppO3xuv_Vg2!IVIQaOBQ=cegczhrXGbOQ@n`|!c;8466
z1RbQ*7P4tV$=xuiSMYE}4FnBv9ce+(g!gT>6t)~FGVnDr!ju*RO@t4X4Ke}kY#Crk
z+RrLWcVR;z0@vsUiIl8=nW-qNahs?<P<cw40yez(4x}S$NMv_fu5a*U)Fk4SH}`bw
zvji||?Pao1uxqT%e1EpF`_sVe9|Ceab^#?`fPDX`2)Kr?;8Sd}lcB(cD^ochzjzfq
zM=>y!kc=&ah9Cz6DPSb*3ix?&<QC6w>6y93MIpjaI4OH2?eAXG6?cXd7AVF@mTHxu
zhJ$bE1r!HBWbl3{RJv?1I~?A~30xurr)s#S$Zr6E8&t06Y?&gnhV0Tszw2_B6l<0k
zQVsJz&nv#KGCvx|WBQ(jXU<TIt>iKmgWh}v;7apRm{h`5=ClG6F3n?K2L^K05;jWS
zjHuSRpZ&#;AK4tM&@CrrEqM~QZ>1<;jT;_mem0w3cauqOf2!ikul@O4oQ!t;L3Y4a
zpv&st>3cBiw}!JX+=}t^FCHk8yqS+C_?5R)=N_z&f;cx93V=k>-2H$Y2iw;?a^1E(
zaJV^zCF~Z1z&=nc0oNhX0-jO(%A&p;Rc7~UMnxTSs^?$5&0m`GkJ}2fFm&2fEN-rC
z2zVXVGN`zl?W`kcZmTv7x6r^;dLI{;A6~wUW_oyRa>XtN97=HB#_};vDEtKwbEkK{
zLZ2H9&Hdcn7jml4ALd~Joe4@D_vRyo6YSw!q?1&`)%o1}tT?ezPSC|P)3TA2LRx1k
z0OOZ+S3dd7n-PLeV{Q>-I5R4Y{R{e*#ErzAQVBliQ;X<5we@Rli!i}D40!)XW4_d*
zu{l+~i}f15>H7Sb>T`@V`#rNx0PtL#;SFRD<M||n_e&{ss=sqlhXl9hRAW})#`OV*
z=hswXs0{5h$^T~~sDf*C-z8B|rcszIDCRk%edgGt%#s4wFGU~gv<Em3pMKVRkbOOf
z(g$*+ki0b*y^<dfW4Up0M-gbgnmW8-Xm)iI{Ix{1?^{SO57;a6Bp~!S%K5yfH>{~*
zb?)5!>}(IsS(AnU?6v?lr?~i#dXix8NxwD7i!e#Y>Ra%KJI~NlQ6O>}LbJIKb0-B!
zr<Zz);7Rb3qM8**fx#4)0;#rYcme4m`eiT;fCRb>Vqgpw_Vc0hb<d7-!C(v$H}|O@
ztMe5}>-;s;9h4`L=eGM^jW;(4YzT-ezuVqig_Jo`)F5J+Guwlz9qsz<o8*rmNa;S9
zRz%}}Ks|U5k<d%StTYcF3C+C*r@OP#n83c8+c0CQ8>m}gRQ-UIO}Gh{#By!Od`YU0
z>V5!BeS)!{;Y~XM5LVE<&bay<(&Vd$FGby6_*#C|dp8>auoo@vmb#TPSFNk*^*+-T
zNm2OY*S0<ud3U;G7Sn!vd97dD=w~_z6uowDUS5c68FBBHR;)b)xMkqMl%A6oH-4W^
zx%k066O!8<u0`D%T0@8UmG&wKhK+h8v{MuhNLYuaB04P$MvjF)1qj<XdjXNeAV|wJ
zs#P-t419oYz$$U|WY3y6XgV*=Y7I%3U?3X(gzu8pBMkQW^HT_X0TIr6+~0WGrW&ev
z*db;}Dq1d%V2!IBkAoAFck<MZ@vFcsuQydy_PYyX^(Ro&w0dc?zVzxPSrGk4a@!Ex
zK*D=d0f&zqiM<?!J_O8vDnsqGH)VH<T54!s`pnU>D4U1vf_s~WB@PY_S9ucJ{bhmY
zDK@?Kg)>8D#YyIa-@ZM9_?;cost8Qa4KEPW_1?_}uHrBPiZdSs*ZpqZDDz-EghX_G
zV^ENE2hC7<y#{?3ExZ9f{D&prv?zW_?`uv@=Md4?@WF-g5uJCxxG=a$HFqvvyud3^
zU|^8&-Ry`0gjIRZYIkAIj{}z6hYA3UTk}K##_s=lE<l+D)=lwpy}qtX6*S5avI{_p
zfnq<NH|<w^Zc(75q?BiRO|S6UnEEE8Uwb_FFGz|Xa)#KW>#yaTY!V(+AXh=~m@>HO
zK!ZP>K&~>i=J~L>5lDA3j2QjK3tH6kUP$YF>pDRWhaz@mB&Zjasc%|8wh;<#LV<wY
z&>&+9+8@L=TcL-(@>#JONEgtpXQvHc?GoU9WM#ly3|oD_()=vac42xN2EDl}qhM@5
zL@|oVfGZ7sXi7k@BDeb9=OjM7vJxzRW;_4hW(<fe>a2lJv|*8gwkJ7e>IcmrYd}g_
z1}R*>l5~V!D&o&h3M~ITALdlwXK<zf@u%SgAc)swhyDSX&zg!cb+_<KjHz$6eA%o|
zTljG%K9oV0u*jV%g!4c;&J*GeH|^{SzEg~ZaDJ3y1bd6G4tK!7`bz$Y>U~Tb#!yjj
z`X<bw)NH~14eg8^g{U^AriFw!1}ci>{;Xa7eoC`BJ`dO&1K6Byqer^HC_B$!At4E9
zoV!t08uwh+uecHBet~xZsL*O3nCE#9r(TxE{#QYd=P$KKzl1@NRjr5TsK`P6)>~tN
ztKAG^=Sie>7)gLxs|j!>Q|f9yJii(alflnJJfl2L^D)rn5o{r;?dvZN35U(LX!%bz
z7fa3SO*|wM+8=<hlsxhk5`%0;FQW1qRnBB%^WjrKUq%8Vm%{ErbsTaOGLAL4QU3cl
zixaboCya~$i9GN~OG=Q696WsDF27dJl&hHQ+N{p#Ahl+JWP*xQ%E%a-AGCq%JQdqB
zC$y?zJ}5p!d=u_krlp20=b<eaJ%U&vWMaX5pKObr1V2}>#zK7X(6C=_`w4yA!cgD%
z`1u1&;D^9BOc_Ha9uav!=z~&V+7NKvJD{BSeDII3^L~j0Gti8XIgFRxZVo@vyhQ4_
zdL2BO?QZ}YVdNG9z{^mQ$nI?m7(%57fgPE~TK7XD2?I|~0pTqhywNvuQTH?t8!a+U
zy?O;c92@NcxRMaAl$ts}zP0f4r-BrF`1n$C?JQsHb-`cUl+`f$3{wODOm@Msz`R!V
zWXJpHRS%y#5Rv0+V{dQ&%5g{p9<6`~T0S!w-spPMoNnms$mr9t$byITe6<Xvh?*yq
z3<KZ*WSX6;JGT7m%?-Y*`mW5Ce4}`5UWeF;doC~)1+YdDKr=Ec4v$NK(SXxzw9MNh
zHmM`egFs~jM(sn$P1eV}g*+Ij%SDf&z<~el*GJ?pHx_ionj&EU1HzyA_wN8*1^pf~
z3K()Gv`^K0U542tnDi?ke+(Q!Ifkt%^oYz;Qd4eYBZo~zid^n-8?bT;ii`Un*C&@I
z>pHJN@IF|TOxtqJPoT0KX5OwNRo`IYy8OT;F|i1sAog?Ia&(BU+j;FZ<TvP{VtlT*
zfNeO6-DpiMGX>5*d*o)z+zdQ|0m$#f$GFpOCl@><qV^}{kOVq4<@7&7k3{x|Lump?
z{q$$G^!bbu)LF*@Ayb|`Of*MVXxMC8!1w?X%^2JSmk5F?5X9!DbSJ{x)!Ug&e~)3E
zzU`3BJcl6&mO$t+{0iqiP!AK)-Pd8ey{j@;b+cWJ0h7IX0^t1%d(VsY!F`X8G+Dm-
zPBVY(&W0Bu%Z<qsUu20JU{uhl&t`KoydGzhZq%^ohW!A#T3H@fZgNeHsvuK>5l@`q
zIS|W;MV{E1_O{8D0wQ<kqa_F?5B<VqSvOo?1>7`O*S7&SXJ-A_gzIb&qTeMP!SDLz
z3?w9uD=%v70b{L<c569z=MoE~=}j1~n)s?>W7{U%YjJ64|KLR#NTTNu4IdTO{Z4zM
zo4qy!%E_iXX1B}8CdW;ngzZep;{sA3{1WS^J{Z5Y2TpxOya{$V>W5v*Wk{HI;EzeO
z$JVJmNOT6PIViu+Uq{z`3tOy(Jcyy<B4~-$8ovdLop@gE@?Z`U{0x%9M@0AsZ2M$E
z`b#DwWD&RGaej-qQ;-WFlFF)yNw3)<V46K(kLd`5TJe_n=uP~yF@BD|UEF|qqV)v}
ztXi(FZ>;#qPe}vg$S9t*PLV~<o>5Yov0&aerJ>d*-*iAt!w8+U;P1wHDK&_Oy(vn3
zJqBias{5lKc4lcyCZCL^a|gcW%p259v(bi6kCiEx1u?ZOee>)q&%MPrKNB$cz@xKE
zzdvyOvbD6(s4d3&97z&W%7~Xij-2N>C{V4F1WU?OFOsZsMt?98vcXGd`!1Q_aIgGw
zylUMB<O>7T2QeP(gnHn-UEGzc)Rp;p^YwN`CA*?Jpxqhoa{t;hLW4L;TmgKKkOMw<
z+`w3Fl}>|KCedA2=Df<%Rr?A?6HU#Uti%d8pXc+|Jk{$w_UqN)NVk;l&uNwaXGCwm
z<{6zwujVu#V6^h%)N-#`Sd^XEgaLP8{p`ECb3tLmf=?jwKrBQa2I`S;xzy%V$DpxF
zn{ER$!KlHiEoqGYUc5|{{CL9H1x%KKL`JEdhoRp%76>!65RRQ$<<!Uw<c9v=hYc0R
z4zBQ|>SvNMoYSM<#72jSEa6RKQB&*@n4;1gi|+M@b6Qm}!vv+p!H;+3ZrjOU+pFCd
zKrH3QJO0))--rLw)OTJ785C@f0_`1UQ6EDS(I$xZ5F^_reL%`Q3gKM>GEfyDW6>^M
zJ1dE^z^E6}WANA!i8mwLiSG6KH9=bW{fLq!%<|G$`(+_`5a1EmO*3wTdD-*zt8t&O
zSzo?j8`deyV*3X(Q6*fSJ$U=>_Nwfjd&{b5FU&yzB<>v=O7Zq=A^4rI0lU-{=F3Jv
zaUJNwB^nlNXTeBatQ1kD_ZFn^CoOjI7HGnyOP3%$L_fAqc{AXk#>hntzCm?tUh{h8
zf8hb9X72iL{A}t>yNqv<Bc`l9JJzc&G8&>*aUFbkQI|2(xJQlgZLIKolsq0n69fvP
zYvuIXZy6j4Rnu4Dp4SJA1)bbb@R=mzg#!JPmtDpL?*z3sZl*Oho%9~La8SIc4yqnZ
zcFgVf&0npLkjq`!TFu%M>{c}W2r2r~+M=1;lo%ep=kvLy{rKOh1<#I^X>g@7fnJ#r
zZ+MBX1;P66`bYWxYK4YBeV|F`)x^o6*)cD(j9waFD8-6L5I38S1l{A<{(b<S{qg{2
zXF=2URX)6Ij`j}(Bex9<Wl*Oz_*(wzbI4<QQklR;Yk63t8OE-LUN^A!R846Az{%5T
z2ZyztdvZCuJ$@;u+5c#?B8)c9mo?JXjtZTxs{oXGTrY`#UB+f>{qMsG5SzRZJSl^p
z%A%>*-J);DIsY{^3E}^Lk8(l|fqWruJ3NpHEMuA7xw1FOat&+4E{$fFGwfb2!jRqQ
z8VAfT!tiy<)Ce5`JahQa%lk%=*VI#sLm&&<u*dvv070SR<S>lY-R(G6{r$@gmw}vd
z*f5CK?$N(q)!mYRD|KLZdq#G0Z+B@=O=}OJTTYr5+7NtijPq|8MLwv*a8~@X!fyqg
z53n&j`}fxJWerX#EA%JxKC1ByZt%z+igAKq!LN;BmzB=T<92<Go6{$ddBYll-|)=e
z2b>^Lf(YDy<H1&c*W!QA9{hKooQ0l%r|0~g{nNixx8IKE@7Wa~&z?cXfy>M9j<gZ|
z>g}AI5Xb>b2oIAGc+$KCFjbC@-|v$Zpfcc8{O68Eeq6f1K#d7_2}4%!$R{=1I37?F
z;>x1IbN`ef$qb^EZ*?$GV8DpI2fK}+w80UlyE1MVZl*0l>rNu=eEIx&J9uF<&{W@Z
zOm;VUbit&R?ESc*sO4O?)1;=1scYHM&a@qI&f~`eZuOvRx0zTb%pIIVQ<&%ZHLwAC
zSHoTIw&V6+wN`p4T*c3)5$Wl>uiv06m73mZYxtm;$~WiB+q*2&V$CCy?_5{?WZ0$H
zm&I+n>Sly(r_)KB0b?9I7k|IIBEA2OiBnc!Hx0w!?-~HgO0nz<Z%$&=xOZd&t%X^H
z{nloK_I6M5KK(POOuSM&z$Ggy%Q=ke=(y_Xc?pE*eXr{?-<X{HZ10)nILrvoXoyw{
zh2<1~bN0-cwYf_$63aF;G<0=?%MKw;#$XR3kL#(h?MBE5q%C$QR`z6^zM&Nq71w<o
zsl&(z1_qv9xTTaOJ9y>!fPL?mFAuL**kDaFGc#kL_||2;VEwkAc;QK0T(9l;#eIsm
zZ%<tcG}>PDZft&h{30Mbwr`#iCxMO-2CEpTDc?6YZ>?{6bKcbbGe+%a4TJsH_%YXb
z8OVk*)pF%MJkW0L?)zR#&q=~lTBwd3QI?kv>5gsh=r~cuY!;}>pa|npM}gUT)Lf~$
z-WVjU!PEb04m&XDLqlT@;Z-~y|Mk_)tM95(5)wk+zkh$zS8wW}<$*tsdU^seUwuPE
za#VJ9_A}kW0CNr$XrXf(?-xxb?^Xv^3_S+!4QlQLOfqOSn@+ijQ^>hucZ!Pmp*g@)
z@8qtSn4}JS`pe{-m$d-}3Gh2v#Zuq026>YGP-`C=7O&r_{oMF-+yOQm?b0Q=|Iyf2
zKvlK2-ELA5DM7kHQb0<iC8VX5MndUEKpH^_rIk<wq(MZwrKCkk=?<k!8U+4ldA{?F
zd&eFB7<UhjLk~OFUh7>?%sHR=64EDh(F~E@A%Z!WV^Kc7{`GCsarcK0nWd$r)$iZO
z)*yjd*ek@ulM<>VceL-_O9PR{?U_g^1F=B*+az}Ydr(TnfoV-R6An=naD0#$*;zbN
zuZc(D8Uzkm2`I@}i>>oFdR@jC8eWf7VUe-1;ZRai`s|k-W9jR8dE^ZAM$|MkG;Ca4
zSSG&b%*@PHr$Ewu&;9uEbtKsX$#!3&+<89r_JGqfm?e^V_%L&~GXHe*t8HOjFl510
z$IvGybQnWPjCy){@E$boVKV;=-LJ&Q#5{Fd9RhByrL`4-zcb{c;$ykR^Rzia_OPTH
z1F>+?-TQv6?o)xkn}Na0mt;KXC>U^~@mu4uvV)av(fuyWW7?NYLqj9<<x3fWNm*19
zXSAeq%F0L}&?Jg^mZ%kGRaa9eDk|#2Oxt)Oik_PrA2pI;7Et0}_&g*;^mC6LS@}Ld
zNSQx@HQFD+E%=YCf|AlDGcz;#7mRarbMPl46O+*pCLd))XjqsOI4)$Xya~+BWy{RW
zyft{Vf*4&PMmX?^d_$j%Ucztert4|8x3>|W2e|0)3V1ha+MI#q=-Ajm0C-j2@L_3X
zt2CXRp746@S|#)#ss!e1*V16HYvm`@4{YV*tZ_!{?Cee82vEn;Z_$&2S7$7F-CGk=
z^8qaekjO|M6ayAcuV0fam-<8Zo_NDFu<Nb3NHRXS*+oZ^q2PZ=H%iEOyBY$D6*BMg
z^)>q~U<v+4gnG&L0Iq7_PH<76aB>+tuV=e{y#+8E->C~&SXhaIwxk@KoZ=Gga2eDM
z4cB(uL&CY!O|J_ImV>v6a5*b0t4AGxhN|mfVPQr{N9_Mhu2~l3Z8`=9Nm?hl8W}Y}
zMv^=W4SfgqzZ*NrrJQ}3`E&c8Dk*u9Xb-Pke=<v(qZR-GnlZS-wW!B;<mE*RQs2H^
zDf0vNNypC4PRH0drF{{jcW`22jhEKHGBqJ#I4&h+W82ey!ak$8xEL|r%K!AKdwxDn
zDQiGt8RxbRtTP>Wd4gu%<0G#L@$TVa-VvyuJa7VMet<@&#-Vn-f?oEAsHdl=@%i~D
z+WGbKxA3-C!6?TK#+GvSVbz9Iz!gncb$8S2*|ytkumwkvzfTy1>vD?MI4fL7({&R*
z9(d$+7n@3&0ca0wI5|08PsY4{?>#AQ^(#2ZY?yRv#xnxw#i*#+sb8l(Kr?UcMMOm0
zl<WSwP5D^bI$#h+eSLkZs}*o~@a0ebOzmEC@Q>_TTCz&moGd9R;nrafoubC5^R=(1
zzOa8jUQ)tWS=c@}k6zw$@&(lAHA5fu=6`(Zv#Ln}s5xgJGP(z1nPXhp^;dN$uojk%
zL~lH*o44>NqPu=7sHu5WpFxkiSXNJev7@I)-rap)uzf&hyzs*ZX}EA*Q`B(3gWd!w
z&cq!uK(ht4@xienNZ@p<oEQ)jf-hgBQ-dF}#VNsQ^)`wM&R$q}m?I+S?Cfl1YwKz?
z4o#}Xx5U|!?C(IKk{3OJfSnv%dpIW3W2~#2*kv3QNIwG#A9%8ikB``65gKH^?Co31
z!aXlLaUHm|=Jt;4WqhC5;rZAOeRTHf`TmB#ec8Vf2z79S>$f(NB8-0ZinurNk1#hN
zavQ(v@-_3`YjY%99DR;AZ+uW;-j-mln?H!mJdD67kDBv{*9*K#y&2uV#v8%n09L{&
zt}G{qn<@hM*IOS6baC%_gNWSw-gs7F<unj$PzPjYXV(}`4GsNzoYp&lC|_Z`zGv0-
z=i*|sSuwq&<a8k=9T~UbmZuSAifXDv1SoN84FO6eq@kJYA<_d73cOk<kO|@{=XsQF
zR2~qMIhf@U>**paEZDG4q1@ZfyBThus}A5?&-UnWVOmo`eLd}+J9oGfs*`Yv3X>&#
zDd7#|eSAK5{Y2ggn5^V6Z|}>8UH9iZ#}8lv{R@Epyyk6}8(1?yim>r&<N^oFUqb~G
z@u!bHVn=s2itOut|Nb3tRc3v2J&I29>}~eD6kc;|u=V=sRtKOPgMa`@sl|6`Bco(B
z)<xt~zzfieh6;}^#S0T)=6!SK`+(Cz6opR@(OT#CARE1@UqEVVYDzBTKs{7ousE=7
zUF&3TWwoW>^*uh|ca{z@9_>ctQ<J@T96Y>MaQKQ&NLV~D_jZK?-#>G-v)g^5#Udg?
z3H~_J5NhY<=Y3za#uu&MRcmVs|0{R38qs1SfhyC<VB|5xHhg~&^UKQ1E0=O(=|6Ck
z<mDv-9&T8>$OC9wq`#~CL`F$@DNgA*+#}!K3U)ox(D6=Z18)EZ4vr7Q#eG`{W?Fg2
z8GPQLIgpgcgfzbYLDyeS4x596LtR_@*~*GdIF0C#?Uk=^WcnQan~KmTp>BPPzY}Bt
zNzvGQT`-}`hfANv3Nld}jL7`)n<%HoI4i0<w-=8WgG+(m{QI*txJBv{befp`txhgB
z0!tko7x(kAhfe<B9CUoDtDAt?TU%Q@Sk_k$QOtPN`s&n$0MOU$4!|H>ryIV<k1I=Y
zJo85dz^D`S7nP+|dkeN^ofY5iCk1vSmz4=Td;VN_&=RS=YTfPCxi_H3psZnk!B|pS
z3UH#41Pc=r1|W&j8X7S_b`<glk9{=6LBk0+c*m+2WRB3tNDEEti=H6)KzN&+9&O-R
zU%Ytnz9myL?*@qX5;lzt>KapooV>g*k6g*xA0J+ROzUku8r()J>i#Wfc%XFZ6)Uu&
zaQO`jgR=-M{xMU-R8V}2L(F2*6o{25;s&Rc!wJG411swV_`ac0Q3(C{UY!ko)WL)a
zN<V5?LJCSsfow0}RzNf1Dzi}o9%b)|lA@xNt}Z#swui3ZJ}1|X$4TR$XdPf@Ex<m|
z3{6)#XEfK?lv4)M-}*cS*%T-xObAo*78cpVr*Uy{&-?o|b4>9e6JEP^O*P8e(GlEq
zFkzwzD@!vBP(6{s<R_qICZeKR^}xejp`)OnKx{d|a)SVHM5h=*%Wmr2L7Qbq4HB9a
z_hcYrk#elg#;*O9{W#!?Qc(Lt;>!B6aqr$e#7_h!*ntxK;ZQrGeE04hXJ_8{>w1Bp
zvwJ7vb_rsbl%gVzi;IgBj5LOrcj;7^HB~H@HxQ~SDmH<1C~Gzk@;nlZ_4O(DH>Y`M
zf*{%=rnt~wyo7WF>b>FF^49itnZjWvxNAVi6f;&@T8bF(E$w-Q(~47q^zgBF+A&yN
zr4<zs!coz_#MvCLBml;b!kz5%(;>(|_LHEACP%`Fj7-q(=!ZTlNbF!ed;eK*u+ln&
zeYm1ez)UM^GYka#h`93T=m;qUG&MDgz*QiDnE&wD>r|K<ZMD}PvI>Y4n1qEXp!~Y!
z`s=c4idYy7D4H(!XZ7zxgnAtpXWEy32gx{N^_A&k4M*P{i@f%15?;x-w71uOj=@BE
z)zQK=eJl)B*v$-xdl&Gjw`|Yxv6uj2s|lpR)F{f;<`4rXJJsh(TAG?$9ZXU5!os6z
zr!be^2%_|`mX?;Y%ddiqii&OkXVsL~_^Y6D>P5rpx+A%ujdnC6Q_WYC8#7>{cn4ye
z%n8UNV;~L<(EM(aCApJ#5J7)Y;_5gc+5O3V9UUD356X^eef@_k8@jj>x_m#)XZBe|
zCnrbTPF8*U-9lDQF8$-jwYT10c-rY~j2s+a^HhfsFCFl_!G6>+q;7JavUx=70L7HS
z>nUUCLO{GZu(-X8Wnk89G)b1MI-JuQb<!UpG!+WX$4oHQ2;CRrlb-DqMNhc>EK@w&
zR&PSm4FLcf^E%7Prk0K~mhDM8o7tCVI7s;_b7f0^#LHlmHR-}z5Z}$iG{8uOeUi)x
z0x-jXagK2+EQ}@?8vERh-Np0@f@eo0{YAgj!~MNGZyUxBJWi)lmhuN}NXW=!GWswV
zTEv8e$ds~NI#^!kZa(qqIbXAsY*yx}TX3VQoN!TYXc-_g_WXGjzW5iD8&zT{t}ZU1
z^B$8*P-mR>Jf>~{(TA@HHd0UB4*rq9IdC=tH3g)I3;q55=)Wf)-AvNZ)de@98nh(!
z6=jvbR#qB?b$dews%~6fws3l$tmNgOmvAvArJn8PB!YovQS*`(OkB?wCBfI&_c|oT
z^MlSn=8SwR0XjRF68&c3dfSU^6Ko(x@W(Cw(*fS)PPp*#0K=P&XfGv4gzqWkoQ%M0
zOpZQ|SDnFb{qd!LU9S-6A!hoYuJ<p9)4-eeA1$=3te^QmZ-w9*f7&wtqX#A;I*L&I
zuVMFZs#pIt>|UrOLQauRQ4sm{nwqM7^oSFIE$lgoI`Ev?21{XV(aVgCouKdP8yO*A
zyAc}740lw^_I!H~O<Od-Sxcx%$c+W3RP3qSlR4m&d>t8>iCUf5I%qhrOZ`Ie2YW@*
z>jv(=gf9#r5Yf>^Wo9ym?1Nq5EQ|-YU=WDS^wt9>v-W4*(fLHpe=OCspU{0ch+wV(
zoSqmi2FjcODi*;*K;0OMmdKnryNK}$hw6N_L0wO8xz`waDW=WOL7(F|gGea)W(J&(
z`25l|XQB4TUxzpsdcIfaoSn(65JQBgVv0-p9$dstLZk$iu4><#^)aAAe70^?kdZ)p
zDF(GB{yK1-&CrJ}y44CzxO8!$;k~xHaRl=I8)hvR!>NV)(@r0pACrOnR3u?t_USHw
zN;9mIM>u|COd5bASl_MT%ag^pt)oL$f4XmwbFd6<5Q_ty*hEIqH#`TWWzPIE@_Yn$
z$jlAJ{?y&wZ4z=@fcekXeAMA~JKZeDg@sS2z%?G!7!CbnzlL1k|MmI~t!DOvxgdBB
zVNl@yi%8*JsZ-)uek_uxf~Yq6d$$Sy^P4{U-uz5W#RKh}=g*%L-r;?Z_U}vj8W%k@
zVW3O8a9G*jwtOrA`@ic6BXwFaD_PV-IuAJ>bX0U|D&5w5WOX4AE0Z10JmwdSFt_>=
zF~^1pXmk{0`lZJ;5;$Oz_Rj-5o9d5V^~aBwXJ=;>6cid^HKp}gp-{rY!s>b26817A
zcOb?xKt~Iq8zTN8V6WlD=Izo2_hkq%8-_4G%KU~F&KXEeR3rFz5t5NzcrHD=H34Z6
z@{1}j7qn+U?H`Zt*Vz5ADOW3uu&TNuD#{Q}`SXA;{r0?fOfYBtL6}!mJ3);9lW)=D
z4Y5kdwRZH|p+W_K+qh=lGvh+=%mmYFC#AU&@IVKk1156l075|p0MY<6kU-t(>pKEy
zRt1wUpFfdNP=tktUq;=Ax(oUGG@|bBYicL~p{TB|?&$7r1B<`RJrq3y0~+LaIO8Z3
zq--6`%lc^lY5|NrTN%<YbziAKmwOu$F(jVl9&Sd;`{9e-rjwC0iKH|U=`Sv=9i48*
zyjO4hGpN(S#VvP|rJP7f6Y=6;T3%P-qOo2BZOOPJf%}L6<}yBQ%h?7ME-M&7rX`Cq
z)SkMNtES2|Q907@4jB-+wbOL?uM0Bwq!QS>yGJvzT)OOsPrR2hG8(o!VHjSwqe^m5
z+ho1uk-FqQc}usd)!8nqA*jz(A|l%;Ug03`y0MrVVm4N05^|SB;7>P$j*lt_Trbci
zGjMU;wedb)&dExjgr?i!l@cH=q2b|=t@1y9l!b5yKAizjp{GG|6atxv+UoP*VDzGW
zHjeAppMe{%7r0*Y<@tgsgMy06>sYx!dW9|&y@0?E_OyrN*eKv~JAb+`mW-8n3sqP=
zl9Dh*w~;s_=RDhy)X>rm<*N0VuWqLc@%e%Y*TaQRdb5E}ZQ)nCS9>JA{9Ty{_=d3<
z7t~Xda8VcQ&i(#4wBuh-;lI$Xnj$-Uyw^`t$}V{>Oj@89lq<Rsa9rFTNO4o+_Lgg6
z?m?ONf!X#uVRbIUi>MB6w%ZeB)@)Da@x*GZh<@|&XSrEQ?32f)cw#SdaE#yv1#|f=
zMsrFGYkM92Oo)N@{>IvMxc<-@qXK^ab^($-Aqo^a0PuB`otV@^p$6#Wl`B^et4)|5
zW8~)_$l0^QVIFs?Oj$Gkn4j;e9}n-sYmw2n^!hdvqkNm|V(-)_yRT=NQ4OZDw<xXO
zz8=Y^2R!8%(W>>kU<&?P*V>A6V3pVM`0>RIxwMQ@Vw5@zV~zOlvXzaF;<KKA;i^QT
zB1_0P@X-EHv((&d-K>B4Y$IuIJ%Jkyg?y7Y=d1pT>o-jq7>dd&o1bhLHnb}W5N?Tv
zOl-5~J-nF&b@?_FXTn^icp(@86C1TH^+jsbXaR=Y2i|ocaYV{GkgI!~h<&nQD|pag
zeC!MIcGWJ#mmh50Ll#Jggg=P;Qg)GXp_{C;o54_;tQDK_@w(&WRMX3gc+W?C`_xF-
z@cd6XuULLZM+x|y38UymI4<#6Ji_9?o-WbeW12q2pCTIK$#0?1{xz@E5)EaWz%@@O
z#7K6SEVFU=S{sronVGq{5sTlN_YN{KlFo+BEyAPCaTQ##R@IpeN$%uGkBcKqu2K_v
z3$1T3{nVNfB|&)@5Ee{WTuNM;t%`*r?|z4d`gYjL^KN4eEqY_+IWBr_xK?V>Bu&1!
z+a*-d@23|GBWE3#{CFbk<|EH=BXgtvE}FOJXC7iVyl<jbi?tmE7#RgfC^|d2htCiF
z&n^(9rHT1jjm&xASI?Jc$FjX(<KU2f^5hmYjz*urn;s3Uz+bioLhlzcH*yN&%!s!e
z1_~J}>)6+P<_1c2fVZB36y$z>oW+y;4<BMJs+brL)>ivQxEB^xQa4;C#|Cmh<!SM4
z>7>zWq?o71XlJ_}6>v+)<4u$sfp^mSuR0}x#J@+n#`A2QC)&seMb(oWlvPL5r=fu_
z;}aT84C`3b_>~ge+^7I3U}}skp*z*wUIk^qo-L9p%mAxK&A6}#d4P&Xz}v{#x%joV
z7qlY94?BSjO|WA7?at7UQ*s5BDH<s2+jOQ{n*YiV&g{?4x{%Ob^<`D6KJ_N#Qtr4v
zH5?P??Tf8;J>g<We;Ph5{IJJXlO38ZNGGwe+#5(!1pXfIBa+;0s-XX%Z~1Y@*RNjy
zQ&%@KT0fWvauro)yh*qN3KQp8EW<FLU+dCS5HI^(uy_{o2s~>C3?JQ4=n}5u!n^i&
z*-vpt9}NCL1!y-!S>2lVz~5Ua&W?pC1wbJ{kW%N+QE%d*sMuL9|LZy13-~PX{%RUf
zlbp=AXCt{}y<hY09re;<k#IW6sl_Q(*@aW-`Vw#KwuPgete^L=F<$O#G{R?oZt!kX
zH;7S0_0ouq96Tl3<NX_ND{&vrSG(R26l4(LP~w=e7xRcLZR{&*-K1XWG}p8SB~fTZ
z#2$O6*@Gg3!r^8s0b}pSv;fybUPV=9>y1JGg+jr}fb^+bYH|1W91|t?XQPhVm9v`V
zL7fwc8<g&1lh*EnyWimqun9Z8e_+nMf(u`JMck3B<5O_`y3fvCWBP%AKG9yY)8xkO
z!eR5)7gr_h6$mk{<pfb+l($$ezxebt+#b4Y{4P7U_daQwd4yC{xQ%ah&7L|io<FIL
zuADqAz1kx1P9oxjMRh@ikVJiILtvbnlC-5oL1tQM&nv`OSvKgZWJs7-&p1}e`l0>@
zZS*2qt(@+ZI4>?DJfT0`X(@&*Fm>MocPttT3S<e#>l_?P$92&91#cW*y$KrZ{!MXW
zsk2W)p1&W$VDy^ZLrY62`spPkXaTGJB=E7Is*0R40-G|TZGC6di#01J=YdusYx->4
z`18-}UFK3M;Xf)o4;;keV*4F=`?qG+RZE?^xKN+Ek1fttIH|=w`+o{l$p+!TVSb9J
z^iqPzhu@y?OU?hwTfbZyWdXu%(GWvtB@RHrpi6rX2@C}|$aBd35YH>Ac*!qA5d%H1
zhn1R=QY>u}kO3b*UbohBcfZNU$M=3<IrHX&VGPt8m0-B3mmQ(qoSQQf1H->woAQ1;
zH@J{juU@6K%uE_Idb|n!pi?bAk#OlCv6BY_fo=|+_~SXu#}^0~nRo~wWX?VQOyY#Z
zM%01F+p7cF4EMR)Q@$!KLFV6dUuzutczsGRLn<n@S$4Q>0E-VLcG|%Naa^X>gQo-+
zb}jnw9QTA@HXSW!T6p2bz?vg)S|A78vt@$6T;lQYF4yM*sYkmT_!X(GjzZH4GzmBj
zfLNjf><r%M7sweJz9UIx1!*T>FTZ+)7$w=W@5&fy#I*Cg`20=f`aKQ?cXzYXuW|3(
zULMOrE}qN2yK{?r_AvDfvw3*{74T(m^^JNu!&BrCvx`4df63KwXdu2qa!Ekve)>^<
zA)$~xB~PTaF5HyWbFZ~2?En)>68IgjQUcIIjMq(~7=NEU_D13xE4J`bi8?YpjG$n~
zzc&_7d+^%+xTmSgkBDjE9|P~zIE*-f^s6(D0yN4bMEc)>QLD?fnX&it;m(F);~D)$
z-Ey0&KWqeXA4B~8`#3Vyy@vQR!B7KUqdtln1*Nak)=ZO0@ST6(W9ioSvzxE)$jQO4
zq>n|RGzQFJE$iR9c_GJiPzx*^XQ9>wvIyL96qJ?CrT_ALP!#8q1>e)eDPoBSYO<*L
zUn-vRNATd55WL~v$EC~vpr1$$-QoC8(}^5i%(R@!TY)^z5h+5fE|7git$wP-A2#wx
z?pYs>B7aK6B)4ms7-ZaHU)l6~Z@3BH{Pywi!SsA~l7oxG`EY~N0ABN_H5xpKoJNOf
z`M5&6Pt@Gq++Y_Wzec=ayn1i#`L@W`qnBhsG}w4r8xkiCCmW&@Fh4C78j2n0y;*%B
z)#uo{sF~d9Z140yjFs_H0PI{qWW*#lb4)wUFZpK+165@QrpM<VVkc{*w3Xh?K>gE<
zD1>3h!00y-kPR>~9x3B(Y)p$#K~Tu|{+&M`#U(X?D|$-7f@j(=R)SUg@+G1TxK##k
z*$g{!$Qb&ItEICYQc_Ato6gc9^PM64fR)Y9o3|IilzQOb77&>JLw|lg#1r>cg~#KW
zyqq%(@YqbCzaxhsrBsAL9+2YiN4dLsS~>9DnDKWHmE)S6a+jxA-~4BLz%vmSYx5}a
zU%h8wO{9#&s^*X=V6Ax@;~J$3NMI4+`_8Q@pQDnleQ4+YND55^B;6^NY|do(2qvh&
zZxK;au8d4ggr}YfU>dC{D`9-WL#Tvf6+3HdG`~YMp%bSsQnL4_Pq#2&QZ6|%r?BCS
z5+n`hQY4P}nh#|$20$n6G;sHGn)2fUaB92o2lT(H(~>Zc0tjyTG!QY!#}BXbO)CGp
z*8Z=S|CdfNKKKN^QTf%&;!c2Z1(U%^0}mbWW4oI&04|7<qz8Pkv6Gci#zo!!?1J^B
zBSxJwPAc+6a9|`p(Y0&(%bRKv!a%baw<PlN5k&o6iT>0QhR@X`?NKJ;=a+DZqTl4<
zyJ!n&d#>jJPx~CE<N*dCf?^;3WV+${O9h%G7=X&m$;tTe;e(_Zo(LRJ!F^nSw0nEi
zVOpB|Jp#i*)I^(PiD_uz)S)-74*Ubo&y;nvmi32>BMg0n&dZt?P&3VN1VTbo;9(l6
zoS>T;4ofg4o|NguizmjaK?7OJj3OekB&5GG-ro*_!zNyfwz{}8qQwrVF*IC|MO%TH
z29VYS035&yK;ZMmtQdvLR!tt`X~H(Jwq}>rkOlfI)lL$s4T!`%^@r(NQ8&`h(qDu<
zT_;h>7``A#N~zx#9>c(|74fr+|Aw_@?!g7<sP{@;7cb`)`s1}nUN!rX3owYx4^Blz
z4(4lmJxjQk1f(K^gGDM8uK^$iEE8NRgedCYy7`v}kBN^DhU=VOUvEr_PIf(=ZNF<v
zw0vyrQBiKLf>JIPn7}|Kf{p_1J1!g^+N4BG!?PHsAR2T$4F-m0+bRJfB0L}X#^@f?
zG%rI#Yn{jK&4Xz0p=o*d@;GRG))9IzQ~(9PMU~13h<bw{e?VD|P)xNKeWO!SrV4w6
z%-g~P90w{I&}{oTM#5nCDqtXI=g!ZjxpN2Gi*4fYU$L@ci&8VDOEueTE(1n~La@0?
z0#Zygs63uVeI)>;TTgJt9=H*OLw5rt6FTZTDehOOmZ*V*{QHRUhE@=;aZ~_MMzAO<
zso=8Tf{COVrk$tY#0(oJsi%lWD=8}jg#8lER322A_EK=6|9N!qR|>{S%M_Ao+*MKn
z_X@lPm+CGzPzrHHshJ5-YUt^O0ol$7ypL9n>K!w)^zn7HArZw#j~)S$9%RTZfA8K^
zL`7r{<*R!BAeagRN*_BkZ1sthzI0Hc1m<=CN(zH8f;=Np+`D4<%@8p12;2Y|H}Hby
z+jFhHu`OSFdSFUZ6m}oz9~b~M@FKwL!*))fvViGy1af72(Q74uVDGfPyBd%+59?BZ
z4EXTj3ji62@dYq4q`;F)fo!7LNdZn7g6uy5^#!$=5c%a?u<bpIghQ52+p?96v7L+K
zbXcYH)F)N=HFRH~vH~5oVBU7P_YVHm@uit&ES!rg*UqlxHLrQ}4bPHc`zPMXr{#3H
zj_+=n))f<7VKnJyKA5HwcY7S#Kfg8}NuBqF?12Cns$5RB!5hh*+w-8%@c%DD0#_b&
zxW=FHc!Pv^e%ei6`6Y#U+bvary-`a!Y7y-)?~ONsM?1t5V!t^Y7q!I}DXS(};`sRa
zvrHd>IvHfpt>8!kqL<mSPqhotkX7&AZ3WZHZLlgwKpg;n!Dtd7kzma{xZA2<XBJ)K
zL)Zav5AYL#4j9rbm%R`l-xYXfTR26p_nYLeq(NNlj2F=nMhl=<D7QZY+R8l-aRaJx
zX%`nh_<S^E$0*=()7lxHo`I_livF4jqCMWz<zQ#uPSggK1LWRTAh^KB187y`wo6PT
z&s#bGRld5G*8G4M*oH}FuEWM-WQfwhA|3iEWVWyfCPNWpg5y-^5kb_!z|OA7VQhT=
z{x6bB>9pH0<A5+!_w(PVUqWqvy_%U2Z?<M%nU?zr-`4-sHaAWwROi#}jNy5hI5%H0
z@|gWb_F(3rE5AF>1N_!!IA{?~P8-xWb?%wMi%j=>{3G`{b&9G#TtaPqEqSEc$w+0c
zj9a0tGauL*m}x!W^y8uQ_|L8mHC4H$lTCAYK0ZoUTRou0ZB?u-88%3;YVe`R`DXEK
z(ue;;X$cB7mLc!FR_Nb4GVXwZA{iVs9hhtFNaSaYt_?U=kPjIV$J(&|v!dhb)FZCt
zw4{FRL;iv3;D>3G)=P_<j7fp$c)Q1!I({B7Ff+r8PYCH6FdGhANx&}fa>Lmk29yG3
zuv3Y~>-hUH`DB?&u^l4$vAOO*RYp&b2ng^XSSr2!W^G+Oi_#?H&YN{wX~R0V3BPR3
zy)3+ytWLBi2;GlvrTK;IJMtO1>FC~m=ibb0Bscu`uDZN@+2^->C0kBD1GaM{BE1r*
zGgKG?HC+%5Y_o+&=)G^XJ>`7@?>PXiNC>2)#<B7!nY6?U5pt{h&Z)i@E&J;RCO01h
zXuf$yASrf9!>+k4;)so#yYbtbQZ!VQM9sykSKVld?^Rci0&yPF_vBI_Axm=V`e;Tg
zVA}Mr^j<C|#9cL=thr0ugOPV$eU}5|9so`%in~H+Lxx<z?H^&xZ8ZTkR#~bi6!X}4
zC$mZVT>2?QbO2DzVJg0V&E-Gv*NEz)N7sO0a|S^MfLJ&{^<Kooi;Fd=$c)XOQiKH$
zPlu4?qMH&E!*ER-@y>^_w4qrL%;N*s*wNMH`sAH-S^)h;e4J0V<uESwQNR4_tT4bE
zuwxuSoiPDmL%h~xWMqrI%AA6NS9$7oufRknLicQKIi(Jl+PlKc6<9}geEarH#iH)E
z5+Ja!Bf$GUtM~Ww(*})C1Hh%FpAVI|mTjr1txW>a;8v+ofK?Q2>m0k*`xjwoCU-xz
z+)WG!gbg-9s?y=T#9%%7h7vEfO#j{ZXJHd@_s6WN^s9Tr#q%-pndB&X^KNRZT`!gC
z5-e|8?{9fIF~wO}uID}HO@ZDUP1_su$_3htC+n5GwyXEol$2%K-U;8RteDH~e5N22
z#@_h$hYhUfu`Fec!I98ASXjNVWgCROi%jy;mL7I!jVmR5Dir)IGo6B$K0?i6ZH>!t
z(X`j5E2~y>XOY#U^~IpVU88`5sqsxdhRpkx?@L^G+&4c(s~X?`s2lMdHwWxv<!pcd
z8BnA8+*a&+LJGS;+*f(a+<t-XhspQ1S4V0qv0;3<>8)UoVqJDTPfuf}V%p*4X3AD#
zCgTdOf%|3~bXgs&D!0G4)0wyWpRw9p!YzIT4d%h&e6)xE)FWnArrooXZCMBI4<2h5
zU4Fo3GK9H<6gS8tX9jhqW4mpC^{9cl3&oTD(Z?;VcV#_~7!vBDV_z*Yayy`La7JOE
z`1l7qzJHg~?7zP7a~<Llg_Sk$Jk&yF-x3va7Au6EzXU`^x`Uf0Qkcop89fvCE`v>d
z<P<_t1@{+={M`3#VElum!COmX+Sx!0r)WP#*l7moVlpcr4}+=z7fjveFF(r5%Y&5x
zyzi@lHD?gB0Hg7`!cutxybS>7$g?CwAv^DYLIMW|=a%1}TQK<JOM4}I&<57t=8sw>
zLQK%H0K{WzaT9=V5Q0F~b{ggEx@X`B?J~INieAeDWe?M7z3ZZCWt0vZ3E=-AAHp=b
zTLjw}U4^%Wtc(~>0Qcx)Oi;A1S+aL)rE}k33=CWc_)dmrxPO8DuPAfx(in;V*3;KT
z*04BG(V2scJ7*`!SA<Q4rY|d7vO+#Y^W6B*CYO0S>~A{wQ4b&I8dbSw7;w6}+c}a=
z6XMsqEhY^doBBt?zMX7(SUs4W46>R(J4K=Np4@_{IkE4K{&$6!jOe0<QVaqFok=KY
z@!bwiCfnjw^2I&6QxlY=qT?$F$$0!gF6h&mm$U;V^1|Y#+}#LTh$r}6s_$;R&&(tQ
ze8cHhA348Va7)X>vI_ko%P2vHls9>D7TG)BFH+f(ZMiRFDwB-&j@dLpxkWJloa_=!
z@a(AB$Gq(c*Lb#GfdA9#O0|@z%l{vgH@IP0@{pblHo@s@j7>_4h>ewASopl4ZA{NB
z+lb3Ul3q}76+F)7c1I-tn9}GQaOqa_4W#+DURo8L9V(zg)9q<eQqC9OU*LwA7<;V?
zg-YPo+rb?j&F8gH$sDMDyZ&yqB}~7!ah5j^6Q+n^TLk>&<z@VJAVNTdhaN7MF<=hv
zE<b`GsCNH!f5i7jU|i4CG;JI+&NmRpN%BW`+@C)_Ep2UItOS5;z4d2=wFc@YmQ!PW
z{YwCBA_}XAi4i63tu~HzpfrS9A<hc}K^oX&bfBy%9bFsPf31|&d<HTU?gv3Rdmuf9
ze-DW4+sXV|gLJ$sKDTmioiytJ{JcaR>F;kN{ehmutV&_AT9cbG<qc<U4ZB~CqJ*Yp
zTXHpYR~XYCmiqis(G?NhuJt|1yb0-gN%9C2_0CIWG*<qMxq(~vdjG2Zl3)1mDR1Ex
zd&2zOUg+Arm|0kA#nHmTG)(>+T9J@gZH-#$Gz8((e85CKd-hC3{MV=2bQB79xpUS3
zrR3|&rKuT@QMCW=_>U{`mu9BuS39xe+ka+fi8Q&;)6dksj|Jj+^f4Rtg*w694)D*<
zyW`U}1!*Kil$VN2OC_6`8Pn0Svs%L;`?f_zxf^V<G0WaIGviZD`IzAF6>VsTaXdmm
zN9Y{&zI<@bDe_m?sE<?)#i8W6`MRQn$ER4C32dT5#cPdYGGO2Xo&rS0lXd6;`Q`Cm
zEb&mxW=)G<dkTFI$Eoq4QOGrQ05>3?A=?UpvTJnN5`;;bzgz0rJVEh+T2(Ko2U716
zF77t$Jyv7rFrCqUk72DI>M;;iYXIaL9Sx>3xw*Mpha=!(pxiJ{5QXt^GYk|S4Y7d>
z#;&%Uw26FJ0fHJ@{<G+eauF^`Do0g$I7At8SPz$yW+#Lb&(1thL+KM6Bf$l6{<|?h
zET(NcwXS~`_Y$f$bFjbDUuNAuEjZb%E5uxNW+t}NN`?wxBM?tzJDl<<#Y7>Mix^OF
z!uXAYvR6=v-^tKWfiv&4Yihc&Qs=53E4J|X3*(};`s9bCXOa8SbMBF-HGCmUG{qGi
zGfP$rw^U_{f8qV;nRMBw#kC0*RrEzxLPUKx4)(`~R+X!LYTEbggnoh}M8l8$p9wmm
zViR8ZCp#(e@fL;7Wo3zJ+Q!K~t3d=dD3tAxom2H0YwA1a(3jZQ(6boEbp1pkrT`^g
zNohedKAdeNw};GqPYG@vE!}K|F~kKmHsetX$|R7meaQDMbT(amJ`clu??+;}5qo%J
zzoSPvKlfW3cXoD+hQe2DD<}@3Y>onw#T-&PjO=*S*8fXh%KQ0A0Nj{)S_RvJg_!z2
zwqFaWq^RK`v5>t}t@4B1K;L9}O?J1(?-wu50_TH}s8PuTNXx%@&FSg*vEjl%WW<4c
zqiQAO3a<?b%L!r5H;2$9U$gI%wqm=>ITDUZf$hT#4-ck9@dO3EmKV@bpjwXbm|_oM
ztElyzXgD1=Ooi%ivZj9O*!Oq-gKE{Wv3O3B9iOqA8t-%Iyj70t_J6Pgf4lsNhtNhX
z6&v*}i8o^tg9#S?I^?$FvXpg}={Njz%J#2VI*Dj$pAOwuK5!CT<Uiipx~TGY!54dx
z*Zg6>u#S94=quLMTDsL5CTaV1hSbWtr|mf@O5%BgHb|xBpQOSPk|MXScul8y9-AYm
ziT-rM*6d^Di<d7EkujKlR{c?gW)gHQDBHR2`VB3A=-fh=X~(pUjPT-=erl!LH)Gr0
zA2lmh*aXkzaLAa<Rm)P+!)@^kZw5~Nmh;MLjfY}SHdZSWQSB)T`(e3v!MY5^K}AI~
zRJd~H4e5t=m92V?tN8xl$VJFbZBeu|(Jho%sRi=taKw4*X(9bL{Cot!n{vV$_V+=b
zZ<jakymB5gGq&-zwWW%-`}9|mHwuN6+kTEoZ0a@=6)9WoqkA)Dl{vL!M;N7+2L>uo
zS5%F9G44@!gWo?3DpI@+ZDz}Kb?<@x7)OI;OZg_n#)rj&+2(sz_T?sPBijzIR7t40
zy*WUBH6N#A?EGQRTrEoznU-ebsZ9ASBp{%GRkr?$05Eq6JkOQ<S&ND>)%vB?DaD&m
zjDj3A%_D&mG*bO*-T(kdkg+w8f_w-{PEbDq9&BuRw5kXe5p{8PygK*qGm4AXP490y
znN#gwUCfT}uivO04s)>hxyrdOGnqYd&86SWtZ049^kKv4O~5u{Zh7*pbSKLUtrjx*
z?%U;{kJoR->v~r<iAacces3kklX&1`x;`o5wlZi;#=w9+H=ppn#*6L>vE^Kp|8;be
z<kq_+<A$W^yKUn}rSYVtWq%SH7OpdsP{Yl>5+Nu1ELenOv4YosFRskcRL3g-Fx6K)
z4Q2SIxCBv+$sWev@x*r3DPO#(U;w<Sa*6|_f3iNi8Z<ZUI==k=xlGF{<J@l0v(@nD
zrxD7DoLe3v2!zS5zrIO1ID8tuFg`3>qDHRr#-*Gz*q;2Y5QtEJTZ=y!ZJ#Mfh*Hgg
z?SP#W{5<pN9&^D&f{#+k2-(`rH!8Tr-_}ql0trP~DQ$f5yyF*uNgEf++u41b#<`aC
zv#X%h-ku+!-0%p*8buF%o5qWHpfgnQKNn5+-{;SJUtXN`^R30xq&agnIs>E3P>qbt
zV<psk*ppK@EX=CA3&Uhxaq!33i?`Efq)<?M-#h3uFtgw6d=*MAsHF5UOy`q=c!rh9
z8wv5D6QwGB$>k~ULY7OSBC<YPQg}ADJ#&(0=1h?CV2V8s`fOex@n<UtvskA#-i~hc
zUSnZV?joT3WY*-cqO-sE+Hg?$!^eCK6bKA>xC;5mb&HZhtrANl{eQQ(6Fb5J#9x#G
zgz=+MQc#pc2}|;nUoFW4pT1{x-nP(;c;7SchZFquYu!b-B7s<8sE>=j6)74dhTN}|
zz*)DbsJAf9c3(UK`0~s&gOfE2zm?8-CryqxTJJkY>5EQ+C(jgARU^k|?LguSYRUfN
z3h4#tw<LOMei4BA0T6_)v8}-CNl8gH&Mz-7X{;WOf#A;AQ6@`M@%$Vx2GmS%rNo^5
zNJ4&^qbO`c2`EgRpDJ|hnnuh)A;(G;qa&mfu2IcS6&WnVuxJ@@3FM)B0R$C(>S*JC
zaTWivSu(h1o<Tx~cfF!kZ6Axl2m+3I2r(`Sf3jq;NA0#nHszZ)Hq6)Zyo_#-j~nsp
z$V?l1S!)%hyv(iqJgDU&xNAR<U%2mU0=GB)Xm_e%+~p$6e4{t9C127`Ax_Q>8DND|
zFf~J00I|?9B+GM^V#8)>JcjAs;qE}Nu{a%8d{<^{K|&AgKD}045zU20L_@RwTA=6}
zv0dFgLw0U%*e)0oLdJ^!g40^W!&DT1(s!74eLFYxkk1s_QB}osP`|*en9c_bOcczC
zzxGp8RCM+_mCNWWWN;I=2Q4^&dlIaA2yk<1Y-~Km8piEifj$dFKykAz*&U5z{}aRm
z1>I!w0Cbx;cG1k+H`ls`f-J2)e6K^6dB>NOWvpDs5KbLN6D5Y;Sj`<<Cr;-V3M)9;
z^ZXQl-Q2MjFA1M|X>aFXfvebJT%OZ!k2BBSUq+^Z-~#jX^#>_Wmj}!>v@$%#$J^b_
zh{!5$zYQcswS|YZbiUd{tF!&N{OQdpPILj;k1%3v05hCPZ>{L0tgw#~M3jENWO>V%
z^5E{f4!xPs(BQm8a;$isN@LDiQOA`f!tHL+pX8Dflmz0he-){)P*L?JSxtEbk30Mx
zWv#@go!E48jR|ajq{$9|Re&G^Au;j1%g8-o`*yv=p~KpOSw>;JpPG5v{o#+GBT}tP
z0j#JGEJ#2hbZgMi#-U#1^nK2(>#KF{OQ4Lvg{29cV87-nNf_96ukdQYM)0u5@V9ru
z#4vY5F771&X1vdk7w_6Y?;ahi0gD=@cVdFutwEKfU#_(BJ#%=K7l3zb79mHNLVyGL
za>^z>QF>vRSWRrUtQ){Mv|Fr!UZqpMlj8bNihv6y+xJ~EV&Wicch-Cm4FfvoKA!Zw
zzVfZFSvY#vcu`?dlB4@lQ%2uvu|<j_zxJpXfBA#@wKA2f#2Dq8I1$F1F64T0*6b4J
z?UF^%_rJTM+hu010p*^Y*imM4PfG+9QG@vfJ|*Q-%C~S|SSSmO?rYpLXOfnWeAu)>
zU!q33r$YVw*~P<ox|c{U?C&QP5#KNE2?tIa>sR-^IixF!kARgvQLQ9)yu>)+xp*-o
zHA{KE__4LvrAq=51b27bhrhY^6T`)~8L#){hfQVKQ!CU+E>6L9z9NrX<H(I_{54s-
zt*xZg(5fIXQdXwxE&148zqg<72@4J5N~e4GK;Ntw|Hkni<+tSgmbZeOfLytI8S0No
zhtttTfH!^@dtd3pPQG_ydYg~yuaXH7DJQha6m)N`vZPj~%vLN$MU+o1i276kj`THf
z660By^kju>Fc<qS@HQAIm}t1r`1UpQ*f7@z`~BsQOHTlx57=}wK&Cf<(gxJr3|u*(
zmPQPvBVc$Wq#ZQ63%`Du0Uf1j0P70O=x%_3K1X^G956sj24pv^07T9Vv}R@%446Ul
z3|Nkau2tP3RD~BzXk02`YvTmBAOKeZVFt|}sKJ@9cHQTQd$RLgXuE}2jUM;_5bw6Y
z#ty!eH3<MdwE{?rus0v|O54o0!C}J=O4M6rqgV7mJdL#I;MV~A3!-$1rFeOHRh>a%
zm<rOouqr^_LDpq_tf;2e9=2hs4MQLBg+ZkvtEcy-opB8W4KljABZ36>%m-q4C+Gn=
zfEcF-q65MdXG5L0#(mwe6C6qbYi#N_vXwdSWF_BTc%^XqlP9f|D)P-iuS{st4Yc#^
zUrA4@v*nalv_WuC%fzS-fOCob>l-f2X0X{R-~el7YoA-uPgzsnZ;kM_O!*2$=GT!O
ziB3*>_ZXSkTdQ3Deg2zl&F9=#cG8{dZT%S~<$en8iyjI7xi^;gk(Muyi`|+Ox-U7^
zZe>l!RK-^dKs#c(xDG~l$un`;UzL`|^x3{c9Nwm-p!VP;utA1XoyUWPzus3Li7_&@
z3v=b?^<`wsMNLfD{W<En@OenL1TV+cWB4)x=&*5eO5b^o4-KP?(pQ(18TAIfF)!Pi
zyc|r_N;|EL#vLqR`R7JDU+LCc#dKkk^f~SCkB{E+uE2(!VMWUv#~#*&`5sIbC*I`3
zQOY{U3Jp6paB#T!_3I135ztJ;FVyUG6Tx<g+E(R58nRF!L7%Uo{=VtU^MRPe#PHgU
z7qK?lUw<CVF6Ru_zH8+IykK{^m=JR@mi_zpMTn&Gii!-`YEgF{{d6we_WRvwjoMgc
z2fIW~AlT+Xni~dh@s~w7^@`{@2|6AM{RBQ$I=H~`Q3qR5M96`aa0U!N!t@kyfxDb~
zz`AA8D!5dOz2|=lzYa}ba;{BhQ>wH16E-=d3|l0#KZQZ15TEpxNs01PI^WR{(9o|{
z>aBVyXK5n(U|AcR4>H~`RfFuB$IQwqS|+*Gi19>Fn4<E0C-syf+n_C;6!sMp{f8rw
zUTU5au2@6`bZj|QZZE06yA8#pc{@{7)m?`-1_ns`uYT4i52+e~FbjLQjH~Ci%aJ0e
zwX^Wi(t`&Vz4!G%eUAn@6#R8C1LQnA9#(cb#S#AuTtIo{$5SUE?+Q_yKtk+-iV6EG
zx#`j&cvK}dIc@d_A}Z@GI2bH<W4#SGA%=nJE`p~_4=m!7vZ_%=CmdW~slk;P2NOZ^
zLC4QeC2N-MD4(`F9SbZFvpk{hwh;5cheDMRh;k5fZniJwvTi3i5|%&V9UG_d#z%(M
z6K~qHfVjF)>P5JfiPuUVRo}!Pn8zdkZMVpe5=%K5>COTtgr}Lz!^56jTo!gye?&j;
zs0zc%(`}IGnRl%$OLSh2UD|Flln-H>+;a7hP)Lb;ZPz}1=8guGo2!-o>~k{MnG-vr
zjaQ@cQ5Pw)uQ)PFT4j_V9*0`|@)g9nF4dohu@WBf>7`yX6Wfa~Cc;e9DScDz^-W!k
z4Q=Bfukc(R2u~QqAYIxpuV)T>NE<8mbgs)4=nw=TjuG>%X`j+8*>YOCU+|?9%)Lb2
zzS?RklG5TkZYr2Abf6`uFis!2%&BXpx3<1aHQ$_~jKZNG@9bF_w7%t%`E|WBTC(SR
ziXw^KC9?9@US>VajEuiq5_aAI5KMLRAp<Y(=)CX`faR>pMaUyqHH_*&N!ID5)xAUE
zs}S1wupjlaB>PHVIR_gXf`OxtF-2et0a|fAIXTf~*hr#4lA95|VA^M(U87IkG%2|y
zfjC`svup^D<j&$TIzqTFj3qpH+Xu*<_<_oHJzqda2Qn+TKA+1rlBk_-Yau`h(q<6-
zz^E+*Uwj&o7WB!5+Y%O+k&4|;)MsS1239MAK;>I}UkT~3VnYgR0P1pcoy5m;>wHg)
zWu832w7kp!wZ!k{Ohp$Y5v8Zw8xPxC^CHoutn8lga8?uO`D-jzhYDmML%^5<AtmJt
z*xu6|+@+e$66uc?3s_TSN4^W0XUj2t=N^6qn9KE%3cS3AKi7UJJ(84H2)d^kduere
z(R6P`pfW5AP9R{IfKkJi>NGMHX9#<%@xXI$u#*0wse;P8Wp}wrV%EzDw0?n3<&Fi*
z%W(oX2U`xJBb%`@>)zG9{%ODo`!D;*?gLXfQ>BkL8Ahz&yLYe5s6M=!m{pow_{v?F
zF?k99^(HyWshXt^>#c-(ef_3ApB557_cOs&L%WQIZ*;QiU@8w4fUq|x_^UM=k7Ua;
zWQ;+B2T*!>h)&wtOF%Xv+ztXdSZ5oT9x=iYd9k~F<nUOWfWVDB+2QLvJOl{a3Lfq-
z_w03#Fgcj)p33D{az9vs%$LgO6Di-}Mygni87RdQ1sG8(92x<++J9~%=N%rDs{hPb
z{-vS+*FlQ$P$;cDutY<f((_-|a`Xn)sUap46JQHkwVa*wZp^V}nFaY5{yNw}9WL(;
z&j+s-ZuZ<by|U)JqO?>{nSR=zWfH<m55?7GDMDn>pdF^I0AWm*=hsm8IX^uB{|e43
zAU~7G&X3kBs~#<M(BB#IHs7ei;PO8)C~AIh3O-P{5Iv-2WRk~3MMQ46WD;g}u#G@U
zN~=EdL8LnMN7;CRghQ*Y=_!l4kJqczFu*T#S@Qfy4fG`hRWSWbGu8kz3y<C0Odm$=
zRD<a*DNIQ|0Z&6Q2M=ifLa?W<E}>e3ShwJ{j`SM?ATzq$@sNxN?*U8>iTlB@6--vh
zGS4n*PR|Hi%{c!v5dtPv%}~~?J0}wvVF-Htb86w_7XAO6-2Zb*Md*LiLY?`?#rvO}
T)6r6(;GuX&RrZs#N#OqgTc;Q9

literal 0
HcmV?d00001

diff --git "a/assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/image-20231016200400451.png" "b/assets/mit6.006\346\200\273\345\222\214\347\254\224\350\256\260/image-20231016200400451.png"
new file mode 100644
index 0000000000000000000000000000000000000000..e42043c60bfef23d4d37faa4d70551aef4373fb1
GIT binary patch
literal 50928
zcmb@ucRbbq|37?+NJWy25)!fr*(0*|-m5}n?@jT}mh9{zdxau9386!FcH$7S=P`ee
zSG_;K>$=^(*Y~=<x7+XP=8yOLaL#$Xp6hX6k5`zQiY(!|tLIQC6rsGFlm-fg%Y#Cl
zvOS9juk;RYh@nulD0wLfEzh*y6MnXa+YRDt9{S0-CBNT%9W-mP=5X!i8-EvHS~~ki
zn^+^A*R|nHaQbQEy2q6`?^3y65T3>C=)OH8_3d;yXD8E{$McWRXy-U-5Z=iuKa+fp
zJ*>tiTZ6=K+=L){|D$V-p@(3Tc!i7m^JtpOx60#o6$=;B+E={}Gd2aMLe9j}%hS^R
z{Z~k=`_=t)=)eEMo6Ybp{r#s+ipTTstNB@6FD0b@{=4$5`NDtR%5=e!`0pR9OW)@T
z3RRfv2{`7-2srkdSW^{0A~iNPuAL_5H2ECC*(h*X{wDIiEbi%T@Ac}YBW3=>lcT1S
zkg~>o1^&aS<K-#W7Bab5dS%7MP^(Enj}<Ea{r=3Kzeg%lrfK~5ZmiTUaeRJo8@;wW
z>2tAZf3VDPaiAbsiSf?`ptFifYtJEHl_ed)+fr7)q2P<fB<X!{d~LZGc;@^I>RPjo
z|Mt57-X_brAj*GlQcIoU>%Rk(75?eJ4oRn;_wXDxH0!K7X&&<(DJjg;zk`y+edXM<
zwNK|cNkylE39k_oh2-6khF{;Gw!QTPz9oO0frNk}s%=C?M*p((rE<LsmX(x&v|rtw
zEv4DWT3+7^d7+TQ#mAR>p{%g*lj!bv(A?ZyRw6lkXeVpgtGv9td@QcS$JKxnpJIde
z=WuXvxKh#5XjLgKg1;B6aY_18vl+2$G_`a<K$B%!hxsS=>hZw3)y8W&MQ({2dKqad
zx4gZ*&A5{tSH^2bRJtR>WwO85d2n(V*Zwn6=g~6lXw??da^H5WijaTY5y$`JV2YfS
zA_D&Cy$v}Y9v<TrD(<UM0-kHMSFc@jIzGgDT{EN0s)-m>LPqiU1{Kl6kqQed8=HID
z+E-*`WN76{=;b9vsAXkk@rh`}BKP;b1*nLs6klx|AFSe_WMpL@2{Q0>&2PSLY@}w@
zE&UAFT6EqVb=Sp(2fl8tSC;1fV4=2G&oy<@@`vq2upS;M<glcqrj~neKNd*umgfu#
z%{RLJXMz3`Mt5|L-(HG4S&EB7iixzZUhZm?418ajcmOq7#2HahQN2n_<=!YBoeCq)
z>9VF{q2KPp-abB$xTGt)FwU<lD=)+FnUwL*zk``sUS5`CjPnXQ@83j&`ZhW$gyC)6
z`x)_TVL^iTYWhY+XlN(FpEbj~`mE(XrnPrz+w!oM<1+54_Gp@rX0wmKelfYPj0-v_
zSj~D9@Ta2BK9iKLKCfP2#6f=gDGGj-yy+{SiI0LAslaQNQkQ!4=vI~Oh(>JT4Vmmq
ze5r(R1)3&gm(&H3?G+k2cLxT+Zj2B0q}fc(M8M?|u7sB$)zzzkJ@ctUyoo_-Oj@q@
z;$0HjXC!EepR_)BI=0N=DJDT|R<4IawLib!B@i`^(=k+Hn3wS_-~()=+q}HIWeS%r
z^^UjyS><ROvCNAd<|HV`_Uj&`hj)yQDi$`eFXZTR8T>G`WDyB(I$Mm0qhzKxv1VKp
z-$q9CT^GVyBgk=3VtYS=B4>7&$3lwA8f)K(z8DxD#z7HX7t*S*Ai0F*+p&~{&9!OZ
z;ZeQeGg0eyrsomw)%)doT)e!vW<M2uybGQ?3Pes%-~TXSpOX|HcT1IJ>9L(18q1v~
zNALLS+l~68ow5AF!cJjTx|qAVx=DThK~t;kz1gzm*8RDW*4L=0J}2`$Qq$Icc7;{P
zY-y;ZHiIv#mx<3|viPus<5{c;i^NI_uj#?1MYrLBfmfxaMC|PBf<9QaRYkL`H(xs9
zZr$eNOLRKu>v#M8{WkJ#dNs}ri;IhIeX-7G1JzuU>V(~Yqfo^r4c-c(qi-~rC%Du}
zVF0zXtfM8r%rAcYcvn72QHnQJkNeMDmFThM#&@EgV7ijX@0=*}PrNx4^WI{55|$K@
z)b)%(G0|+MEz0v?x%yH>YrKgDtbuR+{Xtb#RcVBw-Xhe88%a&LDBIC@1gLLAL%|kZ
zi8n~kG55m(vUlWPY+Oe+I5?>Awt3p|RY?iq(a{lXInAM);dDc##u1`EJFjwb&iMKH
zdCtbjI?jH%1jmKKu-fd8AGA7UCh2Z8UzW;BN?JECT`oE`VXY7H;eT9uL_-o2$wc;l
zW$RVjU#Ir@eOpUcw`FGCDmPjt+fjfj#g93hE+r)ec0%}F+E=!wRc10wq>>LG-n@GC
z>bK$Hkg6)aG!ZY7t|U%b5$c|lA=|E49~-Y9Pw~T3bls;vok88z)=scb^NlPlD!TRl
zx6v`i^!UuZd-pbT{mAK3@agHYNCbU$inR<4i>^^ew7$9KP_NE^I8dP3hvuIWK?+DG
z6U7AuRD3||hId0}J!70aRI;m-lrgY{8G@Q$U8vS$)8L|r*C>c54U?j;n<!0HMK8E2
z@TDsA8;P2VQ0oqn!|QP!Zz5glCNy9bkzT+{aQ)IhX3IzLWOm#8PS?uvGCGBN+dVfz
zicW)`B!-PlvHOSu-h`s8wlO!ClF#d3&<f7eU}jEGU>>t9*P~BGGoA^OKsUw?Ukj7s
z?TTujp{&-9rSCB3UdZi{o%Fy9l2FLekVdn{^*^p2bDNnx65;0NF0h#APVZu*V;O>q
z^@g)?Pm<qv`qQ&MSS@ZXJQ#MiWTfJ54(;uEb|f+cl*8#^Wp6(eZz<q^2nQNIuEdkU
z$I?usffM$+bDBx-LS?eg;-02#I-CkPIqF=!mEkF=pE>xrb!T}j!3ma%V~vr5ZpFH%
zQGrVD)Kuo}Bj>?{-rnA<(UZ3ZCGe9{$h07(uGJ>KJ)l{;4u{{t?kYYC_w*@?fU|)p
z3F5bp2U$>;qe{f!_bHS21{fsp@bT|-p@+UOqFh~FXUBLa_`V$2Z!ZqUEm}(%FIu#Q
zU#VTs5uxd4H?Adp;!ktwk~Yg<M3LLOJ#3n}-n!dyD^ttAX`_?1b9Fv5fcoR-2w&c-
zgNK^JPCuoF+zN|~-c+BTcCWk7o&2q@FV^k&L6Pa~WulN6CC2+)6cv273yuPC3ZayE
z0}FEf*Htr3iE%9&ZJVETcdHmb$!%<G%x58AJZkbk+7F!9)Wp|?W$HT9-qr?h3b$|1
zChk{vdlqWNSAI$jfJsU<<EC4K)&OB>hLD>AC5J~qt;gzQ<mQNN6?4h(()QxjUrO{O
z3d9ydUzWpWAN$;+o|>A9e*O9eJxN%g=^_T(*4D<`VrXE1>{fH`Fzq6p*9{HE)<*qS
zyku8+DX6J+{JV0f!nfP5IiOHVjGEn(3g-klF~RzA9rUn%d&kF()UGOA&xcE4{{yUg
z>$P=t^RR}bty!n37C8^%2)M^x`;{rKUe&mILp$JTb!my!+pG25Gf4qBS9FT?o+_vE
zF+Yvh=o)a5Wn3CA(=Bw)FKSat?6pG5p^Xh|YzMsv^+h5ofhS2O-qs4DF{EQ^Y+O#Z
zm_j+jD%)gd+U57dCYs%;aDI?deU-boM+}pu!*c^*n-}ZRGd{x}x{)+N7a44WGo~|Z
zSbT)@Q1c2=h`OO+1f1NkSUyawSeFDlF7z>=zQx~7W+n>3X=rFr(2nozRfmGmf^kM$
z^-w#@UyJL|iY?W3s9Wa4?5<4IozLLZG`ub)l@R&|NTm#?spM@4>juRv3=m45{s<N8
zRytlpYu2^INg0^}PZ4U{@eh~AsvSaxm(pVj`69?U@ldd>198sgTqxz`=bt&mZl=&m
z(h{p(z0dwxYe$p!s&;q6^XJcFe{assS;FD{dB#aOC?EUPa*%~COXI=c^7{T@rA`&g
zUTv)w>L^frST$lRICl5T+;a649*UQb@ANl5d+ex9877TCM$XE6gGmZLc21q2L}+3l
zN9P<t-%F+3SXhiENwjCzyc<H>XB5`*o0^(_^a(8DY0ApToKp#63jbdI5dTS7o36_l
z>c@{CzffX4ucGNaQ;O}Akm61H3$!;=Mr?H&zvp?xr9_O+1UH*~`95KFWA-t*ot+(u
z(L@D9zI>PV#deMksWeh1*lKx0YYn?Q{9k8&RV=UfL#@rFI#{Nw5Uu3bC8visH%lmg
zBY0^gJF~YwqwqdXvbx=hmt{E%&gzOEyiji=pFjU(S&1nz;Z7fXK8vTsvz;X=r4{xE
zQf7JeEW5Kx{9|0_jyd99ajroMHtKs*KtQ(!rL)ha1<BXMu&l=ItLK(#Ymb83+GLF7
zgZ0<|{_>d}?QcsbnW!~=$m8VKy>iX%UcsVY+~kBcpG>xTLHFgexZK@Ia`fM(rY^$V
zvfha;>C)COtrFlqqlzn`=B>lbn12($q{8l=5ERV2w5YuPu#Ak1`lZ<2N}*p`EHg7R
z3aF4!D-N^2vnMJ+?0C561UEz<ClAwQ$@V%%j{b+E0P$H|*z&|-QX5se$mM7D<Pp#V
zm-s#U{ybTP^zQq~X-6hIL3kIe(d?=!GG%3Dq#{Cjbm~{;UzpQuT6<K~`I<<<cCwxl
z5EA^nfB!y(e7V7A_tX3)^TFK-A6XxtIt^pYx7YVN*NmQ$pw_Uy3LU}1tM!^Z4Mu&R
z&ADIK)fw*g1?+DvM2_9;VclJfk*6j8mLp3lohIZ~_-j!D4qbqCBf+*LVYpCc9e;i%
zaCLKQUfm@p<&D|hbal=2-ruq|^4lJaD<qPZ(n|av6igO9sA0d|>u~RKQ(TBeTgKV)
zrJ6(0LdABN$JU#a#Vh1EbF^Dl%A@EbTIp&g?9mk$@PeQcx^%B@dqYj7J*9RGEQ^`q
zf~9iVVUHP?oPD)nxD;J2Mkrkc{SGQC)ZgAWluu?|h3;%3AK>e}52e^Xc|$B5DTQ6;
z-11NYorTh4$CeY>$Rgkm-41w3!pxP*>MsU1zj8JjSV*iMTiRBDx!_J#itS&BhnFk-
ztH;uJDJ=WP##rG3FrHt!V)|LjIQw_zAHoepv~m}?TEr>jz^wqvU2qNyWwhzdlI|ln
z^?iM<(Q#UG0j95ZI$4tZ{PFF;P^-@Fbm5T9<E=aafEbp0AvFG>bt|=sy0!-myOS+t
z{@X?R3x(04Of>4G0LZvRL@ub4_I~^J1Q1|gkvs35JFlCXXaJG}sFI^6=_KFX;<)b;
zqj&|NVMW=Zvq4|A?Bty7Qh4hFV(Ckkm0q0<559Dr4j-e5V{o|kB=!x>O98&1prB6o
zvw=@)YlYyDQuR&-VgXwk4hjZq+$%4wiroPchDy=#RFs8<ZqzIm7CEl}lx8z{C&zOL
z1n_f`sejnB^W=|%IrZM67G9rUCPfG<;OEwX$L|w=V|uK3RTeR>LMCFBInr=73i{Ib
zbBly$$ErG*FxVS5c6QQ+hSva;$5%IhlWf>uEPAWQcEOyuH|-POU$Wo%5A9jUx(Na2
zSvmPcWN!i_ZKw7rrti8*$3p%u-%q$yJr)%$wtv>YDWJ2<`)AlKv&xZNt?g%_`BZ<2
zn3R?b@YLoY{5+!+x~ow?*QQ$(k}9O6T>kPUDF*s*IygA?4-QVD0J{P&N-32K+pxB`
zZ-Z%?cCKN()5H{R<>1hMd~`5!o%Ir0{_l4us0mQD?d=J`(%o?I^`(LV43m0L6(@V;
z^V0TdlnAwI@8;;T`|rtyYeXU0108g9Ea!it|3SF-KYJT;IkUS539+Kj+;64I(XV~P
zx%f8y0$ob~zigl7VJqGj#xX*!OX>{w?_B=xWDbPrhK9178~aL|6|4W&>{MyZTuNYw
zsZ;Bfy>5@jAU!s|%N^O=4DuQsiQCxu%o$jS$S<<59q%@sT-P=AbL$wA&Qbrpu1Zhx
zVQ18)-0}6!B}VG#nS-elvBsVEWeMC~yy%MSCuM%iHhWDc2ThbJ=-DF-XFxNu0)RSL
z1qZCRlJ6~<o}3G6=2B!XQaVq@_Hvp28{5zIOq#}niPfJi7sWsGH({00YpZ^%K6`5|
z7u~Q}_<p|$Zn)j7*cf_(lcT8<<Fz$VV9sUwZV(tAXU;2Nzr`vsBKi#B)WPH~Z;SZR
zmgeEnYCt<61H%e8b!$?e!;`H%@#)}e_8*6vj@{5}Cx<;JpD+5a;TU;g5^|KNl`C!A
zPh`dSFTrLLM>{@dT&?U8YcW0EAO}8S6MTa031~y!^Y(T(T>|$P<%E#-0RO$cnP`OH
z8-Jstj(&*Hx5Mc;Rk2?7AV35u+EaUN{D|N)qJoFMbg;AB(oPc)`6$y*ho>GmJ0kq_
ztBQ*%GG}Ytz8baHLUa6NskBao=MbuOYuM#m+=-`err6_Or2hQzBg(`dYk^*yI$H7Y
zoKN@oHZcM3gVn97YwUI<I5_yNRWBWSjkT<v<WYB8Z^Fl~q=%NN|5IfM*4h71ESq}<
z>!iTR1%#he@-hAABw<qOEsr9Y!U4$>OFLD?N#dg5KP^1ciIwx51*RUBQ*53pq&WXb
z_>`1X{|(qwFe5F~EeIUGGs8x99`u;rzP{6c6$0P=g}lo6z6J7#R)oKz?s8H5(=z=M
zLyGnT)hSy1SOEBD{C&na0swvzii+m}&EFOiBWjuwk0=;`!x}`6r=T9yxXfD$3tF&J
z5zW-hXLJc0D=QNwau|oh38q(~b2g9*ryy1M&|iFXbQFbJ_oR}^c1qNg((>M@?1W+G
z5)vw;d{jB|*1DhZT~(FJ!O>07ha4S=9qQNdK>E29CS~^CAkQsbD(7P?r4(--JqZDF
z(t;H9^e#%+V?~Od<SD)U3wnYWIoznIs9!59GJbxdeD>q{=iR^Fxq0(u=j!_Uy1r7!
zA@R9q$c@%-4;h}t3xX3Bet!M>^%3TKacOCK-4kRrzA^bh&y%CwQ+IdoDjT5D=wC}q
zExF3606@wPi$HPP-(E@xKso;ScnZOn+S=N{dSMPK)Al=Wi-;5-K5w6?d`Xhk2ihGV
z+wJXb0pC5iM<Gz{czamj?}3E3R9JK&!XG<(uN7%aOA7@B#gC&*79vGUIA$-wRoV=5
z0MgK7BRhoSVAu~``G<eOq5J*qeH>VSmdx)*!m{-G%DCV=0OL^5(1dhhSVo-XRY|20
z$bv!$Jvxa!q~#R+{DDSK6q7hG#ySN}Z5V^OrLv~yusx`D$6ZwAhXr+Oj5u;;QK)es
zhLla_0KI-s)RBV}hD`B<y(}%UnS7LpuNV!=Y@sjbP*TYyoGH9>Go<xF^ZHD?+b#}P
zUz#Ji+-XJzkd<e{WNe-+0&p#`N>cIX|J)UEL@S~Rm~#`vb^J5a9zD;N$aePha~g3X
zsM0|NY?1v7Y*_9Idwy6brmu4KxhS+0_RW1xZ5|xG9a|Qpx%#mD`#UX(4mbN`wB<jN
zH=s5q`8I4O1Hm;l&8%4U@%DauzXfkdzULk>E~p>CGDcL+smpgfy%5y=;`WQzbB+S>
zsNkOYdrYJ$Rj$BxmB%W=a?gV{r?oDn{u%Il>EY2=o*vSzK8~}eg@lDqy|N7t2$8&@
zEPP%|f1q{RrJ-01I~%9p9+nlFF6@!WYmDkC8DYdPN10h!$zheHHbZ*mHBXO#9(P8x
z=z|dl#RWXn$5P|E&a4=<EN4VD*RBW3FtEv+tR(HHUu95Yp(%8a!&ovw@yINt$oyHa
z)jt#VJ>Of9vG7ti%`n8=AU?~)$pF=_e?K81v=esznx{zTlwq|!yA^15hysTKm`0!B
z`7_K~o<^PF0h~fw>p<x94ksJ^e0n!M+}*QaBhGw~qI>$V{rU84N1R-ahF+7uD1a7c
zJSE`sSC^axr~r_Fs(DK_0~a+8Do-so`(Is*eV82o6{{sX=Lx)(;@Y))u)C4BR(W#t
z+&nAU_U;x50hN&JSy0MAXzrYHXgcBp&f+-bx7%#X_h`b>>}OX~T5bZXZdOhX!z1He
zHKsRjZjnVyKO;9mJqaArE*&_SnpsEImA+53*G9*!^<{?uL!h+Mh|IV3dCZ}yB+|yp
z>f5qn%{G?jQTMCD!gH)T#R%hb8!QSJtbR~Vf#8)&6Zd^=wKGNm1k1PH3a4--?gHN4
zkgRl=62lw<exSVeOIbX3aR%QidRnV&1_%g@2=n|TY-yehA8xD>Y$M&i8@t_b4kVV}
z!rS(vGgT$rII0E)|EP9wSQ2g>zBB~bp-xeD1qtXvQ;cy1`PAO_KvIF)qCUb|>(=ay
z6};D|^J$vP#BW=BU|`_mvinl$vn`vsmAX|90rsy;1;uhwQVh;Jzx4~Ms&x28$RgzV
zCq1+6_X;%g-lRG-dMPYLw$G5DFsAe*$$c9Gz?{svDBhHoaxjyG$;HS?Rg5i@pg=v6
zhvO|}0id*b<w*QH&ju4~ke>h_r|_PB0r=R`q-?k-RrffLkDHs0@&aCmeYGOUJ0OTH
zE-xnlh&Sg>ext>bliXNctqTWw3MSVfyY)fu?<O-YCir`0Z$i8vd!Iq;3OzOinb+3V
z(!(cyb*LQSwT|t-8NKV>00LNVagTj9xyLK548I+HYvAg&(_rnq8<?CFTfmU9Bq%KG
zq>n8RT~AV?iwOnZkbnh-;Y^g@v!unspwC9u@t~Zk1@jR2m+SD|Mi*A<XhpDvQZ{+7
zVaMUj>%4P=Q}{?vH3=!#3iKqk)5AtCQLgJhTdhr-M$K15kwL)DE(s(kSeI(2qH`lP
zBid&W@&b3r-AFoI?rYq+o9ii3`X;ZaNRh`5&X$#Diw`+7&o8<l-#x~jC*1F;&yvtL
zp;)<W=#}hVXN(LGa<%Stm6O?d{au_*Y<6Q+%KY`f(Dqw7{ck^9c(sw!Xc>;4=N4W1
zG92z*1M>nKqfe=*(I2xk0Fwhu4OozdgF_k6Dc3G}T@^1;G+_i8dn{N4=O@+xrYj_I
znhp{6Z22M%Qo>hTTpsvR#(s{$mZC%2bmn_WG;95)7eK3=lWv8{11hB-d`QC5lY0C!
z&p!q&b(EEs!GS$Bx!}su@^k&eN;9MA%NVFMGwCXMjB0fFs<R;pt{Zz>Tlu>|X}K`f
zKKDI@(mTasY2FNssTGe9S<1z_XBL>!_2cM`m<#K0W5<<frpCsK>Obdnx!HF}5Nvlj
zGQy3VrrqAzS*+rRdB{_^XgQn0nV@iG>y-m{vMVQ(X3cZV=1speA<@N;3M>h+aJ?k)
zTtL&%mi=khHn4Q~TQK8u{>+(W3-beCzJ!AE%KJ3kmQ%;sj6J=+B)Rn20t^5qo9L%S
zUDJH*v4m9j%%H^C>M?e~bQOlXH&j{WPkiw@whmu6X7CuhU=oM>$3G$?mN0VG@=d@~
zrZa*#-Mic|%lGw<XwwVcNL7VA^KHK1_JeV(euR3`Mf7eCzFA+#(^#d2iV@pd&Z0%9
zWRrge7UZX7H3?-B?s46VJ;t6<^t10YeZ6V-urXx9c4ly1cK^8B!yc0=bIkH`d0MlP
zn!AB1Y1HVfWxnavK1I=d)1N#EUtg3BZ~1h=abnx9dbAO5*Qm5BwCz53Et8oxX376n
zPwKLN-ed?5SfZV>eoZeQbKMhd+BcAI+8M+~`Cj}|W$#A)!XKSrXrk(Jk2#Ri78M`L
zGV1E;;0Xu=^|97%sX}EFF#J^%0+ilG-!N?OzJvO)zf?9nsHt6ze!YUtA_i3eSSMd9
zyN#%3&5eNvNvwwD51!fA3!xWv1^^TSheAXO0ECOjg98Ih{W5ehkxNh@>MUu{3Hz1s
z{?*0<4j@c@KW=jMMj)z2-oRS+*m7`(xul|^;*fQ?X!VBIuh$_crGc^TSrBJIR%_K%
z71i$B?$#bQ4e%Rsx+s45cB2k<82>Sx?N27`hbIgfeXiqt1oC_ys=m)^1HVlz_xt%9
zU9M$uA>`c0Uz2(ClhVV$qX8ETOs!a_`kwiq;U#GY2M6^ohC<ifseq<A2W%s4I9+XB
z-6?Yi&v$SZ&p6I)YjuA|F<sJrx8>h^8BlT5<D7`r2MTv-bu*V1og5mmmd#N#g*<CU
zocPH=rW+f@Cf2NY!*9wyCw*W1Aiw$!bu{b2F34=CCzo%jnAzI0&D8Uy+Ku*U6O7yQ
zgZBpFVy>Z9&7&CGsGzx@+um-3u8brEA}5ENnu@kW4h`F6D0916v@PG}^t-cApgUK$
z4kDp|_b*7%65j;}t8~4wCFJ7FkLDohGM+KF3rcAr3-eh_;etN1$;!?TJ4Z|!aV5Up
zu~+0ByMTui+c8^QEKEhjy2P<V8RjKwc}FqqKUshT9?-<|vvLBK6$9irbzU=w4sg1S
zaPKbAR~z|n{Zb!?fwh7=@bbvOei5a%ooY<yBoc(XR%80dXQc*ztjbQ4n#s`6u-q5B
z!F=Wvkm~2uqTz@I)}O1K@<hHsDqEca{rh^>7WeiW*WC$^o5W{nla)TL?y?T+0+$}t
zH5DxpZU52`gSy;6m|qvmM!w<Iy&1#Ou{c<iaM!XtN1;EjhwMw2%&}({2eTd%GCg|0
zs96m5lYUN5PcyTt9)08*v`{9`><PJJGlW9z@9%@?wx?!#3S8RTTwJfbUdGquv+4*?
z$=KPk2Zw}QI*a=Q&R%y;BZY;*%lV#*kF7^)AH6du=}c0o8NJ4(evZv>FuVYy6syON
zKTS6HtOI*(S=~+Yvrg5}&7(_ELBwr;a>Ms5WD(ZK96O`&I3$(Y-2YhBBKql-9yl?Z
zZfPDGC|@UK+LF*WHgy#OV3(WA2+DE&R-Yo6Av_h6zOx~3u-)^U7`yW=wtNqJGDJJ4
z@>DZ9yhW*_@xey^3{VTg3XgbS+yTSp;ZjP`r0=FOrh0rwg%Q*baPr(8XEzr?+W^?l
z>Xiax4;<{260TgHMy(xVg3ZTdrps=IS6~H6Cv?9k@<x66ZmA*$G(lQ9lVH=EMHVy-
z_0~ENofD?O1_P!MXOg&Y(+*Ce#OCZ{rg!lGm|=f|O<GZ9%oV3oYD8f6^EKNPxleRE
z4|~-6#JJ#KJj8uTSDA2c{@EH4VIa$U^;yq6&J)V>mIY;D^BF!I^Y41C;&b?&Lt7t!
zLxf^fu$UDJ)+xFI+z<7wxA!Tmq-*vcUe7+o1M2vfoQQxl!eG4PTCT^2da|;zlD2zA
zoz#tx_cEF+yZ0>EYKO*OYp`HsFg5jG!?OKTtN!Cb83D2~5NRR&(R+hC7taD#mPXT@
zdlt``8A!{-APUr`!gAdC<7YE2CB>s{rHeQlx-kz-pX5c<c9)KiNi#0`2`3Q*K0#cm
ztIA)s3vcxcatR3J>ra`J9=u{c8>oQ+2~ON*Ar9a!2(LO{b&rx0!5jt)73bv#hx+6F
zC9nCIpoiJn*$DFkTR}0SRF6%^$u0}gZ9huIV2#}NmfeLDIZeehJLo!>5Cf|4DjCTk
z9%JA|=ayNOJQocbp1y1BoOm!jk6?Ow(?C3qFLQ(G0WRoeIx409Py0-Bqu&AVsW8MX
z@cIt${1$gNEB}k?fD?b?Ha~FjikFnib_;X;zpJU<!q<Xm1uja!Z86?*OiDdXW4*`M
z)S%)D#@^mur;%!RYwIJ%d10rfXTAma#GG{YeP@DT#075Gzy9I_9Nn%nm`y$7JOff`
zOeR|cZfq@ubFJ^Zj+k=-zFF3^28h{;T_x3%g~`v4nMuzfVF`-s*PlW909i(Elh=tt
zoW(%lpSzHzvLmEJBfDKgKzee<BNtc<hWa{eMMnYNu}qNq1_u7wUK-~4AY;*L#rxpo
z_z1;Vy5P(38z6X<-58!3ox=;oxhq9AHTpG4xTl{+N-WrlKDb?$=iCO>8ch&L`vdV8
zWJW<U1h=|*esh6(<8l}-tl^<z{U9xtXFv^?_Qj`~0>m%i-D^`4ha)kH!*a1(?Km)2
zzSLb{z?67wY%GE0ObF5S(<sF2LNPYV*nfX}3Iuo9lQu)e>fujMU%t3c9WCo+tu5|q
ze$IQ=2LFa`imCSk16olUGAD>Z4R><pJlQKyh9Dx7a#SQn?NUNidiZhp`}ddS|3Dx_
z$2$a60!mXW%*;5r4^30iK;Gg-H1HW9FK{8V2OrL|(NP1m*kqkYSuSC;?>yO)w5KFR
zgN4?qZ8Pf#O92Bwufm)F#06Ne>STkNmI~e<A3Hj#5eP_UtHY@aXU)LSP}ckRS0GTK
zl6QH&CzG>qU95&TxPRd*w$-I#xO{&cC?E2J^+irPU<U<h{rE&wYTf+FRAy+hk7%+d
z?B>Tt5@Zs@@#K<bKmAROjiW&Sdj%#1(A@ljg6W7W2@D}EPvz)O$92TtrnnV1RuQv$
zeW8bid;5L5e@VWZhX*Ux4Gt(Me2|CuH2ro(-*R&fo#F~pSHW=UQo<LA)a1b3PORy%
zF-~~SMAc5`sieo+H)7{v^KJqu0myv%#dhX|eG*-aTsI~%GLoqaj)vIbr3A1R0RO(3
zoHUu(0wf6lEM;3DUByDwq)ZnahfV=-5Wo~*hLYR`a6bjxU{c1-k)R+CT7UH+P=p)}
zW^@IR9Mb4^hO%Kq>7NjR50a1bt`|}UK9fWZZoPb5eP&;^p-Hs&*zB^RYBWGkc9)9(
z!bnVF-DV$Dj)3pa;niRQ=wA+u2e>4Fs+v_}=G+z{0p{?LE^O>%5xm^oS&;yjYmaV4
z>(b!o^%v;dSGllKTv$wGrkUTG86F(Wkxvz|YqTkdFRfb<Vvdpf6>RE)zS9SBmps3t
zjUxs>ar1o;x8j%B6BLvm`@tulezBRByy!-C0ncp)vkljPu6e1D^Tv!TzpforX-s3R
zb^X3jk84@{e6$oDu&!>;G9~dIpam=b5B`wAQu*bj0#Asp<p3jD2=?&sP;A<3<+KzL
z)jCF)!svTFHU<A1nI|<F+Q11AFJ+g`jXIM<)1Tdx2Uv>!quc{!LCiKUKVlo~|BT>t
zZ6W6{Vlr;@)#n${{Pmz&T!#3P@(2ifYyFwWq>p+s1}~gIeRUc(_E=~%Z-i9P-e8&k
zGtE2|Wy2I$F+bM@+S=RIb#?J2h{KP)*}}78cYq67b5>DBv;uhhYU$Ee#x>FgTEXX;
zbxQe%j2ru>%#{yZ!JnlOJKlRJa_}26eCg@wA3WFTGW_=!tc?Q%sD`x8yx8r4Kni@8
z8c@P-x?b3{%eXgYwnm=2HDWi?4WGp-+M65pxI*3x5o#SL+=i`#O?{T%3;6BxBAPp;
za*ylzXOhTa54V%+CR)>d9qXB7({T-3k7vml_225ftP5G4AX*Vew}Y$~nWLBlGK#lB
z4@L?5-j@*5b*=M8SzgU_VNvNPnC$ZZtp}U>V;RUejPfZP&6-cY3E_CBNqh-?8-jJ6
z7jfeVo+wE-CbihkM9It)4_(Y$-cAbI;v<~()A)^zTTSb#D%(Ws7Jj@}(>TyA4FSb-
zRUlm~FLk)B#2>6@EIhfYUI6OXOZ1$zwVFtrl9$|T38bQ`{PiYS?tyFzKms(o<mESz
zx=gtKH%!s_WNI}8tP*SMr?h9k*SOpQh#TQ_`O+l|ghN5Hiw&}SfKPBxIqlbinxDWK
z++zvJwa`woI!gv5_h5kpiH1WyO3~hID7pu)?B7cKlYUIGfDqbh(}@@eFt`%LAn|qH
zg^yGx`qzp%1z4bZOmwURqLPJYi~j_?5I^ewEh75IIsxzG{}#3Uo=O1h7($wBU^AHV
zABMA*e%x)`ZHR1X+AeVbovBA^BVS2A7J_8PwXOs}s@rIe*YMG6Jz@tJ0wAB*J3OrW
zA7|olUVJ9e(7yT8vr*ZXP;%Ush8BV~y}H~FL2{Py-J1^KNlWQCINa=6$0V8l1eYSl
z@&i-&-qgvFsZ@5azJk7m!CSLt+gq>c5D6VzhsLK6Eqz=Sr=cNoyx9Wrob|ZOLtI^>
z*X)SlqicrbTsD6Ii>tM#{JI{NZ%!}&=~kw1*0p1R*3(VLOHJHFCtaq;fhT*>CojWh
z)stB;_qre?7p^LXl^Slqfcy}Nq-8IP?V0`S3pHU94cAsrj#od-rP%Pc41+GUvSQDs
zU-2fsBilN0dGC+cv{+PTDR3vw1JvLPgoMpY+mC~3#C$2hwP*&+{D|2ip&(vjrRH~x
zEOj%0`Sr4s{j$pR_*ldu^52Nd`~er(`qv@?zCa5{pO}jI{$2-C%?qJ^{s4fNwru{5
z$_agE_y=6(=jedLhu|mq@7C?Xm%FwUY_J)9AQs<izKCqjh2T^rM&lPjR*XilNr`b!
zi62g1bZddYjcZGof&?+H@2byKf5KV1LKr@$GyY)HJOIbG)(P~nhY}3zBbNUM+2j9f
zVf8DKN{43UU(1lAx4Z%2+&}*kI0NQO&YTNr@m#5y-%!!j)C@wlJ){5u2?x@~vk+Lc
z&TmeCe2N3$NjrFC*&RvV!OlR^8k62j?2y{kSAuGZ{8Ps;>vLt-)KG$juy*h#c^5pk
z>|U%_E{XN=^)=dzb*LV50;8b?Tv-<8N(EABTL3YDAwll;T*yfR)8kT<j1%Mx!4+ZY
zZ<}%YyP4r8!nG>Qg1=&%tph1XPG12F!Dn|xT2=KT656dE1Ll;Q^Cp-noJZ&M=hfYZ
zR#s<09C)oJM`{1w;Qo7qa<?TNNIuXdD_Iu%)1`LsCK)i~rT-n9&Z*+}$?!L@U7*|%
zpx`KJhLnbL;}6x~sa07vGS&rdmxbTIaZ$ylO=2^il_QZ)pMp%Ww&pm5`Eroc2Z@Qj
zqhoO3{*D6re&r-8A5NbMdwf*RW0?Z@y~xh@hYW@$Vp&XZ2`o*Ow^PxAL04X@odvsr
zL3PR%j1zEmU{U?ejrUUVFEw940WIO8xPW?ceC)5h9oa!5eW`lNzmCM{CBb6hm5GT7
zL7b~VTxlR;ii2R3Tx;FzSO6KY=+W-ne{as}IjdJHW!#Okr$@)e!0kbyz$6T6nf|5>
z4w&P=fld@-p)=^mzeZ=l!T+$?Eu0`D1NG$21tOx;s4Dx3LTgt|Qt5wM?jtG2hYueD
zypk|BzHVS>cx!MasM+i;<chhIKf|Cw&SX8Z3+@idSMs*}Cuh36iH)Cvd<2gj1oLRm
zLSRn@V%_IC>rrNOa?WrS=y!{D&t<YZ8^7?18Pmml1jo~HV^$vWNHFHq|H|yVSxlcG
zbCV-KJA;EFBqT(=(x30kQM}Wx+mN2zR@C1&IC!RP_`F$`R?pw~D<eR8^g9@HiVKhX
z(rtvp{)|b!bG&rN1r$^Ub^nWmgf}3v)K+K20n6h7=<$g41+o0l^>rr*y)2DdLG0ke
zLT>6tDGyo1eTZ-)nKEksz583++tXEJ_AL*iMT3FfD-|9+-`R0TyBF(M;`Lhb&b(WE
zg5p~L)a1RrSlmSv(gNHX!No9WNNojO1`<IapTm#H@!kyl7V)#%XP!bvS%iAHxbpSu
zQ?k#gIs{D6U=#p(K`~x+_JhnQ;=-|+HX0F#oVtAAgg6NOcCdIMkpb~OgvUc}Fl8Nv
zj2Kr!KHA%tE(R)L`{;Wcbz|caTrr49f+q>iUNodqmFt*bk5~s-K=2qz^+E^^BB*y3
z82?!OS?3s(aZsI2a`fC7Ea+socM%x7pji;l?FW|_2}w}Fez5rH!EAD>2dNw-r;=Cs
z<6RNxm*^_g3&6k}QORG%Qv9v{22cMew4mC*k)x-BlSDaX(=Gs1ukLk~JWT+_wY(l~
zZp@oVXjH)K!|)RNgB{3wGfwd!mrv})#9Ts*0LZrLH~y975&TGXPcVJstrm;6V{L(J
zcZMkI;Ly-waQlPX3vfse5Q+o4blpVr_ek|wMh!2q{~FEf^V}JElmn6erC{*z`!#%g
z4%puO%KW+RIdpLI3UpJH#*u{mW50K2*yyHly{8kI2Ja1u3uN10@40mSS4I3h^L`%I
zb2XWB>~J&l#7GEcr#SZpN!Z#*3ZupUbL_@KlN$$ej&U1?6a68zqk$>4`!e(-%#V$M
zI@tJJ-EdY-6Hp)Ew(xH<EjV{$X<?x^o{cGy_AC-cU1Yqal6Du4y<#0!kX4|M;M|Hl
zz3!D15G(G|J~=wrT`IK5SNs+k9Zg<yrH0+4UXTB)Egzh>4`APSzFk~=4140=;Qt?6
z`cf9tgW*zRKuCG^2Lpp@;Myvr*cVbEv~svq+Rkn{vXp1)2pIJ1f&u~vfWac}cr!}4
z0p~kVGk_<q3}f8#^d#_ln56-Pgra2N$F1QmB(g1xybJCCWz5aZ&FVKoa<mFv9S8o)
zqwn>jA$1JPo%z?E(j73*kzCoJc5@ey$X~gHAuXNmS6o#1?%YupDl0NaP@xHw&JmTi
zcd3im)P+eNeW(D6iEPYXs-BoqqgBz5pErk;<|~uG&hmw{Oc#$ChG8GFk-<UtF_uB`
zt^2Y88zh6^YxI3WsHmvYVjeAZ%-U`C`gZknvAlFT+8%yH<-gjn`^lVpdeUbVE#y$n
zIrJZeSy^}D9%FUQZA$y<Yhb&)g-tNM(WS-AJ-IwqZDTT8X(wCmzC3ycg#?kKc&<kM
zT3&tz0nGQ;!n_+m;yIOM#uW<5R~URuj^a_zgL2eMfl{8B8g=ZtcZ0%i2Tv=c4DABi
zA+ugqb`gS9f<-BqpUyRq9oJpkx+uCu4B_+=0=+hf=6x^6N#%EFgR}EhjS6^EZ@o4x
zkr$^O^(u=?46751*XI;|y4Qgr;&^=M1*eomEPXvFGL&P7rx;gs7rZ{X0tA6CNuhP*
z0PqYFg2$9!wWX(vi;Mbv{BOAZ^zx)o=L(3jrfGA`2f|Th=+NM%(DlW2HJPnwFdQ(N
z!Eot!Bi+(nYBRdGV*OZKMxOWRET*3bXc{`OW0;GELM4nOZxH~8$n4PTVrptSw2P1m
zmchO}&2q0XUtXHc%?c}&))102C@m_|^anL~g3y4pHBj+}Ih`r-0u+$vRD#?Km_pzH
za4$$34M@8R@-JS$ew`K-)XiA)8RXE8lqzTlihTNf#2vI@6cVuFN!-w@_biVs56k+}
zcGp@)iE;C#JuDh1xV0oV0o()}&d`+Gj&KhQ4qBJSz{q9Q)m`fm*^FG-=f4`|2uY7$
zzrO5qiISgzLprEAaCOExL(QJrcTM8EEuZnj(Kw8w03s7YqWpmZ)-^|-Ge+KfWJOdH
zWRIsqLpmadYb~3MrkSj}84J9cV{B71P)Spqd~-0-a2cS*=~v&1Q(Cp=6`p(OZ=%zD
z;XM$($d>Hhe2vJ>#)B1B`Jm^{J><}`)Cyig1f-~A-EWVMk4J9K_q2eJE9#Gc+XdG|
z<2O1h1Pq#7uf{u?-*$I*#~Od;t?m$|KXuuZ420%87elg`SXx=omX+KbF>*|V^E$e^
zOVqChXZq*auhit-P$#`{R#IJ*s{s;M5PPF6y9_2fU}q%r2}Q`VQh#C58$@7zoMZ%T
zK!Z+J@2|9`<AErlix)52Y!oTA3xV9MFoPKt->4|jDazd~fQ6YRF$>y}R?pXgE?vGb
zsnZBaTV7`O+?VWLHa*!NMzrCvkW3Brshdx}?&2iZuR`fTZ18I!bJX}lV7#LH)^06h
z(%pnr?M&#MYxCk(&Rmwh2ZmKUcZ}Q*NR*}=gx9A-mSpdDWsfUi>inqvd!t=yHv>q?
zHl8jTPFV1D5uidEw1BDc&MR8Q&otZ;rC}dbEJ@3N-N;ZD=aU0O87gm&XIW~PosO{M
z4;13bY#x^VbExhYg>!jucW_=e*R`lecKc4M-N**-#yZZcr5m>=%r~oi2j-J{tp<v3
zjd>L}P8C)24`W|85{_gH_pKIeIQMOi8y$Ex&dpnBqNR*&N1*S){v2#LIE9eLG6X{a
zY>d?^0+kE8uLz%napn_+JTy>H{9|L_g7k6$PJiaH2f`p!K!}Z4nYC%E>|I$O)Ov`O
zvl&(?T{eU4Jp~ojfOZMwdf-1kBd);b%c{Q;*`s@S9hf0CGVZ-pLM*Mma4aCYTmx_e
zNdRAW0LU;n_zW-zbn8KW7*hF|VgpOQROld>^G!VkOQxL+1!a3<_s0*jw#gzWHSz0^
z?9pF6*r-?naSyaaq&WcsHqw9vcYcq=l~2BB3fHT1XGiP+i&6M(<B!Ei&@2N%bOm?q
z{OGZ#$a8cme|AH|b%=cGFR69SThyHSt+>3|Bd+`0uIk{at+_caAp6#IkI90qmqXva
zq0~te7GoA5`iqFA(Efygw9bY?P#QfZz4Gk$;dlc0W#;Kg;pXO+UsTir9ZTir9kG#J
zx|vDSjuaq?>aQTL!Cq%Tz7{$T5O=3Ua2_8Y|2&6v%+e$eh+b)iiyU+CO2YJrcSs$?
zrJR0zd>YuNR?xXTiKC?D;Jen0e+T;u$_elCq;g_f0Bob1)X|W<LArsa9e@1l&DN`R
zWkwpS>e`id`HDJnC}t0g`4V1;7nV7hW$icaA9lKyCAA|P?E~~txo{jnRP7%02|;gC
z(Re13AA@ZkX~(T}$DvEM@saq}w|h`z`(S~IYEH@`;{uVL=aAt5Rnj8UZn9o~^Ajl4
zykp;BNx;~GylkBt*VB4k*xhV(vLWS&U0ihqibIe1N&Vd9OZ&;W`5cENSLcT0d>_;T
z`1X-;KKWk;&f`^Vy;7HRV02!+x-e6@%@iBmVcsdM4B>#Suf1bqhFi6jc9jN=%RPK1
z4aZy55*r;!rM?ZxvsX<Ek0kqxNW6Jsdi)@&F5C`betJ|NxZRc?(3V}_HL3x|jV-BH
zdEFBBLoxwiom*>789Hxg&^ZL$u!c-WY_r)5XeN>nt@v(R6}S@AZ_Vh#!|W=a+Y{$t
z`jbY~te{7=2ETMmqy=<K;1JapYVh+UyL)`wl_pgLr<7C;OR<b&ta==n(Ny^xyEtXT
zsp|sXe`HScG_n5m4qgDONr1QPM`C%`sS-F(cmZlYO!d!<@gYx*l>8H=fQ$GxI|DEj
zLLas7@;iFYR*tv~DD7Bk5baWfBM;3k#aJumjnj~{sL2Ii-!dIrTBG6MQv0C0ZlRM#
zaUwO$H=WFd{fe{ci=@<LKlUS$l*f}gXR&)02CAh#xgw_fM|_ag*hz(IwWmTiHQzVY
z1N)-wh-r5+d5M}yJ|Q`?CwWo{Oa(Y$pM+^pE|vv2Uqm$Wiy~`xJBAi^50D0>_aA1=
zjRKCgy|Q%zX|1jbu~+l)4A>>ivZ`p=UlOW$+9TQ6{q~Ca;_u%B#sPp}KwyVd;~rZM
zOA~ajm;nl`jkOM>B^^lla44Pq;>!`zO$*=z7G7ZZi!xwanGk51TwrPfu|~ti|6Jgc
z!6IFoMmgx@Gy<6kV%fD=V~(WUkhivA;Ap9}*g+N#iRcZLnMU8GRa2X^s2l-Su%W^~
zHSW}Yy_W7baJ3Jv3$ga2;L3sHvZ&wz(Yrq>zY9x?i=PU$i@3?6Jp`x#SqU2EG|fC0
zc5ScHB8<R!HsSNt5@~mZj!FV>A0X5B*Dje?ia5kLHf}%WzJ9J|7mhFhnX)u~yf$J6
zERd1yKQz|V)ZBP9FIgpcS)CLbrPiRZ2(Jpg6j!OA$<aL%H`Oe5a_C~A$GlNh@P^>!
zherl%iN&juz%GV^U)E}#_PWO1;P4V{`L4S9A?&1Dx6}K(aQbFewwxRBMfW^{#EBez
zd=@15PeHeAtz~`f`N59KdhUtH*%cGT5k4t!TmVXkcPdrBCp@jhuBpSxujwT2cAfc7
z(I8}#QD#3aI1OWNx*e6dj`YFR;vi0#R@=H}$tWGU@%8K1(UhT1HAWwntHyHQaTMC(
z1>IPB?=faqJ$<x0l{rm%#U289{n8Z%faE5z81F*tN*+LY07uYa19{MHgL>gO=Mpjg
z;R_cpJ_P=#kE2{Y?yNXz;k(r<`=?>l7`ke~e1x+@P0QqPy`6?!gndE3L}zPf=O-e8
z0cT7o6=(rt<U^*Q3mzz*jeTgB{igHe9J9Z%cEB0?_n+o`^NFVV23`$_&#uiE$L{Vt
zy2b)6o_OH8Y-3nNQMYv=pn8gF<>(*mL;svFW9Qy`uKz4<cL1wJut*8>SXbKK^oxD<
zqk0+|L1+3IpB`|R*E<a;F7*B<3&2`t73}8j{u5fB(RJ*bcf>OXkp@d--9SDB2J;E%
zF%wbhM-SMBFUMmFLrP7a?@Pry&~1>v0JVN03+?<WTMtRk{rY9q9r_MZoL%*h)G*Fp
zjJ>pYSF)U6eA^jgA~s<Cz1qRF4LZpoLnn-4GBxLsJ{z!^I`xY#*|{SWQg~KF46CL!
zUA5-i1wOZ-zf5!S9QhN*z|?}*SJg?U9R(mmr<2%F{_SfF&YR@WEWI7VAC~7S$VgBL
ztG9tU2<DB!K7saT0_YO}u9giEjn$3z_I9W3LEWBI>NA}ZrJM}Ue5Lgv@1l|^mhMpt
zdlm%9Ea=($@o@;UQ;ra6xx&kCF$_QuI3FN)@=X7I<_zyeW-3u{QlM;uO1jYN%Whc3
zG$E3A0;<w@G2aiJUk%Vtg9r_vw837~kg!e+qIfoRC9mKbEVX?)tx{7*MP>gLPWn}g
zW4*M3IlE__T68Kq&G<A*wRLuY2wMpG%^PT%fJq2|Qe`g&dl3eg8EXqO0WI-rYRom*
zl*}ZNmodi-0buuey^fN}2J0S{25>v+zg>3FW#64Cp1FRvfQK=<9S45ErsW-?BfkU8
z8RaXMsqv2nG%Fgx%7iE(FkEWyUpG){L~?)Sr5~HvAM2iPEzwttjcPRX^SUsB?K2$)
zk`l^d(-4LQfAh`xyKowS6YuKBqFd5Y)!_V47Z?s=oW3G_JbS+Oi$ns*X%MDnmgXA<
zL;-e^^-wm4_o8!6{6|o+kaj>aHoYhBZH6B-2cGf#UEaP1!J{Sa+g_PFyStFKfT(th
zeKqUM;DiWLfdvy`&|3juB-m>n92|hg#!LQk-$tYAJanC8K{5ziS5l&k4Sx?LR7+cX
zdL~+2$2<NtmfbMO4S60zciZhj%WSzyNWqSV>Xin+Hg^t-H!`&nrM^hUX;O^KcAW?x
zhK<km`wN#5h+zzAWoIu8_VooGA0J0H+pCkV4;eaOjAbCFDF!Xd_5F~efbM6~LlpFq
zK$iU05v|;1Dx#1Tv4?!App!zQ*Bil|R6e^;&_;Z_U!G0x#x6C0tOF%l;*T^Zd$Lrp
z4Igb&nElMwW{$|vw0CBnv>lA<7tca#Zyc4pxcK}l&3WDM`VuwZFqAz=qO^L_o7G1C
zyRU(Pf$Q!sNr11yD<2ThA%ZfSYV`Zw;Nu~|z%*y$Z&G0<133(k9~*E%s)FHo4LA-^
zWqw&%J9Mc#cClB(a;HmBfbOnGqH^G~02#oJ{Z*hnLH+u%dr<Co;EuX{YbNHVEU#N!
zhSwY=>N4jnl1l;AF98KT|C%P>LxO{0r9c^4YZpJh1hAptG2FYFuCA_{RB>(XRXDdz
z%E<5Bxuf^~@f8Gqkun3Mlne+Ehp~o)c7{_bEZ>dO(8vCU^qNQA1T5nZ016YV2PMLl
zV4-r{h0TuKxgu8bLG@U<&#pb%|L+qHh7;<c7c~%V*>bSjl<5?JFu_iL8;HPXi2AGz
zXsR-gG1Dl*u?4|!s9PZ0!BZuau^V*5#$&Z^MSa?dFhIEevv=ikBYNQB3y@Rw%9m%1
z`?b2-4n+<Z5RO|@|KS5@{~aAI>@q*}4`}mFfoT`;+IV9>>U;5f|1{!lOhYbrK7jXX
zD~!}ew*x#@0MOUi&GR7k&qVR_4s)#a@VQpFg|LUyA?+Q|4lK$4ELW~H^%!g!4IZOE
zVPvGO&MT?henJT8BR#!?I_HmyZO7PPGM#~(ba-YGgtRF5vjWfh06CM&9q*Y<tU}+A
zb}nacm=xV=#pZ<1?A^Ae!>%SKZN=I77~fM-a9Se>=5SFoXlHdQ8agN!y3as^g@gC!
zxXj*u#pihs;Rw>0wR;A7Bf{Pep&5Ez6cniP@=K7OiL>YbV#WJuY5M_`HA->cXOgdr
zdo&@5#|35p^gBSCZBAezG0rBxxT#*@8U2zW>m}h45LY0f(Jx#66*OdFe!n9yDS$I6
zG_5QusSx8L5{W{<z=GdW<H_*><$PDGE#J(Sn41bhkkk0<_G%Q6Qu}T77W?fLf`x56
zQLCNA0eW-Uu%Vj4tljUWCCw`J2KK4rooWzYDsrWXaUq-xd2USBmuk*PnVWx3K7o#b
zc9L(@mC%l-UhRvmXPG-y4A-R};)}yP?B8H*=_Nva;lc&fOQz&<Xe~#`n_l^YGoXS5
zg6EnINn8(Vv5hY`A^i6F`*#Y6K81lzgaf7hJUp@kd6GzBAq!?SQYJe^CS4_62x<n0
z)#BZqtu3Zulk)zq?G6a5yR(_pQy?-DK8^1aKvb{<f$h(93$K2LL`wyqE9)+0h6(w^
z>h4T=J2ehU1Ri3MVx!?Nv4Qo4IDEfx+(uVIE$)y}ynj8Q9Nu=8BeA*N12<FV)%s19
z92QMw<tP#+4bB7P6CrPufY%HskhA@lfUd4xPZ2~1U->XY1pEKKnHdVXkVJMvXgG>0
zFTafzd;@I@NH+*1?B$Z0fWaD17@K8<mVwa#O)j>4*N|#AadZq1KVY-Q8N<kN*fG~R
zPM;P#_|20;Es8>()X*sgin@T)Ph8|hun{o(u<XBAKDr1eV#1FG-(tug0_0VL4s9rv
zcZqS~)Wc2UF#ZJ6k=rhd;NFeQi$HB#kpY50CJl^l#N2*l>jO`qfeB6hJr-`G7N8;l
zyzWY5*Q~AbhqRRwJj($yqrm|x5C|S{HWX=03_u&~e0F^_9OuX!Lc!Lp{0c!Wh;#zZ
znllbyV6FCvK0JZ$7+&lzcpAn(&z}>4`;`T1D}tM$cV}|>V5G-CnC9r0Z08iH2c6z$
zB-9G=5l<5+ufnnW-r9W&pFE$`e#$7B@5}B~BA#52S~h@pb{?pdy1$-ufU}`iWD4WV
zyju%5b>G!h>$2R$JL|X#Rao3a)FSyxH|HtCq$COS#=Yj#0X^z$#7b^fLF#FyEa1on
zE&$+jgoEFbVeK@WnV!&N2kJr2xD7170<X+CShLXnjt4TuH@mX^@mNT<oDF<cBLn#e
zC+OBip2-7)7|`~vb6y+jYrTm>^Xh8=a;9t1_9~&FxxdG2T=o`J1HvmG^*jy^05|#r
z<lbF-fBxs0MiqSLgfGvAx>TXklt3NC@!^raF3-sr2aolE;lJnO<I|>7e+y|*hKcGb
z9_qkn3^(@&OpA#9cUpvng`J>bR0Q<?%J_<f1c2`DIN_q=n8%4Z-c(?E<(HPqa8Z2S
zC*it+c>DF6L`b#;y=GI^Kn69p4a@+|4YzK-?e#MormKqw+Bf=D8AP!w=?e=i+YRj)
z=jpA5{z{XL4T!!%W79`43W_O@>!yx~kk5h`FSySAihiXQLgbTh_@+fMb^7mAW==zK
zT7UP(NeGfrumK@cWZux7%M&o(=qHTOsmznZc?MH=!7oYGq7W82^Zxbv*wir@r0M%E
zY{FKgp~;MyC)?gMxIt5OtEg{d^WUdE4O~w}`t<(hG6oXs^xm31wI5T^fd{bUlU&(<
z!Fg74L^|hIDm6U6BH+XymRsWNGs)uzn~--=_0s1Rgm$&QQ+(B9CGUi_!#AhHZe=_{
zTc#%BXJQM#&j?TK7IkDe<TUO=TN(&TQgoMeZlp6{yWhiBGK2Zxd6|{WkfbvTDi>s4
zU1yTTRg@cj(6E%2D3#E&=z+}{->*HC5T-~80Y3`PRg$pJ@rubHq|78g%3zM@W8oD9
zTID@y!g%gIl%8?eHVpb?XwjVdT@*azMt9^)inaeb)>pr2<s@KdMZC1&V3KApqHyAO
zJZ)5w4o;Pj?QrPeZL>3P-c3^GmkiKcB&afID8;cU_wZjnv$UL4R{7Gf{ZRe!hxC#`
zg8Qs?C9T9B+PN=StS;RyRVX;eJUB5&hp(?cY~2{}QII6|#S?-X8{T5nV*jYBbbHOu
zI(B0rwT)jEJurngww(r#(8`i1%oA&DXb%79M3W`KkNQ_}-P1$d5Ij89bRW`l&)SEi
z2XwiUzb<Gxn$X}g-Yz(IH|5PVM9Q1kV^xBdy}Ql-b&m<pWxN~-!^4YKMl1a5(GSqP
z{LfRj=$bzL=MOJouQ2}SL1bUbxc)pA1$l%2v;X}-uMJkE|2&8+#*}h#2^IQl2N<~r
zt%%6@{ThvecdRtr=4V0DZazL6g%<`e;lb9gUZO4l`NA|(QW-l)qT|%5Q|=h?qXpIL
ziI=xS08=~!yTKjfG2uqu7D+i16l%pqA?(f;e352li7Rv;d|zrO&xwrN4})7a0Idv^
zMzZsSetBp={^2R8Rv{S1xQ^08=srR;+x?roSLq?$84Qy>dcUUi!McRhtTjStigk*N
zvCt_=g?uUasz!~zBc+EB1Z;+;DqrGDgm{p5k%3mHvKHD!=!eCAo_0F`1&*i-wv6~#
z!tMXh@worzX+(%4e0VPIKW(hDy8nL+_5bNdyQXrdqQ6=3HWCHdYr=UXl-@mj{~K-V
zpQ(=tp@@>9XJkaCs@gXQno(Z7d>Q)rvy@VX2<5`U0(JNXW97*2b+_8lNf?mjsv@1D
z+g=;y@avIfH>ePi)S_1dX+4F$o>C^peUq2>5I#swNlEJNT~t<fb~?2K@bxd9or_7U
zLZYJA!Odvcr#?zIDf8I(x^tC~<nrYM!7Rgv+{v%tbG^5$q-14p($b>B!or~Wg(!)W
zlT+5+y=r)d1h=_p{?pU{McP|ORk?O=qYIUgMv#(5LQtf;Q;`xWk&y20Mp`M6mR1B6
zN$Hjlkd*F}MvxW>&wTc~-{1MZG0q?7JICSJL$|E8p7lKUJ?}ZMd0p3RCJuP}`0-=+
zQ-$KO2dgh;^^)NoFnt*k{<BI6;B`_~R=1$xZ11J7`0m=fckfv5+-Zltz8GOf!^@X1
z{go~2&-S|EIR#4Rl-wFycWt<c;^N}M!pE04H_u~{q58$m!vhN6Ah1wNNJ?t4u2=-V
zty;kdesXe`soDpP^J{5Z1#&<uZnCwZgWlKQBZt2$2jlwXmP8<yGOW-`5pbZ%Q^|M%
ztB?|LC<A>ZToPD7v@QcTg$sa<;tr<xu6l0{DlBmEJ9#3krNm6kONoaRA8C8Jxi{f+
zkG%cBZe_bl*3$6b#b*FcUJo@iLV#=KWt%ZEG11xIPdgwmm6?>46`P;wjScajaJfBK
z=lIIC8R0@LoNPv`g$U^!NvNZm%JqI-dHX#AWQ_S)9YhtnKefAFPffh$v&mNfKuAoy
z6nFSx#5yE2l%9p9gK={|ET<74ankEFyc&dRFo*@D4Mm;!I+HDWCK*T$ZhvHFh<62_
zGy&z^zv%sY$$R%A4(gPcUH*`a+Va26&6VAlBqAeQJ&N9k8inxs_2r{IeG^yGc-=w(
z{xPtzvF%SuDfN#P?Cc7AJwQ|S^VJR5$ay#_s;ByT9!g5Mkl%jm?nXm_^5LGMqVped
z5Wl>7bq$p%melSkEiIk9q<l6txbA9cY3b;_<rYorcp)(177!K^BAKHG`B&ODNm0y5
zhKPqT`0t5b^frNAAl$F;@0JHTOhZF${rXRy;51*P&)Z5wdJ9`bY?3AuHA$dS#C$4;
zj?t)R7~4|3U5cE-Sz^4JcXvn51+V=T?=|N^ga_l>Ji88Hz*OKKFl8K71gIXURJZ1u
z=9bGA_l$4rn`~{rOEzc$aY%04jAU!lKf%BctN;lqD4s*i3JDKq<mDv+CjrOFtSL+0
z$=kFvG%;@#Vv#M#e?7R-+2cHjF1x;7uhz@K((<K0?18G9hdYV|BgQK|sj%XloSd-m
z@Y;bO!wEaF>T4l<GX-hsps6gDyLSmnOG{aA-EyKNM)jl%5d&i5>eF!X{?uc1aL{-^
zLrB=aFI|YSf#$}I&GN$+)!XCaI<Wm2;Dyiw#Udc+fMA*tbMi7XGX@$VlFae+931$-
z!X_8<F4s7zzrMV@tW#-A0ncDyd>kuPDeUD-!uKQATT@lY8{AV-sk9*?q^6DrsOcUT
z=qr`7#Al4;KIP_KfeY*G?v|00Lq}y-RE*?JPY4n<_iEw7*Aeq4eW!l4MlS|lbzr1=
zKme?$y*=mkx=nu-$8y@XF=z+{d+o0rR&OH^7Ck*01QPz$?vRix;U?UG5C9bC3;Ee#
zX-aZ(IQ%6xDsE`Z#Gp`XifW%b6&Jv^@&}6*m6em}O>O7EPiIXeBO$q$B{!X{U2ITs
zI>mAKu1CT0V<{=LAI?H~N~w#Z;!qOFIy-Yiul(nM2nHSX+~vx{=){Ol8L-Z<$N*Cx
z{hBV*GI40CxG#g~xBTJ<i^O{DfaS~aGP6iGs3qN(n@)NiJ{4#eA0g)uP(rI-_nO!3
zahZJ8xog-s?cfBxGu>t98aEIDxEH_6&DBBE!NI|?OCrF*ajEt-GRhelxij%K`bMFZ
zm6h1nq2$BMB_OXqs<tZ_v7TuPXyRjI`{upULs2(2I5_x;E%9T=v9^ZB_|N!l(C%B}
z;o!s@yB~Q`HT2K)FWiB?d68S!D<=14FxV>r!sJDPLe;Xhgs@L+!TIIp*RNg~+gVw~
zeS>g8MYEcknyQtkX!iNjh;>D#kjqzW$v-p>p-_klt!T0(_VVkWD@Q=N?U2~LjBiN%
zm!FM|?UR;G$7=M87iCifF$XKvk3MM7Ot8#AL%?MeHlnw!-{PE=!$lJOq@F*&Qv*OO
zt~#@Rh6-|Wk9l}_evW<yB!(ST)#%}IaFpWVsuuxmuYU6i_w*ZZj}9{78S20vTFnYa
zW0rEO0;crmHaC0-`>BDP1edxz>cr95|LC;7fQV6Er&zzvTwC0AO>Gl$y;aVb?eTxk
z=l97#2abt|zzXk;GYmL)3-4Bi<+-qDT|vo~xRE3ueSGw13^HZl{tMb(EBbB;w6QLl
zC&>}2bTeMou*?zWUp-LT#Q2X%pR3|yPJLpYMF71iUOqS-AYztGR0YvVzWx3b@ND<q
z!9+zScr>D<{ZSM=w*Fb1MnO|1p}^jt0EeE|{3-a{(9qC`=;%;`;trsC<&x4CRWf2-
zYH4X9Bqv|v4g+60km(<@ZBHrd=%natbC#Y0q*$PlH@4|?xS<JL$QFBQIHs|1aP}?r
z8iZC1y_T=nEkWmjUO<2hIVm?stt(O_0>qh>Un3^~Y$78d=oqYD^MKb^VHn$4S~kNc
z6VlSgo}KwtU1VyoU56zgN|e{()Ps1rzA^at;lmfuDK7uw3zatVXodDdFu(wUc8y@A
zhpv>uxsbHDyYh#fogEFK1G>~InV7sCYMe2q_0ksTgPPJ4@Ms`2e&4*<g=9eNsEMT?
z4tKa@m)c^Bo|I=G@;i3XpuVo+#GhF7`6{xvI*#EyDladehgty+u-8-9d!f`sbM#a4
zFyl`XA}qjxkdz|sS37imFm4ii=py^F_9=XgypClmzb4&6QdkslTjgL6J-IrG*oofd
zw43Bj?p|J5X)!LP6A-A<?$`zh#DPh)_&*8OdjfCks{`k^Y}M2VSNbv{qi+a!Gm$zJ
z8*(HsLI2|Cezd2jr(j@=6P5SJ9(ZaCP@F*}ga!%7%xe`js<ytF#zj}?Ky9RJh4>y`
z(Y7U0*VngmiGn1l?dw-zzbr8Nfb8^TQc~FBqOs_H505?5Ad)D&dBcDeG+(AZ4sBOx
zk27;m4-at-Lkg0eo$VjBV&3xc{rmT0cY+VR#emch2d|Hc!oA7Fbm&dJ4NI;WB=340
zRsQGRSJ2Vv`T0q&U%zfoy$R*>ulv`!sJH%Mj1NCh6+28Al46OLXN0vkvq$Uu>zVcv
zJU0-`#6nN6x_^gEVU_HO<$-LD8uY3!S9>3R97<x=2MU~b{ko7488PwY8og~-$>vPm
z9nVJ(9}*dW5sd*8E+jA4u3dYXo{n3n6<JoseUpWyj*kwGE>=`EpWqT)og<KR>!`<`
z^7|aw!eJSHstE{*sAtKXi8@;%tb<^K;+>IGS7GX;+mC~wqb~zT9kiZOKq0SP+oqht
ziDu}#8w&7zP>^k{c8%~Tx|F28euis30q=iGl0$WCYc~04N;3ic&<WeGa5(>D8-vY-
zh+kX3)r`}gYRN}7B_2ZK>8rh0hKhwtYvFfGH9fs8$7wt`YYq+$Xe|5*>t><rF<jWs
z7~eImVwsSbxB%|CtB-d4%fSuS)YNob^IN&@9S*(f`S_F{&NaOn@sbM0PQc>CPbMR#
zfIy#Ao5Y%^SVc@}Y!h2F)GW+^b%~9gorsopXIp_{xXno$acxd>mLhzan))0bbynLU
zU|Mv1d?O1^M!b|i&3V7CyLNVVBAyqyq;}R7lV;Mb-)$u!Wj7nNg#rl}HDa0Jb<P4g
z^o=Xlqcny_0*Haq8-r`?Q@3v2LX-)}+69AAa67{;&?;;JyeuvwBO3Ax#UW`}8d4CO
zAkjcVg0zf`6Ih)gbu!>`t%yVBAx=<WLITP9F>G)I;M~Y3KtTuevlYX1+F>L%4$iyM
zOSO0BDjqynVwQ1p<3qmB`u;alZUpdx71s=zwmvhl0qDe#*tC%C0vWjq`xgMnfo$PE
z9{m;a!?Ln#V0*daG<DGj3b@uVyulqvX93r*IyePxnAzvQ6}pA`IM0C`|8)5MLzHml
z;)@QmF*n4H3%=4THgkBiaO5U5rWGxtIIRY6BAE`fkJ^E*!Ufyh)WU+1kMBBs^gUJ8
z4lv!&_iuDs`fAh`K{U7n|98;c46y6lq-11_qM~}QFRH7nb^g@DifaWvMy|<U0BTWz
zpmmXc`+eM(AM#%~51Nfj=i&cD;uWe}2%7E|NS+C)sG=Z$GBr0B{#pA@jrHZLS3!V3
z3uVMmtgV^TC3jO_oa2!!?m9!LMOAhvs;RxyXW$hR(-$VwZ}7ejp^^W72c+(blPnOj
z>fC?6N}4FQB2G|b>M{SEP=Z7k_pNdI=+-wQ)^Ul6Oc~v<19EQ;0ltNpI3W#m%4m$a
zzZb{w1@Ff*8+E><AKdX1S}`#;R(tsH84x&(;08ic7Dk7~%Fccng&5T8Hp#!0($XS@
zOb5^-yb#ElKWIqj58V%_l9G}F&%vf%FL#hN-@A8D652qEOG^kH7=pA3nChi)n<>Vw
z>Qv}PLkuDzAsMIstY0;y3D!pNcE%<qIqDyBck&7#ppZX&_^^Sd^?lP7R}~j&S=Vj=
ztYd{-R_5XA`IkWu)!q_{^RuiSsn7jSx(#co(jz<d!Iz~SQ3IKElcw!~S0_~J6i6E7
zOG4rGLOKVba&!8hd8X~b9~Qy0mYm02si^}o;mEgDd^cG5n6NgJK+G?GeCqJn-Rtwj
zZ80=BnC%H_Z(&`6BhYmJ=9$*J{QM<&si5P0p!T1fI%v4*!_8?0OKh7*7e`YLOQ1%8
z-{G+g`$a_^F>g&4K*Zu+Fx3TU_AlV&PH*mdz80iWP&FYys^nO)qm%^Ey<FfTGKh=Q
z^ot#*cZ`V<x{8g#tsU1~p$#~5f(~Jgo+_li5H>m%H@y2iNX7~`Ce>RqY+l?`dgJ-g
z+X32X*RBP%v`E(_v1D?BGaLd^Fvnd*!3F_HQX~w&!p?(;knrj8#D9{RHPVC17HFf?
z|4AsQ+T8iMhaLJxRbU6wU0BI7*47^tUQqyL<K*N7j*nkf3?`f|Zd-_a7eAlvNK-VE
zl$bcUyqp&_6JHjdRv1TyL6h?6iBc7@_UdbyaQs6PUI8zW`=etff;>D(9T6h`cDGZA
zpM?dJE%6)sb6nMbfr&q%f_QoPdG7&cJPowFPznwPyl--Y;pWXNfW@zPatu4n2K@D_
zb9(v58bX*S*w%=aaX9?<)yk?%I0s?UIlsnhBmO8d#|!yk_sQNk6nLk;UYf*sxkfH5
z;&bZ12KaG?|9`;{S=losp4<QB0{rjrmQ3A+Gmu;j+ofdv832UPDi~R?0fhYb0zrVK
z2ZxiE|H+=&wBPZJ=<&-AUqI-qfm^Z_^8s2Qq=0LQj{bS5y87aY6EJ_@0M#+zbZXA_
zTSxSba7bN1mlNv{-<b$Bc?1-9UrlK`|LK6=z0T~A!Hy9O2A0IYg%NG+yc-%4k`2yW
zu-~d~H9^u2UB+;FnXvIh53;8}MSb*|{HcM%`;x4c>CMy^Fl_oY<1r`X+Y2}aEZ|mP
zx~*%SK<@IZ!Kjt<&g~wX-NE_2<-cbHlz;zd<5FA47jys+&&4cAemvt-9LsRSHw>2|
z2$cRlz73iICpe$h-lN<OL4tHSjzBC#q|WbH_IyFng@=QePe}AQ3Lm>AcX!E;WTJVs
z(53yU<Mtp^6gF;~*q1Mj_@VE|*i^E<!ZlGD^w*71wC%wuGM;cB!84z@!JP%O3e45M
zjL)|ue2#8|#1AXJ%k<I3dVbbo)eZh^NSQBi<LynJJWzDp-O#k1C~MCXg)G*Hn<6uv
zzgHnHE}!*PJR;|b+R+lC0+jIef%ml2Qdlg*+b_1-k14(>F(Z99{$+R|{9%>lPrKg6
z{$b^=&A8Ls+s+QLaPa-Zf38v<Yy~(B8>6677*8O$!H)}VK=&>qg~DpV{}D(1AL60^
zN9!`tU)3Cm9N>J^B=F#0T(;`Dzq0w7t1vK#7oZol)!%#VKMJ7lcDaV}6m=du7^oks
zt1^Tk7t_4|`4^%Y=0A5*p$`kbKe=-ix^@9}uOT5se%UjgC-r!ORsjMs97JfSnwpyP
z3M<GJkYBaY2M@S`Ye+&yw$x5$*amb;G!!`Z3uhEb@T>m!g5q+{OXDCQUBSd;ymjm9
zqdcW&@^8^laJtGAYSmTXOA)H+=tNXk3qsDbcIb^zusTAn5<_ltHC1V}U^y@b_$N$E
z;BtwDqJzi?g?_~I=cN;sD)|6}1?ww8=OIWs=cPZHL^3N6&ro5%yzFq|z$nH<1d*SA
z21a;h%w-zJVd6{^%j|itC=BdOvhznxH+g_k8wAeES5et&tbkv^mxn!q`S!bIvMAwy
z@G8I4qn!8eu~2XbqCrv$y1RSb(EwC}S(RIj-o1NRgF{1TD5#rQIXJ#TR9Dm0#fCI6
zJ)O$b%*+Uim_cXM%Y=lGo*pH*<(E-V6CvufG+B&+xakxj7iM5Wg8;^_pe{NBBj;1S
zXt`cp*rU~c6OE^IidA-(QI?UBPUW?f#M=#Is1lPMgHNgtWd59;G~y=vHftEh@=aAP
zER=9=jn|RYUCjNJQCGt4(JrF1SXDvZ=!22b`01(y@@BKTb)+x2Onj;N@d!mb1|+jZ
z98ssjw9Hy?mIgaCUTsg|;v5~O+ldX39q5e1q81^o0b1V0Qmjl`;__0&y8GAtH-GoM
zxn+vS-hvA6!-o&*6QD<8#lv`=oV?1L`W+1A0KiEr18@z>t*3xQAjW2pv^s$nxVAzM
zilM+5QW7{s0Qyw#CJdFPPb}6cy#%ebq*vF$C(9cT1xd-)HHt-H6yijTZ^**1@w_w-
z<IY%-R9Yf>!}kalt-_$nYVv69B1wMZE3QI9{N2R^mW1L~*NkcW#}$a;@75pniHs-2
zp)Kd$XBF|f_TXaYuiRsQaRZ-K>iRNUiiCJ(G}Pc~zrw)V*u|4{s`al?7y_^==m;k#
zOML$Nlep11NX3f3NUpMLeYCqPsH-1+R$=pwWqtwdF*9{4uyag081`#ceJS{7@;nU=
z91LiAfU_`*RF=xeF@U%N^ofRg@#4i({xs@F?Hn~aW@Zc+lacTZag~4-1V2J0;ZKE#
zKEEZh&*-Ws=|#*a)^1Xo$jODy*!+Xf*m9?CT@#R%-TrpEM7yhG%n%rpCYHVQhJxEX
zYDPKT^R2eQqoF3LSE{KSo8JdVnVD`E8Ps7w=CpEt+Qb;}Q}+W^wO155G#^+>2b)`6
zaPh8$Vq9L#R}Hsq!zy>D36~4_LwrOnbjeODN%@ig1c5&aCD=mR|AR^N?jM0-W*#6n
zLLb_|a{;|>tj(SU^>XOW(nx&KRUDKWTVjKOJ=lFgvDFF&CK>h}-^nQ;@k#VYER1G0
z!S07yU0vPw6$4y<?e7t7^}ME|{eCpmM+F)q7x`BSW5Z8(iB(Z+)$1Q^ECWSZvC;w#
z+4KFpmZhWy@hI`^k;SQYda{~AeFFz2xZh5O3M?5=tIv#E=q|B*x#;!1$%`));o8W`
z$q6Y5y4p2B^@S@%SWoc+50XhxAxz<lvtb3zpfYDb9rVHNYYer>mN5tHPp~!JJPCZh
zR%y}bjNTP1&US9#zIPM#bOx!rB=og0QLyeuPrrN*q%W_aci+%J1@0bLp(H^^8+8+N
zhEMtM5Eb||H7YoXsGo~BJEE}jn`*`-)NQ}L`{5?1!|s_K%)bP0-ktaQ{@2T{2d=3E
za%&{!m404V@o=u8g1`vBq2%Wewm%{R5Ct$u6biY|rZwbG*PzEJ<?k;J-k{*E!)x-~
zpg7swmY!kbj$HCel=PDuY|6}?!BDv3xw@5n#NNxMQ%V&qm1w<5yE*wo^V5|!)vRsD
z$E6foCPYND1W_2GNVr=QPRZBtigMw;X#U=}&BT+Qz8YbV-XD3<Z_|a_U_gKZZuo~G
zGiId}I=qiHkmtkMk)p(ms0C3}eM*Z;N=i|@H@X3;d}sO<F>!@z#`}%|1EpxKxRb|$
ztiA(p3jhqP?*`Y=lkEeF*wE?}6;UYFzLf6{TyX*OLSYz}v=bF_3h|Id_d`lbJ(8Ef
zVZrOWgx8%^q@DzY_Jc$}3xpv8O$9i!r1FO*T+e@zW~hWiWdKJ=HpG*$9m6X74Bm=Q
z<StH5T=^zU46%-fZRbmG70{aVtZw3Qzz46eYv+!c=v>XV_l(JT)|~O}?Qh}yWM+pY
z<ipH*aR1Y`K&r{*GJVWTGf*Z9w3LDb72JYg;>s_8c8;v5p@lPOdmGBgfpymuK_`a)
zepbWp0eZOmxoE>7mHg{@u^5=ziGi>BC~8&!@;IoSwfrHOeI;;}oRVBmljhj1Pn;Fs
z8y8i38MB_298VE87EAF>9$?D_zJJeJ#dZuAz(<Y?=+!LNePB!>6JO?&%&EKj`Y=#%
z6X-=mZa{^)ch6Urx4OoAk%QkQUC_TC`J4p#`MfV*G?|(olEoi3on{<gev1|hpUdj~
zQB-)t*cjG!9Tdf5<W`Qb5(B(MQvnbF`9z6n*R`r7s9^?i=_NZ3@@9wKFkS&Ro;KFz
zBtD&^RX}w8I(jx^&X;Er&pV0r#GJ_3OCOl`Cw+rR!60@k8~IGh`dh>nLR_Q6PbYtL
zrH_QbjYj*Tx%^O6#X??QQC|rg7b8uJQZ};%IV>!Z!~n*xP@)J)NPZlh0!r{MYkz;=
zXlv9ozqIt>pBkS_Z>qYLQ@Q2-2(h!{0LTc<MQHi8!8*I`Mhl)7EWDJ;u|pLv3b_FM
zwEvKZNfg&PLhP~2z^-L{D9;!qAM@j>MsP%dVxVVKPgGRGH-4Zs80eH_&l%@Fi-enk
z1rNha;x}4g+UJy%V!bbM8`j}NYQ!^akO3rjV4(OYqmd@WhVbfKFQ6reJ{S0q`7_GU
zH`?3VbNn?gmA3cehiOli1T924ITaQB7m<<g#>&dd5N!hmkNLgePypkrk}jh{rJq5L
z^T7uU9Hew~$U$%s1<~G;ml9He95^!(oy0SmKP&C-=1ZBrdtI|zYzz$f*24WceSd5@
z)IYqevmluD-4P3kp^gmePR?0h`YrJzO9_Hby7r~Om|J=tTQfK_&n_dUQoE|?mo$z`
z%@EshjrV;m5<61DY2_2tpX)O*VNnWQJB^|Gk{5+r$-!8RECO^e|1BsE{)G;+g}77c
z;=8gn*z635pM<qlcV29`3PUD_j9@T`jPJ}sW-qy{^n8JhZu<@NRgpl|nv8zF|G#C|
zE|NTkHJ5S<3p-xq4~#NvTAHNmd14k6GBH(q9<o7RW&9{JEiIBW6<1XyZRKsJXt&Oz
z%Wx=*&5oySY$D;+v?pcCni(bM%nk8544iAH5@I3iQ1%wvu6Alwh&#c|G^scFe@e!$
zT1b}A)0h;++%-|gLsg5;;b}c^aoPP=W|qQholq>ZYXiIOYo`KjJH!^QH&b&*P)H2S
z&c@`(*iGqQxpF1jXQRdD(Pw;DXmnbYwP;?GDF>S5ZT;Hecq5|kbot~w7)4<!NzvqA
zaMtNo`;PmQ$bVo##3!uwiP{y+y=aEjO<CR*^#s5lBxlsn__3+>pKLh-1K1DKxg*vP
zR?Pb|@t~~*7s1HG6Ms42-z@x)2Y%uyFJ-B5J2r~?a^$5zJ&qkGM`Wf6@@o%2R;Aaw
z4*TlWXL=mT{s1%sq+n9;-(hI9PrGpiSV^z}YkQlWje;5-QZc1}_4!06Sn(A0>Z~N4
zJv|3*<o~AM!8CRMAIsiE6!eGC1EHpaS#T|5yM*6S0=DCvzM!|mHv}K#-@p@khS-%i
zu+#GYr$FrA95a&ZaI$`M(I0S0i#-gVVlk~5BM0ivdFThy81Br8^fN(?Te%$YSEMmu
zHG^i3CQhViuKF2FJe#Rmg&(SRIu{PZTfP$1=eeoJMecjtAFvoBvfcbr<hSqZv;Mii
zy9B;qBT~f<8to2nbE8hm67lHEQ&KcX0n8Ll)^hXB)O}zL)TZ;>`a;LR6J)giz(CHB
znFA=i1a9fTe1>IR(o{nDWVLr+x1P6p>(d7*@K=uk@MSU~09t?m2wn2O*w6O^z(`T?
zThmj3PpY9RwEGsY8)+!{_v;Pvz7UKP$=&a7IboNO8F+rlJA=!qc3xIdN;^u2Vsh%S
zl@&AT9rdMWn0bGMN!}QwiJe;fp4suYNFKO%|2}|ZXko5Cs0y&B@x3@%<u~KET7*Fd
z;}3GKeSga7``b~k#<_i4j~nhe_^+SE>YqTxy?bmk#<@6I@lS~>(D)Bx;NCF_!{|7j
zO$oQ_T|#0R7*$X9y6+<NiYQu%*`l-U9X|q(>FR~IotB(9zgH!8q12zq@DT^Ic;E9w
zHNCp8E(Bf%Pp0M^k7tg5P0ITNRrLYndgNR!N59XJo(G6PaDR@zDQs+<wWqd?|95Hq
z@36=J!s_`ys$&0F!VvDy*l6g4!wOI1mLf#K0{<i-P0k79lO}A#)IS`!vC0k;gdDkB
z#!|)kOPnt!d-`qbu?7YEkzYRymkB=r`i?G2(xxD=S&~AlsOP{*11|Mqby|oRpXN5a
z!sm#$TsMP&@y)Yln>#$v2mx*hU}1q!yFg^16Becf02R0`kcba#9?njl1se0G<&0P(
z=OYP82z0VNUC)Ix@BvYOyLpqL-_p(j6Gio*KxQ<Y_RU(`Rjdp%SD!j}W#kgh&h&mP
zTR9$WSs8}Q%JR<p{Wc=)OQ)c6yW(tUW784*OXAFk#o4(`&A@-4gXp{Dd}0#9ltG&C
z8X6=B2RS8$9BxKJ@;{BE&~{@qlv0N9$c;2wN1#5?VO@ekqrU87Ys(g?^?|ijWrHRo
z+xQL(Up`MU^x(JWm4<^?#jQF13F)8Yot+il2;Eg(TC$9Yz$jWV=h@g~S5to#-E>g_
z<s5w@{&S3!&Q5Y!`LFX|Fk5%GKCAu~rlO=1o#k$|<YkbMpoIh$yv`)m)vrO@5ujx#
zeIFVc#zH=W5~zFqTQR^+0`NWP#)jx|9RIF`{t&dVP$;mKI{y9Vc_)u)Yxt?~mA$y;
z<}V`|uOd42F@iA)v}3<!iuJ$!@PX80hVR=LJwzDio5deo<2&Lhyu7?nKpw#gUoz^1
z#(<zB%E-tFOg?rGR(zQ5+$l7yA|oPN*mZkxdIJUU_QL*^f6$CL5si;ZKUVw!SXKvW
zr99Bl-fN3y_8@jvsCj7Vs3gaAnRfQ|9UbKP$mI`t6;3GxfHw#$8=JJEA~p&D`s|XD
zfsTj&Vk2J3a4m1;-Apy0GYPp=21mYD0m7+Ob(p;au8a_X#V0CRu9J|^v9V!8fvY|N
zv|(TJe_tMV?B$CZ$j+u)Uxh>hdO<=NVFw_V+Hul{7yk=uK;?^Uv7St^x(+L4=t>zG
z(JwA8!ZDpQwz&&)CTNJ6l_bs0nW0DaDn9<*GT-a8;4(AwN!3(@&7-a!^!ha=bWqWF
z%zGS#Tp}iH<?r9Widc&xBjR8Nn8E$bA1f<JGwfxT>AeRJWT4Q1$K%ac_Z-GefzKyA
zO*pfFJOqVm2ux}qy?_6Hg8?wm0gyo?JO~LHFd0Iim<$hVq}eL~B8-lX?!Frm7B<;t
z4;Nuzz;RAPMi!oul49_a<<0E1$*GJOr|&~HnWmqLF$cIt!<?rDtL9kx5(fF?a~i1s
z@K_8COh>^oty-kTI(^D1?9q2KdYp!0qRvJCQ9Q-c*9rVfcT~)d=YtnK&vtLJ?9|^+
zm#!=>jt_uxo$dzLoBm>AqLbiJEwt6XR1|9IYv{N>qtD{n>&ao$q`YwbvYRtM$<y@(
zyp$W<XjIJ+ZO%p`m~#SqD-Z%Hqu9&^jz>}g5MiL>RSisSBxM5>3TPn6KSN5&mWVAU
zC#Sxw^GR}Ns!Daz9e{Ue+<}7teW3ur(m{0KrF97-IH#kZ{wtl<S2J#kqwSeU=zk*_
z6+C1Q@+QEjfU2|t%~7BTUP1vIi3^MoY3gPVl2pdHipz9%16EQka!DxxnA_$;KsYru
zwLox}LP1*xu#$Vq%5tWrxx6WBzyW`#rL{8Z42*+{@>$@lK)dSE>&J4%V<y1I0J;bc
zh(&UDlmK=Bu1!~0*WeaERGaQj9c^vE1EPWq8!`h^hTwWdZOu@>iV9TV##ebN-*qO4
zphlmH6=t*kMrALw5_uobbe`}0{d%@Ol%rqX`F4tIaw><5T+M`^QT#UU!qV5AA3YSl
zjvFKf-e*p^9UUTm#b2K`&%zRX#7gKorvH0>_*PE_KOX$#!Wv9e>H6ikb@qc8iIZ0H
zVMB*0uV0s}oFDI&NI#>#etrCK+U4GBZglW+|B;aN=3N8zqmI}Pc(*8+AzOdg!=rWu
z)5lc;SH8~OYByivXR8c>Sk(LXg1$$O?*OYNEG4BQ`@3aE;|@gmN_#&%^L@GZ8eM|!
zTUb{X*bMym$V5C==!Ly8Q1cTOS<SNz*TtCcLD&VA%BA>q64SDWtgNhw#v=Y_tRye4
zq5@l5s6qGMFeTv3TVlGroU=U1mo6MY^Y+r^hqZP$P?AsdqTY^-q&V(0paQ9Vj*b0v
zDFISCHmjDEZ5SOk{ThaM_cBlxEhL$7S}<w1o_+Tuuc_G)Y#^<y#P00s3h8pijum|s
zI66v79vxol?Z$txmmG823SS7E_lT?Am7BjM9uc(2`5bS6ZHqW6uuCKQ&6{9y0hMPT
z*%;lodxDinLw1*B;<B<LCqAzpdls^+LU;p2R0>!M!`HqTmm)4_h(g8L#YJCB9$l&#
zEE!QK5H#_t?n6tD(`NKGw9k89^Wi{54}=aZu-~PnZSx)3Zrwtriy&tYYyqUf3Q3B(
zx}1`^pmj8o)Aqg&g(#LbHZ(N!?!{TX*FNIrk#@Z9Dx8~_XAI+z_;(_oKYymg{Q3T;
z>5pJvVSKW;%s&<J;)S%C855vNFi9`A>kaI(G%eV5x5n$ec&u$~peY#&ZS1OK;<411
zFHw>0L9kgAAGI+vF&V)dKwSt6H$=;4pMZ~<SstK5gj&Tp3lh=JWoH=vQ5x$L*~te%
zr7o6M;rm^GG!zzej_c39V0yBNQYlFMr8<cuy<bSw(h=QC?B#{kaB6S*QG;gc0=!AM
zHj3)h4k8WjO)0`6WM5q3a_J`B67icfVqj><Mzw>fSXyRGO5gtKi{G9~0YCXr&0{q+
zsKCiQ=47XOE!`K&`zumH_Eg{cvN~RQ%*joF8{?SbgIz`AH^Yju>DEUlVm{tVF)wXW
zQ`b2u36?yXd}s+o2b^X>2ypYZL3&KU-(%jkcI71dpjrrlAt(F9gk%E5OiUeUD0Xdg
z1{M~auCCJYYA2DT+xHb9Fv4WmFV#+c`NE$*a)VzfI%PCzIQ}|vVm}?@xB~|P5jktH
zR>9}T;_No)G`^hmV}%NxRZ)C=mNo8plb>#{MazqpT3;`3Z?~*>MlT~`%<k?gee549
zAN=cnJRy+n#b2aEy!U9cF|poo{-p2odHW^g51NTYa2epE@K&GUO@*eU^~P<i7R{|W
zL#B!p!s6#HE4lZ^T7+EGe?hobF|o9}{%h8!E@#AD)HGoJ8J+F;FK+W*Z*1VPwg+5T
zG?x22eVl+r>;pH(goc*q@|xuxg!7;F;U1i_L^p2WROrquMcsfU0#pTnk{f1hS)tm2
zmRM%FIF}J1_CPmftO!9Nvs9!CMi`*60B?@S^`^JIA!B>^__5X4Ygy)aBS>aZbZ)DJ
z;MD@$3rUV-5!=wk_n(TP#s_@*=PO2p3*he$J&ue<3BYUN<WqCgYJtVdZ#NkNH9Yj?
z-+;yo<SO=eF<r~Q5kApzW$}*<C!nqLDcrPhB;ALOr7b|VvuZk;p}$KwJHrSRY%H{+
z-w?Bu6jzc?ay-YKHz$i>%(#;vYBV}p_<M1)cz2Yif81>WV%t(id!&(|59woCf6M*X
zrHwQv3b70fyc&w85j&|8e!{oy>;`CrE}=R#K6ooNLhKya>lILMS=<nqYaSd8^ZI*e
z*lAeanO7G{{&rz&;>qcJu%3zvsryc!g8PyAtvGsY+=K;*zdW?s#r#XjO?pp{XAS>)
z<GoJ11K{5~<&#%T)T<-PX$I)1s2ll`Qc_m2y*3`(J+0F<{U}tC{${njg;`;9wG+L&
zfc7Guj;5wiXVZ`K-B?d%E+R<<?Q7YLMnv4^xZGJjeddo#)9%;AT4XXZIBUaF-Ct#S
z+7j}d|2ghMQ&Zg0qM3;F^xIUzxm8|v$M$zV7O<B(E~uv!(Z)(-hCC;3h4ImH>dDs&
zwZ=@wdI=<MxApsz#zH1vq;G?c@;!J+gike&87*(~8CgBhgE=@4CNMU*Z;ql?{Q>45
zKl3E+u(7p3umhB1YZip1??{QES%g1U0FzE8ME3UgGnnOTnfXzx`nptIy}fdfXG2B>
zs<hswqN_;=w?zW@oR9%Ng;Ck~`MKzHOz8F_z&!>=21A8EA&|*nVrNzs@JhEv|7ZY#
z@!}yX3BH7kYBvm+eXqe*XIA^sMQ!&H47281TstMPuzmbvVdYGAW(3Sg%{?mdg@-1B
z=(jR`e*KxQF_^0?`iPxKcGvjgU|prowoU1ENQuw(v#(DBKRm#Re8ppdLP>edm>p*h
z)IrmZ>io>5YLOK*sf%ltDC#?M8yA1HI~AguSI}|NW8&y(xuhxcgT3=VbVb#R;xVh>
zx_Cb#A!lvfn%IXP({ueg`$}6IyX$IN<}Z`h6_s>(1)k*IxU1c>5~<FPQ+mrzI_QP|
zeS03Vray|-W)G*l4AjK-u<BkBez#kQ7H}Szw*9iVT#(MOe=tPt_Cm8DX*}Tut`FL@
z5{K*cYt9m=?6Sdzn->;Y2)lR!73i`mygdXL(OT<PTzBa2oHh1}Lb8L{3z{Inz=Tv;
zk&Ucla4mBHNXBvg+qX`T1bE$|!C=R=rje5}8n!*cwnHWf)dfH&EuQVCKBmYFfP#TB
z97MA>u`a>mgrL_i?Au_2gQ0NQ);khTGGNFnK6qev4VlOdh}+NIhJU&f+mm?cYl6&g
z-n{WnjAGbeFI|@MTAfdOK<m|J<SeyS#FfMI*s;K!c4v)&P~6`)wtHqS^%Ds(Im&T8
z;4c}9aJV%voh+mL^@fV2gMzKaCcYDDFk(RMrqJ3YW@e2b-o}W?|8fBWeqF}Lm{fo|
z-YG_lE&sTB`u8sNSfa$aRhGulh_*odNQ`~GEFcveOP1E$GVf}IIFDGe63|dug}SSb
zC!Z};r`qH$zW6R<zoPZi_|vfU<30?ZFzcq`2&mmhlU*Axoh68g=)CN{vrR7X>lr4M
zhd!n)@r9<QfW>UR>pBi9P>J-%FTX&aF^#zKNp+<_F#Q}h!s&wUhi4#N%mcZGrClx_
zs)uZe$ZTTB_yNpBx!&Ym=}oiXVKr5qQLWvWv<8o*FK<g<@K`|o3<&)2&*SHX_~{kj
zevy=x0rufA4{fg!pN363FxITW@3^wd?<AiJ?NTFX4k3geGqZO?%h$2dq2mdG6cUlR
z%uJ4-9l&auaLuCMODYQXN^*+{Cmwq@C9iG#Ae;iMT@@;S+G|ILU&kiz%WPl2+m!Il
z{A^8uRoLm$9kKG5dnuw5g@+zLgBX}y7h7AXIM^F6Qqne=eYW{;T|ZsU6!%kS^O;9u
z3JPAfw6An^$0==+!p2WJ_LO0v6i}geW3qy^udhFGV$gB_$KGDBeQ_EFzFczA&Hrhw
zWV<?Nis)#fd#MrTDW#8R8C@efyg$|!!akI*kW*WG4d&OeS13kBragz|Q4n3Zpr4^e
z!cykt88_;lN4}DT6zjhmI$}M_56CdL@@99fyQ8*21M*NuhxOb*Tiar&?2Qd~>qCKr
zXWuOAPdb+DrSpoxb>TVi<k}#IK1)tdk1FZ=29vx>DaPJP0CFrVFMkOI%Nfvz8O2|p
zo{a5Y834PPju5Et;0E^&7t78vmsh>rTa<%1;3&xSabPwE4jnoO1=j5YhHa#Tm=dQ-
zY!9NNWXHvhvjL!}TRw(9F9e{H_xlcI0(wlY?$ja}C{OO`6O_&m3ghm`?HPISG$KF^
z@;Wh;(mGmi>=`J_V4_%5T=n|%RH7XP^`~=WydijS8nwvgci~h1j>;F&9g{u#-GQI~
zbmT^K3G{zK>!K156M`=knQx%an=>G*+Z#R5j{V-ec~xJ?mFxb0hGy}+e{P^j0a60D
zQ`)hF3bu%?g9OHx);l~vhD8hnCZd-I5_JnJQ>B4(uSJ>i+2&nUY3cXEBJ|mf(FN;`
z(W3epN}1fDb!gmM483lTgN)FMKNS#>DopW)>x&wdKo|rXYeS|qk~mst(0|o~Vi`J0
z{!>k|fp*8(3NtJR8Tz6O(lV!hii2T&985&|eLiIity~_Hyhw@jhL3V<Z7b+V*XmZ0
z|2`i7U7dN(TSLU!SE*fGJ|B4FvI`p=k7!f(>IMfdS0B%&jg94JskFyXKY1A+9~#GK
z23>xBmGt*8K88Z4Ua(O0?VHG6qktoxjv>_F<A4BM6#tBR=ih`ZVRTeP)^>H|P)CMI
zklW8BV7k>=+Sa2`o@+U2GGwB^0<T@Y%9bwfcMbALkh)fY-vutegF!6Z%!?%nej%m3
z<F=8@L9OA3gPRS0za^<fC%GAcEg>|Mcj%nEnL?(|{&7J+^VjnkF}>%}hqj~zHn>H)
ze83a|<yKm5WWg@IeLJu`XFg7QP-B%B74_vUM^sr>=t8Lg&DKNVIC|ZBPp-f;o_3(r
zpo6$Am!<WlbC>4v3%?3#zZ>n(xSz$Ki8{y)`yJO*qzj6FZPmZ_RoX`cNsIxx+}$8n
z&4#)$AzdgqzoqqIV&bx6J&rc4z&0+C6&U2vP$c0JcKO-SpbSBczzjl_bIniZG<wt9
zJFq>Y`^g|9nwUlS6*aBDPT<`pTS+IU)EUe5ZRZiH%G_M?FJGLko_-$H`eHBZN%^~N
zmwPc?sYcg#jSzZ{DKlQNOyw0)a|FlNWM%zE(nf;}eZO;wN{+2-7JLN566X1M)eRzQ
zvCGJN_lp;_H=R!vKvnqjk&Uc20Tw>hnk9PK(=Wy!Y<Ffa>@;_FL|^v+jsi&CjwV@L
z(H-_zuU_SHTtlePL&p)%@e>tCOxOuMTz5zZD;P2}GJcj%MF7(iZtlC~b~F{paAz{*
zas?m(1*O+i;%U+4XDiFgUZR=XF|I1-g4V<D#fyO&^I$H(-JKs*5_$EoF0)o!5W0Kz
z_DLAOwhDgqVYfH-<<0e_+gb+twqaR~UPtlsq}^0bWl(PV7!$R%-<)1_O*p1D<<neK
zlj;;@Pg_W{0`2v~>U6>Rl_2y=#$s9#_bZGF-#G2lFFi=gHCg_q^hqyuVs)Fg=yfaf
z5uJaR7*N(nodp-{a#Oi+eZLVsxWytXd->thY}~6?sZ9dhcKjz2$Mszn+c?wg88tPR
zv2byv;UBxYtk+*p4v~B+IyeYKnv{9WJhMIy9$8fa<X*g~^p)12Ycq&7QHZ!cS5m@R
z_wA$3^XplCB4sYCDo8OmS-zgMc*VA31xDDxJs#A^0URWS&n8LVS-N<Pk)B?Paup4Q
zjB{IG1!C{GpMQMUa6u9Kj2(D3JJ(GA{C18=rm`Xd8-4Y3U6IQ30EoN%S^9)m)=%9#
z;FLpi-8!u~=VW4js9jX69dU=$T>N+TaC>g{$8ULw@`iwCFm5!SJ{9x<g9eQARGyOZ
z3Zs=^f=Sn(SXc4om)j%NkI7UW69<Tn<Hk2ybqr&zu+c5}*53hodfQ;ysljQqR;qp?
zRgeo;RU*TB|Ftw1TAD!dv5qL**%zuQwal83#<DP(bxKrI-j&%3Dl<Lm-Eo_XV^n9y
zV|epyL*l}O7!I*P-hvpgb?i_w?oMtpbt$|dAx;t+Dl#zqBUL!Q0Q1Tsp8$t_-f;Vm
zRstMbU8|QiG|J{c6h*DQj{tF;@Yd|h#6)zkbOJRL(AVdRx<hmelg#IV6<%Vqj1=5}
zw}8V(uf0<A*RN?q%Ll{CW{S!AuYrCZ2Gf(|-^S%}k67}m<2?KJO%dK00mp&!4Eilz
zm~nU&d1>Bt1$FgT30FRR`Xmb&)i9nM5bmK~SKq_~9}$pG)mh!k046%vMPqHt{XN^h
zqlFN?>&!Ux*4FNhilKc^UWS357}+MM{>Puq@AHhoiMP1G(W?Xa0$k#9`Ju|#sE|G}
zx9s^B&139RrS$f;>FFp&H#d8?<+azjYndf4@n~bH`^6(6asC3;{Lfh%@PCCmJai)`
z{N<b(Yz!!|WDW;pJQ?m1pf#Pn>uqYYn|fJocY_!9p1vd!fBZQ2zhJ&A!}At1csl2u
zulppl@9$5Adxmvd!4O>`FEjSIJTl2f$LB_hWVGO@-l!jBv^{MB`NVUd9lVkgGBN>*
zNKz&S9-anmcu&6Y>s5DSR{Ymq(r`Z}#JqIKQ}nf)keJGtj0AX0*>Q|QgsfirK6R+b
zcT1W3`~9)CI<GMbVkqi`G1|AcpJ66|bJ-0J{Xdt4gdV#W@5~g)7-RyE$lSQ=m227<
z40v98wyPRIY3!n`$);fP{f#V)(<`+}_Hh$vKD>O%$<e`y6xnysT4iXL+TLA5WgDaG
zD#_p8Os_iwDFWueLyAhB+kh^PgWbXqnz(@dG{V0_T&;nfCj~G#q9=i=J&R!ZDf9So
zYOfEd7M-1)foyX-(F_{ez)J<Jx#R}w5ulBL`vZSG5$0k>N4JB{>|He=p@2mq>V&hi
zn3EUnALKOIuEW5_RYyH6r~u%Y1~?l0+*K$;9=%gv04vc}Fk6g;fB=1165#VW7ep#~
zd)Jc4fQuvaXux#jBMs(Z&$n;Va5c)QDUwL}1|EgrUdpD-VpFOEsz@ucWEcr#Bb3dE
z=DIO_OG8Ub@h=bu)JBAon&DOe$>JqQTtO2>gX!T14oaL5XrF9L%ML%O$k69ccPoxa
z<-PjwcqUxGBZl7cx8qhpVSAp}zPD}MQ&>}bfWkwqrf620#*b8RC0<`H-6DEJC4jF9
zxa!&b<tX4fbeova-w>z5gCWp@X8b0HO=mcROH0)D?0}n+-6ox$6Vg)A4*P8JZ@nLJ
z&aPdnR39;;mCoe)Pmf<iLlUsrw^;!(?I3ZcF?Hnx%uw2B0e?NL;8RZ^EVkx!p<4si
zBDypf7~cRYegU-}z;ZDF1)7}wRx7W>{{17Kn>BF=2rV|$__(A{0UoSB9DKi}&&O{d
z`8XA=&SMoA_^b&D)!W!^N49vV)g?1%lrR88aS<AWZNGPOe(!Z-e9|v)@(CDdRvYqC
z_TV@8%8-Z+oWS|s<5?M~K`g6%DPEHqZuJvd5n5SugZ<lBcFw}h$w_-H71easmgmHB
z<XqA*0|QtfP<n!ezv8#>w9=y(zouql(31=W=qXx?xEMBI7d!XIx_+4Q(Re<^_CMd`
zi-=5%3dKpjw6<1e#cv2hy+ZG)xa-Bfh)lcs`Q*)vn<in=8@LgWGPdL?7cVwHvrfM3
z{z9KKLyRsWD(VY-RnMIU{g+)q0G>9A<8cd*|HFP@(SAR+X;&)^<R(x{z5z=P00ywG
zUR~E@8nNYnaEAkQ)e07sz{nxIlGAaB9Yj~bu%^6aTtEUdZZxNR&G+pLr93KC+jqWa
z_<^I*5C62#P|;0bO{DNx;3HDbNB%HG6l$%3BDuc&EdLjCMf#CJUi*J|l=7ir39yY`
z-vE8(yjskS)rz9)i~K0TXa!4$j{gOL6pWUGXCEbThL%*xUv4|G$Zc-o*U;T>ZfzX|
ziT%s@dH<}DcPvl-?vd$TDfzFmA?gMh$orm&z5i9?!u)}$<1ztj#_aIcOaWBh6c9(!
zhSJI)7Vz78Qb0W!lE}^j9G9;&RWpE9SJ+6$-npau1pPykld0((hEJnrTpTt~qHz(G
z=`F|+{>zP4UECuBh810T#o_p%w53h(hkYuNrJL(gmF|g&IX$K=|D$?%+vv}_UFYyT
z-s9R~#+MQ>e`^eKS{ir$7FRU(saZ00XmbiKv?nVoaCmrGr8u#$@RIw^D8QWEh2d8g
zEA{o+3qA^OM2YF|J7^mjF**TPK5A`r*$KW1GGTror}8JqrAwCv#M~CXCs72R2S$TF
z9|WcSmxb6!u#1^c)2V+nnd1+w-0>B5YG#Nj0{8tkwvVBl`aV6~^Gu?P1v-&+d?S_t
zN(vi&{N)NU^O40(@&Mb8m@G<BQ(Q&e^E<U$>rapKZ%VZL%oOHPJ!JN_LKDg0LD$_l
zB#VInWr11+!GO#U4ie}w^9W~hANpqE<0hQkelC@nL(cQHy=waVNXUI$hCPpMgU`sq
zCg)?T?$|Vi6bS<PV)xw}B|aYFuV43wRrWc0Ox5SjQpU!lO1TyQ?+6)<9b4H<U#p*S
zvG)MA%|t3K{6w|f@sCCm)Eeecd)ekCY~H`ud0y>ZG0}~5Do^r<@>QijxQfQ8c`S8!
z^t9cInUQJ)Z-$eoF4G|Sx6f4agXypatSbaPf6-xH+;kp#1k7PbipPZbl~s>4v?i4|
z6))D|=t+UZMa13Ksm2xnJTo(l+&m7Cn%f||e9G%{<O?WV+!LNu7!@MI<>yU;*+c^^
z;@*%>eQ0WxrWLtE3n2K72!0&Pdq&3Z(B2!anoIKE0n{WMIz$WmtEF}eEogj==!Zaq
zI2OO?|N9ss*V~6Wp3O!QQ_$Z)8ajX?mpGf{5xlv{z(DzXv}i<<P#1a@t|Vm1LP{FE
ze5t#8-TgAmH$vym%){ZQ6u=!L%M0vz>|Rko<9;xTTlPn$QX+OF17qAH-4}&0`%%1x
z>X8Vhyy&2i&6ieebo|DHYs3^)ahNn}Z*qSK9&L}%i;1BJIbKIPGXOX?o|U1Q?=xM&
zz%V-8*rMqefj%GQ)}_m41J-WuKXMyyj)Dl$FhpHQ`L(`M`p?Z(i2!U!_Jr3kHmEw0
ztC^^FVr*$`MFdYE3KPdGSCkE85G0?Ji`@Fgqsc}qD|3EJ=y9(pIuTJECiL7LB~>I^
z;bD>F8zNJFK#4cIh|2z#X7T^V{^JTzyx39jpL($IZH!s19IEl@YOOXD>!0!S26L5p
zIF|7ZPgl|$5OXO=&C>P|;RwV#=*^VfYI6Tc*(m6NPY`=!tSb9?Emu|L;tr5@6abb{
z_JVUZP{grcY{`#!oQ{N$a6ZxHuq$33E^ppv?le=`3;Lq|{ASo;(_dD3hyNDw3M>IQ
z4Lkzc@>_pl^vuBE9>EoK<zEj?FB?jtnx|?TPyTH7!x>;gNG|woyCN_UMJwy-vm}1_
z$)w`~>A`})M1-XaNG-oWl{@isCm54pu|MGAvvTTz3V6MPFk>`w0bfOQts(eyWPf@l
zA2OJ=(jacrPQvhF5%y%f8)3hR7^evm-eWG$`A61nj{S^5J_eXW^uXc~q?MD;1YS)(
zOfPVs+kHtd<2Xj}7ab@*#}7?;Q~Y+aG_fotmVZt2toH>h8p@adVJ&;s|Kxf9m-$$2
zho|2T9k@=O&={US>-b<nO@P%5;_z^wNlhhSUb!+4Q?e@x(gZ&i+yjf52>X$f{Z%fD
zKB{ztrF6D6@mZ(ZksgeHl~4XTC153D`=2fSN3rtv!b6XW5Bo`_ZRxFkNN{|7$YJgd
z3&KJA_U8~AsN)crrz*=RATaa3W(MuhUx%HGx3BAW!~&bF3JR(12unvM1Kn}^btN};
zr5za6x3>}v%|<65U9ME=u)C^R>mxXG|NZ8!Fni5@$*qffl_QVs=+|G2$XstRUzO@9
z8c-ox()z6NETNzwdhPSz_er50+TWteodnmgLYhzAVpc;|R|OX0MCbbVPy8Euda}QJ
zT$~wzfRF?RHidQX!2pY;O6YpLppfCcq!qAt)xhhwQCq;#<M(OOBqen)j2sNFWbr-U
z3xV1aobzkUY(24k_wKU)%a#be{y(F2SU(}tLI3m12xj*Fvn?1Hu-S3{>mKw_$A~ld
zU*cWM|2?CMM2q~t#zb#QuJM1tt((FBJVCYbKQD`zA^miDWNgd?VC7(Y0T2_nwYSp?
z2~l8&UII>F@lrp~J@LaYx3{+g3%J$JemqUYg9B-bwzajX37APEZF$f_D!#*ZdlV5-
zZ*9kyou5zq`0<9CKxm7SVOHSAhVktuM?A6$-7+&&u$iUM@9;2!;0>(P5cd$6hkXIW
z0(wS9nLn5)pQ9})dwUMRrh)H)*;@@>s4%<|6&Mo}^OR4>mI4<8wl#Q>@eC`c5`vo^
zu$Ca}rQFCPB&u28Bz9a;68reEtklN?P5k7C>-#iWqujcwOY!$34>y-~zhKHA9A3?_
z2lio{VNg;kz4`}@e-L*Aa6|_Os3~_Ka)9k-5R`o1E!&`U&K}zoGq;9PoC=)W5I#R5
z&weW4C3`h!-s9+b6ByxQqJSI)XNi=Ac+JP6A`B$%AVy&<EG%tzfDvKK589f?5#co7
zTFR|Hg979sTtH~t$B(vxRI5b9`>2)PZUu*8#$jc6sMz;9tr5Z(jQYv0t|mtz+(_Um
zV+F0UK=~sCwWAT=Cuzbf??=8UAHqC62w8*uRL(qm(7by$c7gj2LNng(F80}8vVfZI
zWMGRl^>$N$!9Vw*yd3R@KqfQ=E^~7WhP;Z1Xi@FN2?WL~(7-RD1_lQi8fXZHt=$H~
z+u;Vo6MPJ9bhP=&?|Jh)$cUp)pJ1XYoS*H+SIy%8v(lLBUt;nEUMyTQUY&-);?$jv
zc|+@P&w{;`K*t2J6?}F6(G0<$&adsOd|EJ#g8&}34iMPOqbd~t^DfftYkWLmV6Tw#
z=@Ty0PN))4h9i>ipU8yDiHUVL`KwU71Ai2>L^`)gKMb8fGo%(z6^KfLu4_PmndF3Z
z3qu1tmxMB43@f+{A!!>pG$YJHsGOeQp=YSDjNl0cT!;c^1qGB4`vI5V>R`G6(f`Mf
zA9S~F-51^l^OsBFMeW94Al4#-IDyUuZ;A!ntC!sk+MLJ7=LFOFd3hMnbZ!O5?YOu&
zgymek>LlI)f8}zR75%ZijEE8|wA1Glpl}3wQd~m9l~kpb{f6H%RD=5khUeJ89lLt<
zDg;|tH>`K>9-sccFi5_zw}81@YXkJ_JlE!qn{Apw(hcQ7p%{?hII`Y>ucC!T{=w(s
zIf7`Kg-O0nW>tJQ#9B<Aq-n?U(|iTF|5sUa(6TKr-!F!_3@~pC?ZAT-%%JjAvtmH<
z3#7Q3Ep0<Xf<(p8^`U%(FAMrSfRzv~fkAONSY?2b9<$wDtV?B|KO=B6VtPP9K>?Q6
zBtWp^^w`!bmcfGd1tMJr0x@tBj6s<MBO+vAzrt(Y>C(E_Q3DHzo}PZ3mI!v`3&ai)
z^(XSp3mMu^TASHCEfH<UhTyjJZ*>jyFxY)xploO`_xgQ$fw|2%D)ksFpFlJNBo@LO
zH`vjOFe>eU&jSP&a(Hm?@yIQON?JLM-%HdVNMOL#LJ|v*S|N`d+SO|t8+)7kzsx`r
z39g)>!=;7|-WBC4x3M>(o5swt#}JQ7m`V*SO8DBq_kuse_nQu)SRC$v#rL1u9Xxeh
zaIlwu{Fn#RK!k~}qGC?R*cM_lmThexR#}J_OC^f6e7fT^-8VZGxfO=7c5$})(4HPL
z!(UcYlkh|GPA)tvjpzLE5>fkn-@ktEMMcx;u}NorLW{YGd&pCS=-uV(YHPt0XxoX_
zDeooR6swI<#Az0$x54<wgbfEkn(t5DeOz`0o&yA5h_qmtWoc`hkXb7MJU07PE^=Hz
zW`V}z1G;duP-*!63=IBIYqXS%q<<2+m*M9TOI{QT4C+zC)_lX(hb3j)u&rR2+Cw!p
zx;rj3e?XZNBNa>E_!qQU^KH+Gf$OTqN&^2yOijW25AIH`<e=JY)4uq-ckkfi0Xu_m
zFAaIlKO=S2OIlLFg9@lJuEH6-G7mr(0C30jY~+l+0<e0&efyT%2WIl&D)~5yboX&d
zk(ru<+^bP^h82ou4IKGOsn-S$ZJ<9r2Oc9~O3cCV8{S@5mlAr>Qx<GR#9nOK?D1V-
zc@+wxL&v-%F3Fj}pv1Wod^Yt*rLJIq0mAr0njn`E{u@f}BDLN=G6RZm(BurApY*>}
z&cxOC79JHpAp8`BvU`#?<-YPD`RUnjlk{3&p(};C&x4K)7HoR1@Sv()rD29I>>G0z
zXJ?qCc&X|qKsRtMJW%*U5b*mlK-47I=&%M6v!~wQIYa9ZG#B}m<iL_%bp})g55m>9
zc*)4f>f9isCVt0{SvRmM37k&_C#TYG-cJy~2T#DV_z9sg9hc58FsZ06?C$SRHW0Dk
z!(Bed2?`t>R42K9y+--Q=GlY;NXX6f!OW|}ojp+z*pO3Z6A+g~?Kjt}W#}>F(&s)y
z;$%Lzt69)Cx4DPR^^qJa&ZlR51Lh!?P=N8QR3fHXl;yo(>%#Hu1~%UQy9W`q=kBcL
zJt)-rEzSJ!yS;glWT4p;sDeZr8?&Xt=KbbY$OhnlS!mfy`~5SOc8#uAQ7^sb{N9d9
zzE<<xxjy?<gHxu*oID01UY%=pMwYC$mKMXEJ9wbxGXFfWoV73BN8JJ@)g7onn7h-m
zbb{mxFJ55ZdSG-DoKFFBsE1y*{brjH3ksQxRNMjGZ3u-x#M~E*0@s9pW?fa-BzJR$
z<kbHK3J=V}0<V`^zdo3A^Nj=oC(UKf%&=^*MDY;~fY#p>7s#I1++G+4{G9mQvHbbE
z&|myZS6~0G<v5=K4=MtPw&MAxha?){`lvo&1-wuD&2|*#XKrbSj)~8mk<p3%{>Lro
zZPQNS9e0)EXJS%Bwk6eF4=nlPA|fnxtZn&Cd(v;6pUw8x>Yq3{*-w@2-(!r1Rb!__
zg1Qcn$a+Op-=-Q+YHlUYJvv99Pg@sgFZW0NqtW%eEq?XDgTKK|DcB4=5s+``nHdyx
z>BG1sFik<+_Jse+uii)Jpo%SC-PO=>W8E?QWK-s`V{pr)c>)|2-u3GeUb$6W24yhN
zPoV`>UQuBL4xWRhn3Z?n+W~79G9<)$1a_KU*dN^d?cjWRvA!Jvcqri5qh5H;AxpW0
ziJ5s3Od{;N@h~onpZ$`_Iz@(418WtA>^a%Efb$El2!5#6@Q<#+_-B8LICRj_tYGX!
z8=B$kl{D3ljiAtfsURQYjZEkZQ>=E!3*Frvv^j_2pm4XErQK<6UHNx)v_AgyDC9PI
zTi;m_x>Dto`+vCrIG_@m9~19GBUD8T`VNe312Bt1tO-R#rk40YYX)Bfej}u2@&v-m
zxX<cia~cD<SOHO_P*X507(uKlkYTZqF<LuC9MY$EEjten4}+l(3KCQZ+>kuRh1uhF
zKvqTsgs72E<ZB=-9o&RjD^a?ft*JBi9pC|jOoT#6y@*-dRSf)u_;^Nr7RdTuT@YXe
zq27KcPYC+J>noi9M{+U#qb7}YGw07FNR|?XndH3hj56tn+9W;szZyI5a4!G%@4ux|
zDA^;U6s2KTwn8LIO4%VYDk~#<Br8f<lB}#0Nyx~|EZHInA=!KH-}9>P?|1)k-}iC+
zK8NFTl%s>|eZ8;u`8v<%d7h6aMQEfF+qV39N^4`&XUgvG1v3)6cN=}Jc_pYNeK(Zb
zgCC6pG#>maJ*&e6!aj6?8D7^bu2#Yt(BQO=(JdgG_)ic!uwYSzWMm=PAreg71JaUz
zDq&1|;K{YBQq{8E(#V!B%UbtqpIJ%1NT&)6R>FB=tN;fTTpcH_I|YcX3e|JnpljDN
zFc^0jp!L0!8X~Hc*g;3z;B>CvIAE(}i0BWzGaePHrWLN^1^Wu-G~Vpea+5BY>jOGq
z_uvH4E5dJ)8Qx1;_1%LorcvD7{*@0t+HB_~{ifC;A|l9Zb<lo7_Nj$L84YoA7-Yb>
z8*3v3$B{FMF{|wcQeb?M2(lsY$VDPHFM!@BBnSeOkxLj^%(xU}hG@mx?S)w&F^3Ho
zPwyI2Dly$t3Fl)mUb)?0{u=QhYV3MkaUYMMSm8>e@$)^!nYsv0o(N8Wl%%)r<{go0
zH18?UbYi0qXT4&3I!5+jX_H`J_szE@-Ij_J{j&%|2}}@6+ug@7_T;m6r}MA9-svMk
zZnoP=NI~l?-M`d4mPt3gEzr|1(mXG~wD1$V*D<4xYx<JeDnK>ilhUa1)@yhsqqZF&
z9t{nR7}x|zWdBWnS!Y&iVL*Y<Y!K<%F9+^kRw=*OP)L}82P^Ovy@!O>aJSAgg&@Je
zrbdIgNq3#ltAZp7ul^+Us79;dk9qM!?I`BDi*HVUtZf&3=pCs9Yw%1O^>>q<2c>+a
zo*8AgPl7^EHjuW8Nx(H)@sMfy)onYEI*q#N9AYB4fPc#~)dLz9!r}RwPoNUQeBN&%
zyOP{OxftS)^E*iWSDr*kOd)%190oxuZQLNP;S@(7K2zycpsvk^r(@4w&s3S#{{;0<
z#jg(uHdSUmlFqB<boB;Gaac=abEGr(!V)UX3KqWQGE;ePcyR4Wu&B@*bFo=nOm8Q&
zLg})N7z?ZLYYM}p?-l8vKb=p1>~Na;Js=t!5U~GLS#9r&k7GA=`;(`0rbo0LIW5X2
zh?gk(3~QKzo@;KXmQY9%&P;obiUeS22|KM`YiH*G4f-j}hfIaY_Aq~|QvJdJ<7mg<
ze9N<kDY^)Z7e?N5{Cd8%`)k(-a8uNPS;8S}F{@yDncNF(yu1|6{S4;~UnV4Mf(xPT
zXDiIMBSruS!XLR9oA24LibgeEwihTq$aUZ(XCtnuq7qbDw{O+dh_heYl++rlTpL{q
z`^5OxHM)&tXz36MW!JK}nGN-&HzqkRWTz7`_v+yI(Y?M+RpDl?9@~49ES-Y0xhk<o
ztbd564VPu=PFA-dLrl)@+TQm2b6n$5<Rylu=0e{JIC4gkb0qN_%spFEW1vPTQ9D6n
zO8u2^Ud1KhVo{6Y3zuxyU;D)LC8!F1P~KUqc8IV`eap8QBhicuh&Nr!I+ddx`2nvI
zC`iK6^#K-%k>T$F<O4&R{Mzi4zMptb5&1OoCoD2v0dR;=U9f-q>r!=zvsTdQgxmiX
zimtb8Ik6-Dkgqp~lR?jmyZZu5x4f`ydw=qa4#F;csi`1Lcq?%_Z$!39c&s8ntCo>>
zUPq_-suN1Btwgbbd6PjsP^)YtnMqRXE7MlhW#Q(qZy0|6v&ofVBN>;+!fs4iZJ-Rs
z0HGNBeJ>g7e%4!n32S7?{~mW3taAhaA<yv)FM(`A&X1uf7_VCZhp(lxkAGf~`Y6xd
zy*2@#S$OW#j17%CXurK?Rq-UPa098VV?{3YL)*KtSbxQAZ&6<Nsm~UqVuQ7td&>^T
z+B9{n))Yk4w6K4ATCebsh2tJ^Zu!>9-qN;u*JkrBj+`X8Y${mlHb^Ht{xJmMUFh$7
zLS-5d>0le+eQIPy@#IOP?oYnN%|ppKVGT$v4yzI*LP!PkWwrs1hD{pB&o=n~Q;GX*
z_Y{Y!$W|l8`)6yhB?MPleTn`a(HNXN#n|zbW~yx-w8vz67{eCQl4M##L&N2H45Bp(
zZbS&h>Rk^e^f@wjC1Sn_+@To{70f=JPj)l44~TY0)>A!&f0Ji_jh>#~7CyXu@}-L+
z|H^}z1y`0Y%bLj=Vr~oXn#thW1esuAp*I9?Tlb`1&m>ACDzI!(Q==Nh-o4YIwQvCN
z2sCNJ`4U4xe8{+g`of{WNzN06qzxM!Do1powV*Lnm&c7d58EKbM_(H_M+h|tSF45m
z<hdU6<6Q#oiWoN}`kz5TrNBe$ZIH%a_>V|$epuayX}Drw^z*IcV-ubUkq<p)Fh{jy
zdEKYP)aP|BYmjNJg7MkyjbphK?R8PUV|AX2P31vVTc<Qy7-XR9Ob)%VoBTvY3$KH<
zBG-a~?fDaO8!tQU-f;0^o0wgq$Ah?fh2|gEj$gcZl=$w>W4y}M*RP!hr<NAH#9XIU
zhr05zz}qK|It#z%bZ6jNAGJPLxGppFF)zl#@}#R8&DlfxcYDS?n8z>YkbG+V-qY_p
zH}%UW)=K!EG4V9eLRrnB9a6jlhvf52$~SJLbcr|wMCzfyZ++xxyL=p`EEbL*^}o<5
ztE$epnxBjr=NhPMq4if@SQZahUa;fr@4C8coJY_3V`5p|jdyj$R@r+{XY1?hpNNj_
z$EmXb-b+Y`%u?0W#kLHy$*&@HIajSf_V)Z#=Q*=SV|sJ>9+dyd-?gvUXI9hm*-E9~
zzSyaMV|hwN@0r9m%K=Sn7A!5%L7!&VVFa=Cac^1RdI_;&_1+Dj+xlxCC%<X#7NAh1
zuV0*Yg*UN!{$#~Y{_0!fo%h<$z9@dJ>!iQL?U7WjsF=q<o;5RbJjbzSRPw=6>e_Gm
z{Hcl3fc23K$bLV66|@fIzDeB7EO1%jx0eLZBi=Kx59PA@SmV(14U1~j)cV2U$=XWr
zRo{8uYj?eSh0YH7y<ye<&7mA$mRV18JU%|hIy5e<=j@uc=3xrEasaI<KWmgSupm%g
zE)rZk3AlQ%Z}zxoOI1umg=^ZxCqbcxjiCP#+*$}rzIlBA1X1~;Mj|2syaZetUSNCv
zX_uhc0bX~tTkWq@N_ibZ={;kNXIfRmI)?N1(|_=*O*H=D_<m2Y#LMT;pKrZraObZi
zRk6>M_~*#d@B#M*=IziSlZJmkiH#Y8DjVQvtZ+1b74c7$Wzb;%3xp)D=YJv3-c=#1
zM^N{D&7r_R_&D42R%{Cyh6RBwIA=MlhbKR*fF}|V5L}k~>J{yEfis5;^mA|PTIH6H
z>MWy$Fj3AN{cFj=qwXG)f#*R#<3C@Q;l36qP`L2v>LPFz6Z1vUn*_xN`uDQw3Gk{#
zjm%~D15i_}Nh<1hV@WPzq%Zk>P;;W8)u2}*O@LB9{iZl9JBT%s_im_dQDG52Ivr1G
z7;Jn07=%E~?~V26WGneY*Wg5u0kJ3B%GuhHV@r<ht0TlOXr1z0n~u(LZ`>>O;(_3m
z(S*RhN9)V7_U=o3#1rxUEwMK(d~<W+8M}4v_)y#7)a)LtH=mHT($qW%t~gpsxOA}6
zb})y*%J!<Dk78GUw85vo>VE09(Qr;i--YFI8ujXm!q6pMAzHWQ2JhrsUH4q$;^aFR
zUV3rJy0hT{oLX>~c~`fKU)FOizgn0Nin*vBVqNKc(YiZfsm5PT?C_gKId5hPD!;lI
zy*9IN#jS}~Bh5hec}=|SjrLgi9GgB$NLNGe^O2CcyKl|ukJ=~KEKK?I-p)RFm3Z2$
zd)0O$Z^kl5@0&ES+fNm{{_oGx+soyzD><putIef!^|b>vTT)J}G$+SeQK}b@xr_+u
z<vY<rJLIq4cjoyW_={!#dY5#F-=mlQpYH#^QSv_-{>O`e_J7wTpvJt%t}Sw}B4}am
zj-W&1?D?@nCS~=X-FkrHC(9Cvb8v0}$#={F0eo}wwX7NVT~%TbW!zyIp-4WdY112L
z85Ftf682jNzhL-V<D<0QS59c8mkqRT2pw9L#Nr*akJZjjtL$FbzY@Y7v0DN@vCMo)
zKy*2<5&*%|O{^&>Fz9r2Fo}xh`@Q6rM@z(LsF)03#3m@F^n{*I>&%#Gs0cL)qc#Lu
zfRL*UAW7jE0-CUT4mv7Y2#_#wAjf7(VMS3fuEBCS6jo1YZU<w50i5~Gv)>~lBXRzb
zmbx@ikY!ro5olZlxB@J7iWu1lIqJQnVmylE5@tYeN=Qm#tCid;4Tr9sod}F`;-~3p
z)t%n8eKogmrmDO@NXyDfKlJC^v%$giQd7zM^8QDEHL0cU-yg8efe^*rD0Kwo<24SX
zV^lvmt`Go?Xz#61<shCXHx*fR<f&7ckXBDH0?&ipG0gqo0zt!r(q4i))A9Zw!ccsj
zdEb{OR^hwIedN~YGWO57xEC*@osYi2_tClCo8+NN%oO0{`}0*<UiB-xYQ#~==9*YR
zV_^%d$7*u(Tao>qVgM1Z`P?zQ!BqlCEJ?-WG*W`U5BWDxn*>)lSAY4kfsL0Nq}cBu
zb#2Ksx4D@swYQ&#`(^PeS_kp1M<W1IJ9;NI*5=WZ1jS1&$4ZsoynZkLoekk?J)JbL
zrMkL$=Tsr~jZVUpdWWw3zfjDurnpzcXK9m8zTGb57DQL|#Et*7v(y);-WdA*kGj4w
z#?$Zd%#3}sNC;tLoSVyv)EonO$H523`)iQ#BtXQK&^i$A2{#*Z%Cpq_9+1t@xYPO<
ziPfDa_@D9d@w*W2!Kh3#hFd)Wf`BIvO1TPpH7V~GFS;-CF>fS;9nSd(fNcO)t1>#E
zaAMcYoE#IY`0rU<vvFkFxUffEgL#j;rW0j^At7u+mw|u@wSx4qgYd$Y2i+CY4dhqO
zd2z_$ozDFnXbGVc0kJL?nK!b62^*$XcM7J4=HXdnT@&woNZxco-j_5qPFaHVOwbLm
zVQeV45am&KK}fyevTRDYF_c8yd_SadS71XA-I^Fpz!$_+q+Z39dtZ7y=a96SovyPT
z`YEo8Jv~v4i)1AGtSm9GnoPTHaglz_`cR~&=dir)tCnxmLv7*3!nRZW)^zvp&vyMb
zCYT~M`|6dOx=qq!SyuseAU#O1`gE<07Uv5oA{FU-n3|j_mfub=GL?Wce9)n=Ty-O)
z+QR}^eY|`*N=4DD#1JxhCDPS|KFm8hfnT;`=df#DItof`g7sj79HlM<Jfe*NCwDZ~
zm5w|!f|z^!j@X5*5GLB-FoOVq{geVza}YbbA@}1B3E}`HtkKcw!2o)(iEwOAj#Is1
z)p5+ILuH1|D8KguU|=6VevE8%^W!6O3SENPS=~eZ(eg<RF`YLQ$5aGPXzB*NRSDY_
z6nw{M+B9rbB~xc_Wu<)RL%Nqt2&Ri_1Eb}IrT#|wi|$Ob-;Eb+FEUPv2-{$ZWB|46
zzF(gqA>TA`*=j3dCb#Otb?1GX=-J7_gZcNI$m)p~XlAy&GT-gbwIt;ymSVE2|Naba
zgnkQh73ZHy{9$o9Ip6yiF%jttd2?_9_vbGT7Ow|p3DL_GkJ2{8Tu7Qzi^f8}P+B_y
zlSxfY#R!|XT&&mmWCctTfbmQsAzg-KF+PV~>;DMASM9~jDhY<@xG`PBF~^m;Y_0GP
z*$A)tcB+{5AQ8t3>g=83lcs68sh0LTmBCX`IKoRW{HM<UkT9L+$3<zgm5%Xqt<4)F
z6?-3k5m;`?CXvqUQ}c^Y6<z!H`UHFNvIv2y&J%TqOvvO<yE^o3$Oz7At0khKG=CSS
zA$2GI`U-Ve&AX%^TxDNHH>&Y^P<c;AK?z6<{#d&XO9}Qyn9P5xi#CgH{R!Sjxf^#9
zT)(1r_`8xrCBnN1a6`5yq#zO?DnrvEyxevCE92{@8`kEE))+|-W(VR*&svCz9+k^5
zRw`buaUbH-y79p%GNPhz%&Pi9;%~QA2Ob?=^6Ig;$>gkWUgQ*hM;Q$Fx2ij2QJU2@
zQ)H@Lc(nc7x3SWP7WP@|vuRbjIXg%;e|kg6NLy`f7eF4_A90et`BcZPh5?pIBVIH*
z*fYPIUbsMyva@v-;lr{D89iDom*+qKHMF?%*+dTXYY)&(PL;|le*9Bz14D=Z7EnuL
zSPvIMv$I(E0<C?eQ|+r09`m%vtUWh|nv;>oZm3_Eydrdtd%aCS|5IZn=OYgpm+AF|
zr6bp+tUQ<gbk*d9i@0-YvPYyqz|A?cj0wq5ZLCteNYnN9l6OWEubZmVEn^D|8qXFl
zGcgUNTej29%<7+1+$<SLfARVove8k8{fC-q3ezdPFDrffc0e_P$v-~6c&uMoSmV{(
zOCVr8*?-{54*thw<B$GC%*VWmcG@t-D)RHg^&(c)Xz8kX_J(u8&F;+iqG;>BZaE48
z<;m$yIF<7ArPA85zh@y92#=M2t-VqSUE~Z1g9OtUOQbN}ER~32v4<)!>B{x!^G4Du
z3_XKBS?5_AS>tQ|GE_1_l(L|}9FwT@jD1G}Y~r&Rh1AtgEzM;Ya5nvH@oPM+JCV`Y
zxcg%F*<h@<uP+IhFfpqPhKYKhLBFtAClVU5eBfmqIgN~3I5(zYi+u9(G>tMAWlcgW
zXd-HYv%C1q-(Qt2eaz?0%s{c><9$`$!~6zgEH@`o-kqcH@7<uvJNjTQsoReK51%7v
zQ$aJAn4_K3=a-AqN`*$E-N9ve;cwq<HAM`^r`#A|W^`iFq1u_5k<v7%XZj5p1Lk*U
z!yAN{K)=LM27dA$yjk%0ebvTuWtEznP4a7!8aatcY9Xd_mqI}sHG04cbF1^qU!U!7
z&ttrLP}9Y&r!S4&cLNot+m4~pc7Hc&HdI503zs{}146jm@@`tcjOzo<L3pISe^Hs~
zo^@8%Rs8k+?oFjH7VS7@XTJYE&i9$EJ|IW0#Lby!J9~Xh(mppXn|l;K4xGN7msvdL
zCCd~bOXNH6Hs5__Z%N+x%LXEvW8@qi1=4XaL66Hbqw|Mg8-HjcsWEtGH&!}9M`wg=
zi53KheO2u_sfl88vhm(Gf_${wqMx}$boW^_yB?!jmq=3DZeo6;tTNi|wp>z?r~Is*
z75~igyojVRJCOjHG;$vvZ8LJ9Cfju+Ye%%lwQV_mWWL!gm&oDiXB?l%w7Jj8M_*~%
zwg_70Y*L2lHi2monakd;<7bXvXnJeJ;qO-&T^pC<Ax7rR?YXhHFi5fM8I5T`h8bEu
zDZ1IU<Et;s1|C%R!I6fLOd#r$$9O(d5OZ4W3quD}x|Wmf5W2`7)(8Ki;I>QDS;;AQ
zvmToLfVYB{o{@)9o!-SYVW+G*92V-WHat;zN*YL$Q|m1a7xBlKv<OBH)a^6bX`~<f
zK7D%3r(T$n86T~HAYH+c6l$FN4WA!nojO&;;yAI5#OZE-<UW_D`}fM&*qtfUTDR<u
zmiFJYOStM+Q4wm*a^_S?4sQRkKR&EzhM^@v+A#Fh^?5nL{)evtX%~lG3jKABjgk*Q
z55TJJl`B``<zm)$h?pP@)pbiiQ&E$eEPL0kEK0lWsmn0mxAe{%PhZ;v1s5%IoZrl<
z$cw~9Q<v(hv$&|F<M9k*|JIS96eX^cks--3eEBbA^!*2$iloge-yue}8fbnpX?&Td
z<2z<mC*s1h*W{NEP4J!u4YoL$h2kx_Kd0{%y-KRQPfj8F>g||7VOx{262gkRdsI^H
zydy{34bz!93Bl`6mxJvJYg?OtFJ9)6k>P;k(&Dmpw?U+mn!M@=d<wg|OXGehK4-b@
z&~-A-TH!XU=3Bk3Khj^2(~<ihZEjsYYc`vCnLTm0sd?}w3><KVNfyl~Ml@K2c35$>
z+~7rOM)E?k<+TBAEFS(eip`>E%;RiSQc}{YVUrhqO8wO3piGTUpT@@Ax5>&bI;0uq
zwT)gg{#<h|Q7##*lPY0y1Eao$`Rt6>TancT_S8g3TSY&7Kx*PzXIa?!QfP2QoBmI2
z%}ib)27yxNXfv~0joRKv?>?w<FEjHAVvY3p9!KFe@fR#*U3PA6d99W@y4##avlavH
z-#=*-yB#EQZqesjBc1xcW+f(xJ5zJ4u3!35l}TeyR_h<*mJ|~PrlE6MuSy4-95~6@
zdd@LU=7{EP9+tY><r8$_Lc++WYmYwjsQB#Hx^3HaGM0A6(67VlRyc?8yC0NS{JaKI
zvpa8UM?ZeNx1hyb6tf2CqCi0W+pA$rLtlahO+uB!!AK3VN2qNVlri&PeY4-|Q?dJs
zHWvh2y$!UL`BH<Au^+T760Qm{8$SWbs?*Y7Qo7UR6^qCmy}e_%fbR>5E_sty2v8Db
zHlH<F>#q7@_r9Crj-yMa!505Vy_JG>Ddr#{_c9xbP7UImz{7aZqv5Vv#!!tZvdFON
zZAMt^TaxleW|=EcaHp?pnX_4T!P{QdKqM+)SnHVa$k5o>`dg^8PBk$kLGx~T+o$v~
zo<CG=SxO%B3A+vJHgHD24r1l(jLK>H-rBmaxLb^dv@mSoZe}z)W51}^)nQpO*0Bj)
z&0Nvxsub-&EdH&r$#mYP>wFtm9VY1>RfpS;dNIm5kuo{C>u38<XETlC{jm)~TK(#C
zsn%o*rcCt92`c6i&UE5?&Pm?i&oZyiz?Qvf_&7v$nDrFHN>A_Ubx}5WX6yj;;O5|s
z_EAUdZOS^fUruW!SoX+iF@XWPy!f?i*WzP$fQE%u@<O?Q2TBWebYd|^jrIlc1MZzQ
z9waQOfde|E`vH4jpNa8ojDZJX$yeDjy?vBGkf7liVfzTbOio=r^s(<R%YtcDK5sWg
z*e=+!{<$K`Mv#;UD`Ff*xA<)Gz<@xK{i)lg*j%&+J_$%KeK5M*cH`-7V!;Fw{Hsi?
zN+}U-^yZcpZeowz>wswuuBbls*{h^FIW$d?qHATEhcYbSksu^l&$WI}6vp_er{pi8
zE=LncF{O~AL80E!j?>P%_b64y`*Vvey5ARTB?BVF=_8p1<RoJf&-IrFk$yQWy*nbi
z%18QDo)qneY&59G@6U&$qLEU8hZ7QH+UK)7J9nR%KE0<GZw>YU?ou)9CAD?tq^}!c
zQ^Vqvvi9ASLm0*x32;$q^PJZ|;^N9tRo4~3cfkY|Hu`~|xYpinQ<Gh#ik83dU7T6~
z0>Mbvy0C<#tb+CUv3XuDH^VXtE*2EwJ~=s?v~s63`Ll#vT$X&OGE8}LIp|4q<DRS}
z%*hJm9g=lzxg&1ZxS6B#H|N&@;`eiAGx|UM>1w^<;lrEth<9pg%sM(tTn`cwUAWFJ
z&lefYwryu)z2Z`sT^q;Ev&kYb@Vo24j+bM3R1Rm(d>1a`s|egoAH2*@c`s&@2m|HG
z<06)*1F;fX^a1`&L}Fil1-KWx@P`*uFYSRP#WkN-v9TvyETKqz`{s*8IGY3@7|fY`
z>x#<^hgTT~%r+9Xd?2;e#Rt>%uVP6Y0vtKKOrAX(pgWGE4@oJ$P+^_-I|;qHwasv4
z@sI*BN;0k>HFxT3rkp74>g#-VIqS66fFidF>hIe*@06R8lPvDrtBuXs^qQr&8IF!9
z$my|f=aAh_BHq$LK0cWc9y%9S+7~xH8K~7{#An9$S#x}OwC_4GHFk#gaH49c5dvHO
z%=tL3$a9X{OF!c?xc{&vi<`VaqH1otrS`4tlaxAQ6vxYA_Z0da3(VJ7ih5gw?GG~2
zl`EVN{2qUO{v^1P)77><T+OM#&+ppe&5@Wokf}CXD=VDPh);??-kmVLg|x5JNuEtO
zSwO&Smye>V;P^*#`%Q<R2{l3iXsw+xj5N>H<E*!TYaE(AKfwNdvLf2j@7mswGotFB
z&AzgTYN7O-ai(WEX2<KbR$N{@T4uyO-CxVm$Sj;xMTOEP9sTr#y*#<C#}JEtb-L0&
z2#uw5`V%lPkQ0*`T5)u8{%41!?M`8C)3vHTnvZ(2UCjj(m(7fSO`dE@tf^?rh%&oC
zmm!7`%`m^rh3h{u+sG`{N`$`OdR7%}8Q^#DZ%{GzI10ZQO1+VS`3<By0);lZ`(!$v
zyLY*B&Zi!WkZvj8fjdp#=e#2B%RFh3o4tE?XsA%mbZs&xIV&FUkXf-Z<4wjtRN0ox
zyq={Qog^Q=sFk`}{<XK4(cJRLuVS)$?J@{^7EL|*QEES1ba$m@eUqkt)_RaueZd$*
zzvk?87kH%4?0m|?6@ql2{Nq^%M}@o}I{Ezx`)wn>4P|NV^o2=JqhWTov)=qd?^Wn!
z<*Dah)tFYStqQnqy_va3SlF~a(}RtxtSdvyzQsY`lVe-I3qxw^W{ZKXB%GMLk7U(b
z8d$f6YIT)g*md|w76~uG+}gA5sxvX+d+kYO?A{*RmCtm$xnHL9-S7isGj!b~G*oMH
zeEojnqkYobc@{4^i$`606RNLscjaUdG?<rzzm=uJBB)05aBMOq!UG;h_<hA`3x<{9
zqPKEq&IDFEu(BS|EBqOls>|Gq;d<JorHz2aTKx1}m&%rV!2Ko*<sH>RyzA{}!YBPa
z7sD9e=|t$=t=_O2E(@OEwoZ?a3{8pU-BW#MaXes*(J?kL@wX|*(^p<^VW`NCU4vrN
z>yA5Hgs<MEKJe|tfV~PCX}&8u7<dN!TJOwEGwJOK@7tcUy6xenv?FG%?_F4AW!>-8
z$GC;llq<CEnK!+4K3P!B=GbiJbP>~qlxTI&j4ig^HQ}NAS9o~($o7|ni_BU@79hf*
zTvN`FQw`^~8-6D-j9KNml&!eRnl0JSD<1y-?S>4)t5Bxo@WO-VuNBUphb8ghQ)do8
z-oUJ^?2OPjC3a*O>FCO0bwi6|eQy>ESK9HbeP-uF8=9LpM0<k?;Dh5*+{YR%h~QGy
zfPf0VzK1-g0)pi4eYR_mit(%p<mS0r|1zq*%VTG`nsj+jbnhu-zClckaS45AqT9<V
z4{mmM>1d8GB|>GiSJT3i=da5O=6PeXzS&I}ePLkj>1E_+W$8K6_t~&j-O*8;U(b9}
ztXY8pSK^lc$?U-=Q;}YP#T_G#5(6_-K5%L5{ci0sMgQ15i<8P_sT!5vbVtX2g93?w
z!*S_`ZNi7a``SZv?y4#WhUq7uUSehTv`k-=SCs46u~*4_liFLFxz_ZQ8X9g&Et+gX
zO>C~!|2nPfP9>K>?+$wImx7g$!W+aAPbr@$|B<Doepx1d6@^jC;-K1OMD)rXZPwlg
zTGv77xU?--WNFwS?YPI9VwzgJg<DXF=C9BD4o={EEG@Px1^3^-ZzevKg5jC+5+R@C
z%Q3D^9`)%7?j$EMh+iQ-OXJ~%XE)~ct1V7lFl}6@QS<ne`>is4!D*AmYad9d%Eil^
zVlgH8&Wj@~XKl2#uYHXO3mF=U)hDX-^+_&8JXV9YUoINdzDTa@tB%zApjv$hvYoBh
zrsIJDyrgeaeeyrjVqYJqIvkt6U*<Ad){;W;vh<?KFEU}aXg~UT${7hds^-mLlleR7
z<C<vEsQQ1j4NjNAt;C8{jKPU?!;;(Qvi$=pa$siEJ)BlFmoo;LE(c34Rz<6G#ZT3q
zi~eocaG}k!c`5BeSl{{r#oD6UF7DfL2bHRkp58_GhGI3RHO(^+`y3qjef-r$D^n_P
zzUMe0%M~h%uIT-M0MESD(Oi#Ji8bd{3Eqy1BI(ZH=B~SezlPy^0?%(Ms{-G;B)%0l
z=TWw?oYGa-k7;Q%*sz_<S&0jgxv9;&NrV)WnrgZ6xw1kpM6Hc4)^6;ebuKGnRQOG^
zmb#1EGl6>lsd2jh-e=%u8-Dgb@YVlc*KN@=!$`AS#^TU^68=*@c~;@AoZ;>N0$~t@
AO#lD@

literal 0
HcmV?d00001

diff --git a/categories/index.html b/categories/index.html
index a908fed93..00ea575c6 100644
--- a/categories/index.html
+++ b/categories/index.html
@@ -196,7 +196,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -293,13 +293,13 @@ <h1 class="post-title" itemprop="name headline">categories
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\345\273\272\347\253\231\347\273\217\351\252\214/index.html" "b/categories/\345\273\272\347\253\231\347\273\217\351\252\214/index.html"
index 47b823720..601080de6 100644
--- "a/categories/\345\273\272\347\253\231\347\273\217\351\252\214/index.html"
+++ "b/categories/\345\273\272\347\253\231\347\273\217\351\252\214/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">建站经验
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\346\270\270\346\210\217\346\235\202\350\260\210/black-souls/index.html" "b/categories/\346\270\270\346\210\217\346\235\202\350\260\210/black-souls/index.html"
index 27bbaef50..21841d62e 100644
--- "a/categories/\346\270\270\346\210\217\346\235\202\350\260\210/black-souls/index.html"
+++ "b/categories/\346\270\270\346\210\217\346\235\202\350\260\210/black-souls/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -338,13 +338,13 @@ <h1 class="collection-header">black souls
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\346\270\270\346\210\217\346\235\202\350\260\210/index.html" "b/categories/\346\270\270\346\210\217\346\235\202\350\260\210/index.html"
index 993ff2c56..6396c12c9 100644
--- "a/categories/\346\270\270\346\210\217\346\235\202\350\260\210/index.html"
+++ "b/categories/\346\270\270\346\210\217\346\235\202\350\260\210/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -478,13 +478,13 @@ <h1 class="collection-header">游戏杂谈
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\346\270\270\346\210\217\346\235\202\350\260\210/wrpg/index.html" "b/categories/\346\270\270\346\210\217\346\235\202\350\260\210/wrpg/index.html"
index b11202cf3..526dc3746 100644
--- "a/categories/\346\270\270\346\210\217\346\235\202\350\260\210/wrpg/index.html"
+++ "b/categories/\346\270\270\346\210\217\346\235\202\350\260\210/wrpg/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -318,13 +318,13 @@ <h1 class="collection-header">wrpg
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\346\270\270\346\210\217\346\235\202\350\260\210/\345\205\266\344\273\226\346\270\270\346\210\217/index.html" "b/categories/\346\270\270\346\210\217\346\235\202\350\260\210/\345\205\266\344\273\226\346\270\270\346\210\217/index.html"
index 58722013c..7695e47d5 100644
--- "a/categories/\346\270\270\346\210\217\346\235\202\350\260\210/\345\205\266\344\273\226\346\270\270\346\210\217/index.html"
+++ "b/categories/\346\270\270\346\210\217\346\235\202\350\260\210/\345\205\266\344\273\226\346\270\270\346\210\217/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -318,13 +318,13 @@ <h1 class="collection-header">其他游戏
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\346\270\270\346\210\217\346\235\202\350\260\210/\347\213\254\347\253\213\346\270\270\346\210\217/index.html" "b/categories/\346\270\270\346\210\217\346\235\202\350\260\210/\347\213\254\347\253\213\346\270\270\346\210\217/index.html"
index 4c69af8df..a06e457e1 100644
--- "a/categories/\346\270\270\346\210\217\346\235\202\350\260\210/\347\213\254\347\253\213\346\270\270\346\210\217/index.html"
+++ "b/categories/\346\270\270\346\210\217\346\235\202\350\260\210/\347\213\254\347\253\213\346\270\270\346\210\217/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -338,13 +338,13 @@ <h1 class="collection-header">独立游戏
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\347\247\230\345\257\206/index.html" "b/categories/\347\247\230\345\257\206/index.html"
index f0cb1b6e3..a72c6069a 100644
--- "a/categories/\347\247\230\345\257\206/index.html"
+++ "b/categories/\347\247\230\345\257\206/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">秘密
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/index.html" "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/index.html"
index 9e84e784a..583bff32c 100644
--- "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/index.html"
+++ "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -265,7 +265,7 @@ <h1 class="collection-header">课程笔记
 
       <div class="post-title">
         <a class="post-title-link" href="/2023/10/15/houses/" itemprop="url">
-          <span itemprop="name">基于伯克利ds100的数据分析项目</span>
+          <span itemprop="name">基于伯克利ds100的数据分析项目(待续)</span>
         </a>
       </div>
 
@@ -481,13 +481,13 @@ <h1 class="collection-header">课程笔记
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/page/2/index.html" "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/page/2/index.html"
index 97a68ba12..a33536da0 100644
--- "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/page/2/index.html"
+++ "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/page/2/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -401,13 +401,13 @@ <h1 class="collection-header">课程笔记
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\345\205\266\344\273\226/index.html" "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\345\205\266\344\273\226/index.html"
index 603677530..155cad8c5 100644
--- "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\345\205\266\344\273\226/index.html"
+++ "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\345\205\266\344\273\226/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -318,13 +318,13 @@ <h1 class="collection-header">其他
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\223\215\344\275\234\347\263\273\347\273\237/index.html" "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\223\215\344\275\234\347\263\273\347\273\237/index.html"
index 58ff85bb1..7f6de0550 100644
--- "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\223\215\344\275\234\347\263\273\347\273\237/index.html"
+++ "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\223\215\344\275\234\347\263\273\347\273\237/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -358,13 +358,13 @@ <h1 class="collection-header">操作系统
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\225\260\346\215\256\347\247\221\345\255\246/index.html" "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\225\260\346\215\256\347\247\221\345\255\246/index.html"
index 6f0911a52..834d3d1aa 100644
--- "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\225\260\346\215\256\347\247\221\345\255\246/index.html"
+++ "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\225\260\346\215\256\347\247\221\345\255\246/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -265,7 +265,7 @@ <h1 class="collection-header">数据科学
 
       <div class="post-title">
         <a class="post-title-link" href="/2023/10/15/houses/" itemprop="url">
-          <span itemprop="name">基于伯克利ds100的数据分析项目</span>
+          <span itemprop="name">基于伯克利ds100的数据分析项目(待续)</span>
         </a>
       </div>
 
@@ -338,13 +338,13 @@ <h1 class="collection-header">数据科学
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\225\260\346\215\256\347\273\223\346\236\204\344\270\216\347\256\227\346\263\225/index.html" "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\225\260\346\215\256\347\273\223\346\236\204\344\270\216\347\256\227\346\263\225/index.html"
index b62d17ac8..496db4136 100644
--- "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\225\260\346\215\256\347\273\223\346\236\204\344\270\216\347\256\227\346\263\225/index.html"
+++ "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\346\225\260\346\215\256\347\273\223\346\236\204\344\270\216\347\256\227\346\263\225/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -378,13 +378,13 @@ <h1 class="collection-header">数据结构与算法
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\350\256\241\347\256\227\346\234\272\347\275\221\347\273\234/index.html" "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\350\256\241\347\256\227\346\234\272\347\275\221\347\273\234/index.html"
index 05417ea0e..fb8817182 100644
--- "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\350\256\241\347\256\227\346\234\272\347\275\221\347\273\234/index.html"
+++ "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\350\256\241\347\256\227\346\234\272\347\275\221\347\273\234/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">计算机网络
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\350\256\241\347\273\204/index.html" "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\350\256\241\347\273\204/index.html"
index a50ccf120..27dbb5d30 100644
--- "a/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\350\256\241\347\273\204/index.html"
+++ "b/categories/\350\257\276\347\250\213\347\254\224\350\256\260/\350\256\241\347\273\204/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">计组
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/categories/\350\277\252\347\221\236\345\205\213\346\213\211/index.html" "b/categories/\350\277\252\347\221\236\345\205\213\346\213\211/index.html"
index 992f702ac..21b586bc3 100644
--- "a/categories/\350\277\252\347\221\236\345\205\213\346\213\211/index.html"
+++ "b/categories/\350\277\252\347\221\236\345\205\213\346\213\211/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -338,13 +338,13 @@ <h1 class="collection-header">迪瑞克拉
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/guestbook/index.html b/guestbook/index.html
index 41084d999..2c8af5617 100644
--- a/guestbook/index.html
+++ b/guestbook/index.html
@@ -197,7 +197,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -291,13 +291,13 @@ <h1 id="欢迎来到迪瑞克拉世界"><a href="#欢迎来到迪瑞克拉世界
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/index.html b/index.html
index 93ae358c7..00fe80659 100644
--- a/index.html
+++ b/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -352,7 +352,7 @@ <h2 id="更新日志"><a href="#更新日志" class="headerlink" title="更新
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/15/houses/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -370,7 +370,7 @@ <h2 id="更新日志"><a href="#更新日志" class="headerlink" title="更新
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/10/15/houses/" class="post-title-link" itemprop="url">基于伯克利ds100的数据分析项目</a>
+          <a href="/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/" class="post-title-link" itemprop="url">未命名</a>
         </h2>
 
         <div class="post-meta-container">
@@ -383,20 +383,7 @@ <h2 class="post-title" itemprop="name headline">
       <span class="post-meta-item-text">发表于</span>
       
 
-      <time title="创建时间：2023-10-15 23:17:54 / 修改时间：23:21:12" itemprop="dateCreated datePublished" datetime="2023-10-15T23:17:54+08:00">2023-10-15</time>
-    </span>
-    <span class="post-meta-item">
-      <span class="post-meta-item-icon">
-        <i class="far fa-folder"></i>
-      </span>
-      <span class="post-meta-item-text">分类于</span>
-        <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/" itemprop="url" rel="index"><span itemprop="name">课程笔记</span></a>
-        </span>
-          ，
-        <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%A7%91%E5%AD%A6/" itemprop="url" rel="index"><span itemprop="name">数据科学</span></a>
-        </span>
+      <time title="创建时间：2023-10-16 23:11:19 / 修改时间：23:13:36" itemprop="dateCreated datePublished" datetime="2023-10-16T23:11:19+08:00">2023-10-16</time>
     </span>
 
   
@@ -406,14 +393,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>6.8k</span>
+      <span>8k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>6 分钟</span>
+      <span>7 分钟</span>
     </span>
 </div>
 
@@ -424,17 +411,49 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h2 id="数据集：美国伊利诺伊州库克县的住房数据集"><a href="#数据集：美国伊利诺伊州库克县的住房数据集" class="headerlink" title="数据集：美国伊利诺伊州库克县的住房数据集"></a>数据集：美国伊利诺伊州库克县的住房数据集</h2><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">#引入python库</span></span><br><span class="line"><span class="keyword">import</span> numpy <span class="keyword">as</span> np</span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> pandas <span class="keyword">as</span> pd</span><br><span class="line"></span><br><span class="line">%matplotlib inline</span><br><span class="line"><span class="keyword">import</span> matplotlib.pyplot <span class="keyword">as</span> plt</span><br><span class="line"><span class="keyword">import</span> seaborn <span class="keyword">as</span> sns</span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> warnings</span><br><span class="line">warnings.filterwarnings(<span class="string">&quot;ignore&quot;</span>)</span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> zipfile</span><br><span class="line"><span class="keyword">import</span> os</span><br><span class="line"></span><br><span class="line"><span class="comment"># Plot settings</span></span><br><span class="line">plt.rcParams[<span class="string">&#x27;figure.figsize&#x27;</span>] = (<span class="number">12</span>, <span class="number">9</span>)</span><br><span class="line">plt.rcParams[<span class="string">&#x27;font.size&#x27;</span>] = <span class="number">12</span></span><br><span class="line"></span><br></pre></td></tr></table></figure>
-
-<p>该数据集包含来自伊利诺伊州库克县（芝加哥所在县）的超过 500,000 条记录。<br>数据集共有61个特征； 第 62 个是销售价格, 每个变量的解释可以在 codebook.txt文件中找到<br>数据分为训练集和测试集，分别有 204,792 个和 68,264 个观测值，但我们将只处理项目这一部分的训练集。 </p>
-          <!--noindex-->
-            <div class="post-button">
-              <a class="btn" href="/2023/10/15/houses/#more" rel="contents">
-                阅读全文 &raquo;
-              </a>
-            </div>
-          <!--/noindex-->
-        
+          <h1 id="基础"><a href="#基础" class="headerlink" title="基础"></a>基础</h1><h2 id="数据结构"><a href="#数据结构" class="headerlink" title="数据结构"></a>数据结构</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016191822017.png"></p>
+<h2 id="算法性质"><a href="#算法性质" class="headerlink" title="算法性质"></a>算法性质</h2><p><code>循环不变式</code>主要用来帮助我们理解算法的正确性。关千<code>循环不变式</code>，我们必须证明三条<br>性质：<br>初始化：循环的第一次迭代之前，它为真。<br>保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。<br>终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正<br>确的。<br><code>分治算法</code>运行时间的递归式来自基本模式的三个步骤。如前所述，我们假设 T(n) 是规模为n 的一个问题的运行时间。若问题规模足够小，如对某个常量 c, n~c, 则直接求解需要常量时间，我们将其写作 @(1) 。假设把原问题分解成 a 个子问题，每个子问题的规模是原问题的 l&#x2F;b （对归并排序， a 和 b 都为 2, 然而，我们将看到在许多分治算法中， a&#x3D;&#x2F;&#x3D;-b 。)为了求解一个规模为  n&#x2F;b 的子问题，需要 T(n&#x2F;b) 的时间，所以需要 aT(n&#x2F;b) 的时间来求解 a 个子问题。如果分解问题  成子问题需要时间 D(n), 合并子问题的解成原问题的解需要时间 C(n), 那么得到递归式：  ![[Pasted image 20230519142006.png]]</p>
+<p>![[Pasted image 20230519142707.png]]<br>f(n) &#x3D; O(g(n)) 类似于 a&lt;&#x3D;b<br>f(n) &#x3D; Ω (g(n)) 类似于 a&gt;&#x3D;b<br>f(n) &#x3D; θ (g(n))  类似于 a&#x3D;b<br>f(n) &#x3D; o(g(n)) 类似于 a&lt;b<br>f(n) &#x3D; w(g(n)) 类似于 a&gt;b<br>![[Pasted image 20230519150021.png]]</p>
+<h2 id="分治法（递归）"><a href="#分治法（递归）" class="headerlink" title="分治法（递归）"></a>分治法（递归）</h2><h3 id="选择排序"><a href="#选择排序" class="headerlink" title="选择排序"></a>选择排序</h3><p>• Find a largest number in prefix A[:i + 1] and swap it to A[i]<br>• Recursively sort prefix A[:i]</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">def selection_sort(A, i = None): # T(i)</span><br><span class="line">2 ’’’Sort A[:i + 1]’’’</span><br><span class="line">3 if i is None: i = len(A) - 1 # O(1)</span><br><span class="line">4 if i &gt; 0: # O(1)</span><br><span class="line">5 j = prefix_max(A, i) # S(i)</span><br><span class="line">6 A[i], A[j] = A[j], A[i] # O(1)</span><br><span class="line">7 selection_sort(A, i - 1) # T(i - 1)</span><br><span class="line">8</span><br><span class="line">9 def prefix_max(A, i): # S(i)</span><br><span class="line">10 ’’’Return index of maximum in A[:i + 1]’’’</span><br><span class="line">11 if i &gt; 0: # O(1)</span><br><span class="line">12 j = prefix_max(A, i - 1) # S(i - 1)</span><br><span class="line">13 if A[i] &lt; A[j]: # O(1)</span><br><span class="line">14 return j # O(1)</span><br><span class="line">15 return i # O(1)</span><br></pre></td></tr></table></figure>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">• prefix max analysis:</span><br><span class="line">– Base case: for i = 0, array has one element, so index of max is i</span><br><span class="line">– Induction: assume correct for i, maximum is either the maximum of A[:i] or A[i],</span><br><span class="line">returns correct index in either case</span><br><span class="line">• selection sort analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, last number of a sorted output is a largest number of</span><br><span class="line">the array, and the algorithm puts one there; then A[:i] is sorted by inductio</span><br></pre></td></tr></table></figure>
+<h3 id="插入排序"><a href="#插入排序" class="headerlink" title="插入排序"></a>插入排序</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br></pre></td><td class="code"><pre><span class="line">def insertion_sort(A, i = None): # T(i)</span><br><span class="line">2 ’’’Sort A[:i + 1]’’’</span><br><span class="line">3 if i is None: i = len(A) - 1 # O(1)</span><br><span class="line">4 if i &gt; 0: # O(1)</span><br><span class="line">5 insertion_sort(A, i - 1) # T(i - 1)</span><br><span class="line">6 insert_last(A, i) # S(i)</span><br><span class="line">7</span><br><span class="line">8 def insert_last(A, i): # S(i)</span><br><span class="line">9 ’’’Sort A[:i + 1] assuming sorted A[:i]’’’</span><br><span class="line">10 if i &gt; 0 and A[i] &lt; A[i - 1]: # O(1)</span><br><span class="line">11 A[i], A[i - 1] = A[i - 1], A[i] # O(1)</span><br><span class="line">12 insert_last(A, i - 1) # S(i - 1)</span><br><span class="line">• insert last analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, if A[i] &gt;= A[i - 1], array is sorted; otherwise,</span><br><span class="line">swapping last two elements allows us to sort A[:i] by induction</span><br><span class="line">• insertion sort analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, algorithm sorts A[:i] by induction, and then</span><br><span class="line">insert last correctly sorts the rest as proved above</span><br></pre></td></tr></table></figure>
+<h3 id="归并排序"><a href="#归并排序" class="headerlink" title="归并排序"></a>归并排序</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br></pre></td><td class="code"><pre><span class="line">def merge_sort(A, a = 0, b = None): # T(b - a = n)</span><br><span class="line">2 ’’’Sort A[a:b]’’’</span><br><span class="line">3 if b is None: b = len(A) # O(1)</span><br><span class="line">4 if 1 &lt; b - a: # O(1)</span><br><span class="line">5 c = (a + b + 1) // 2 # O(1)</span><br><span class="line">6 merge_sort(A, a, c) # T(n / 2)</span><br><span class="line">7 merge_sort(A, c, b) # T(n / 2)</span><br><span class="line">8 L, R = A[a:c], A[c:b] # O(n)</span><br><span class="line">9 merge(L, R, A, len(L), len(R), a, b) # S(n)</span><br><span class="line">10</span><br><span class="line">11 def merge(L, R, A, i, j, a, b): # S(b - a = n)</span><br><span class="line">12 ’’’Merge sorted L[:i] and R[:j] into A[a:b]’’’</span><br><span class="line">13 if a &lt; b: # O(1)</span><br><span class="line">14 if (j &lt;= 0) or (i &gt; 0 and L[i - 1] &gt; R[j - 1]): # O(1)</span><br><span class="line">15 A[b - 1] = L[i - 1] # O(1)</span><br><span class="line">16 i = i - 1 # O(1)</span><br><span class="line">17 else: # O(1)</span><br><span class="line">18 A[b - 1] = R[j - 1] # O(1)</span><br><span class="line">19 j = j - 1 # O(1)</span><br><span class="line">20 merge(L, R, A, i, j, a, b - 1)</span><br></pre></td></tr></table></figure>
+
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">• merge analysis:</span><br><span class="line">– Base case: for n = 0, arrays are empty, so vacuously correct</span><br><span class="line">– Induction: assume correct for n, item in A[r] must be a largest number from remaining</span><br><span class="line">prefixes of L and R, and since they are sorted, taking largest of last items suffices;</span><br><span class="line">remainder is merged by induction</span><br><span class="line"> merge sort analysis:</span><br><span class="line">– Base case: for n = 1, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for k &lt; n, algorithm sorts smaller halves by induction, and then merge merges into a sorted array as proved above.</span><br></pre></td></tr></table></figure>
+<h3 id="寻峰算法"><a href="#寻峰算法" class="headerlink" title="寻峰算法"></a>寻峰算法</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br></pre></td><td class="code"><pre><span class="line">• If a[n/2] &lt; a[n/2 − 1] then only look at left half 1 . . . n/2 − − − 1 to look for peak</span><br><span class="line">• Else if a[n/2] &lt; a[n/2 + 1] then only look at right half n/2 + 1 . . . n to look for peak</span><br><span class="line">• Else n/2 position is a peak: WHY?</span><br><span class="line">a[n/2] ≥ a[n/2 − 1]</span><br><span class="line">a[n/2] ≥ a[n/2 + 1]</span><br><span class="line">What is the complexity?</span><br><span class="line">T (n) = T (n/2) + Θ(1) = Θ(1) + . . . + Θ(1) (log2(n) times) = Θ(log2(n))</span><br></pre></td></tr></table></figure>
+<p>二维情况下：</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br></pre></td><td class="code"><pre><span class="line">• Pick middle column j = m/2</span><br><span class="line">• Find global maximum on column j at (i, j)</span><br><span class="line">• Compare (i, j − 1), (i, j), (i, j + 1)</span><br><span class="line">• Pick left columns of (i, j − 1) &gt; (i, j)</span><br><span class="line">• Similarly for right</span><br><span class="line">• (i, j) is a 2D-peak if neither condition holds</span><br><span class="line">• Solve the new problem with half the number of columns.</span><br><span class="line">• When you have a single column, find global maximum and you‘re done.</span><br><span class="line"></span><br><span class="line">T (n, m) = T (n, m/2) + Θ(n) (to find global maximum on a column — (n rows))</span><br><span class="line">T (n, m) = Θ(n) + . . . + Θ(n)</span><br><span class="line">&#x27; -v &quot;</span><br><span class="line">log m</span><br><span class="line">= Θ(n log m) = Θ(n log n) if m = n</span><br></pre></td></tr></table></figure>
+
+<h3 id="最大子数组"><a href="#最大子数组" class="headerlink" title="最大子数组"></a>最大子数组</h3><p>算法思路：<br>元素和最大的子数组有三种情况：在左半数组，右半数组，或者跨越中点，第一和第二种情况可以用递归遍历解决，第三种情况则分为两个半边数组的组合，只要从中点出发寻找最大子数组，然后组合就可以了<br><code>时间复杂度分析</code>：，其中线性时间为跨越中点的子数组，最终需要时间为O(NlogN)<br>![[Pasted image 20230522103507.png]]</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br></pre></td><td class="code"><pre><span class="line">FIND-MAXIMUM-SUBARRAYCA, low, high)  </span><br><span class="line">if high== low  </span><br><span class="line">return Clow, high, A[low])  </span><br><span class="line">else mid=L Clow 十 high)/2 」  </span><br><span class="line">Cleft-low, left-high, left-sum) =  </span><br><span class="line">// base case, only one element  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, low, mid)  </span><br><span class="line">(right-low, right-high, right-sum) =  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, mid+l. high)  </span><br><span class="line">(cross-low, cross-high, cross-sum) =  </span><br><span class="line">FIND-MAX-CROSSING-SUBARRAY(A, low, mid, high)  </span><br><span class="line">if left-sum~right-sum and left-sum~cross-sum  </span><br><span class="line">return (left-low, left-high, left-sum)  </span><br><span class="line">elseif rightr-sum;?, left-sum and right-sum;?, cross-sum  </span><br><span class="line">return (right-low, right-high, right-sum)  </span><br><span class="line">else return (cross-low, cross-high, cross-sum)</span><br><span class="line"></span><br><span class="line">FIND-MAX-CROSSING--SUBARRAY(A, low, mid, high)  </span><br><span class="line"> left-sum = -oo  </span><br><span class="line"> sum=O  </span><br><span class="line"> for i = mid downto low  </span><br><span class="line"> sum=sum+A[i]  </span><br><span class="line"> if sum&gt; left-sum  </span><br><span class="line"> left-sum = sum  </span><br><span class="line"> max-left = i  </span><br><span class="line"> right-sum= -oo  </span><br><span class="line"> sum=O  </span><br><span class="line"> for j = mid + 1 to high</span><br><span class="line"> sum=sum + A[j]  </span><br><span class="line"> if sum &gt; right-sum  </span><br><span class="line"> right-sum = sum  </span><br><span class="line"> max-right = j  </span><br><span class="line"> return (max-left, max-right, left-sum + right-sum)</span><br></pre></td></tr></table></figure>
+<h2 id="代入法求解递归式"><a href="#代入法求解递归式" class="headerlink" title="代入法求解递归式"></a>代入法求解递归式</h2><ol>
+<li>猜测解的形式。  </li>
+<li>用数学归纳法求出解中的常数，并证明解是正确的。<br>猜测T(n)的上界，将其带入递归式，求出一个上界，随后寻找一个N0证明对所有n&gt;&#x3D;n0，递归式T(n)成立<br>![[Pasted image 20230522140116.png]]<br>![[Pasted image 20230522140235.png]]</li>
+</ol>
+<h2 id="递归树法"><a href="#递归树法" class="headerlink" title="递归树法"></a>递归树法</h2><p>递归树是良好的猜测递归式时间复杂度的方法，但由于构建递归树经常伴随简化，所以用其证明的话则不够严谨<br>以递归式 T(n)&#x3D;3T(ln&#x2F;4 」) +S(n2) 为例，来看一下如何用递归树生成一个好的猜测<br>![[Pasted image 20230523212855.png]]<br>递归树有 log4n+l 层，<br>![[Pasted image 20230523213613.png]]<br>![[Pasted image 20230523213754.png]]<br>由于根结点对总代价的贡献为 cn^2, 所以根结点的代价占总代价的一个常数  比例。换句话说，根结点的代价支配了整棵树的总代价。</p>
+<h2 id="主方法求解递归式"><a href="#主方法求解递归式" class="headerlink" title="主方法求解递归式"></a>主方法求解递归式</h2><p>主方法为如下形式的递归式提供了一种”菜谱”式的求解方法<br>T(n) &#x3D; aT(n&#x2F;b) + f(n)<br>其中 a&gt;&#x3D;l1和 b&gt;&#x3D;1 是常数， f(n) 是渐近正函数。<br>![[Pasted image 20230524215056.png]]</p>
+<h1 id="比较排序"><a href="#比较排序" class="headerlink" title="比较排序"></a>比较排序</h1><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016192215938.png"></p>
+<h2 id="决策树"><a href="#决策树" class="headerlink" title="决策树"></a>决策树</h2><p>决策树<br> • 任何算法都可以被视为所执行操作的决策树<br> • 内部节点表示二进制比较，分支为 True 或 False<br> • 对于比较算法，决策树是二元的<br> • 叶子代表算法终止，产生算法输出<br> • 根到叶路径表示算法在某些输入上的执行<br> • 每个算法输出至少需要一个叶子，因此搜索需要 ≥ n + 1 个叶子<br> • 高度 ≥ mod(lg(n + 1)) − 1 &#x3D; Ω(log n)，因此任何比较排序的运行时间均为 Ω(log n)</p>
+<h2 id="堆排序"><a href="#堆排序" class="headerlink" title="堆排序"></a>堆排序</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231014112423645.png"><br>最大堆的生成</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line">l = left(i)</span><br><span class="line">r = right(i)</span><br><span class="line">if (l &lt;= heap-size(A) and A[l] &gt; A[i])</span><br><span class="line">then largest = l else largest = i</span><br><span class="line">if (r &lt;= heap-size(A) and A[r] &gt; A[largest])</span><br><span class="line">then largest = r</span><br><span class="line">if largest = i</span><br><span class="line">then exchange A[i] and A[largest]</span><br><span class="line">Max_Heapify(A, largest)</span><br><span class="line"></span><br><span class="line">//Converts A[1…n] to a max heap</span><br><span class="line">Build_Max_Heap(A):</span><br><span class="line">for i=n/2 downto 1</span><br><span class="line">do Max_Heapify(A, i)</span><br><span class="line"></span><br><span class="line">/*</span><br><span class="line">Why start at n/2?</span><br><span class="line">Because elements A[n/2 + 1 … n] are all leaves of the tree</span><br><span class="line">*/</span><br></pre></td></tr></table></figure>
+<p>时间复杂度分析：</p>
+<p>Total amount of work in the for loop can be summed as:<br>n&#x2F;4 (1 c) + n&#x2F;8 (2 c) + n&#x2F;16 (3 c) + … + 1 (lg n c)<br>Setting n&#x2F;4 &#x3D; 2k and simplifying we get:<br>c 2k( 1&#x2F;20 + 2&#x2F;21 + 3&#x2F;22 + … (k+1)&#x2F;2k )<br>The term is brackets is bounded by a constant<br>This means that Build_Max_Heap is O(n)</p>
+<p>排序策略：</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br></pre></td><td class="code"><pre><span class="line">Sorting Strategy:</span><br><span class="line">1. Build Max Heap from unordered array;</span><br><span class="line">2. Find maximum element A[1];</span><br><span class="line">3. Swap elements A[n] and A[1]:</span><br><span class="line">now max element is at the end of the array!</span><br><span class="line">4. Discard node n from heap</span><br><span class="line">(by decrementing heap-size variable)</span><br><span class="line">5. New root may violate max heap property, but its</span><br><span class="line">children are max heaps. Run max_heapify to fix this.</span><br><span class="line">6. Go to Step 2 unless heap is empty</span><br></pre></td></tr></table></figure>
+
+<h2 id="动态规划和二分搜索树"><a href="#动态规划和二分搜索树" class="headerlink" title="动态规划和二分搜索树"></a>动态规划和二分搜索树</h2><p>实例——机场的动态规划：</p>
+<ol>
+<li>机场维护一个跑道队列</li>
+<li>未来的着陆预定登记到队列</li>
+<li>一架飞机着陆后就出队</li>
+<li>有新的请求且需要着陆时间t时，如果k时间内没有其他需求，则需求t时间的请求入队(k可以实时改变)<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br></pre></td><td class="code"><pre><span class="line">init: R = [ ]</span><br><span class="line">req(t): if t &lt; now: return &quot;error&quot;</span><br><span class="line">for i in range (len(R)):</span><br><span class="line">if abs(t-R[i]) &lt; k: return &quot;error&quot;</span><br><span class="line">R.append(t)</span><br><span class="line">R = sorted(R)</span><br><span class="line">land: t = R[0]</span><br><span class="line">if (t != now) return error</span><br><span class="line">R = R[1: ] (drop R[0] from R)</span><br></pre></td></tr></table></figure>
+Goal: Run this system efficiently in O(lg n) time<br>常见数据结构运行时间分析<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br></pre></td><td class="code"><pre><span class="line">• Sorted list: Appending and sorting takes Θ(n lg n) time. However, it is pos-</span><br><span class="line">sible to insert new time/plane rather than append and sort but insertion takes</span><br><span class="line">Θ(n) time. A k minute check can be done in O(1) once the insertion point is</span><br><span class="line">found.</span><br><span class="line">• Sorted array: It is possible to do binary search to find place to insert in</span><br><span class="line">O(lg n) time. Using binary search, we find the smallest i such that R[i] ≥ t,</span><br><span class="line">i.e., the next larger element. We then compare R[i] and R[i − 1] against t.</span><br><span class="line">Actual insertion however requires shifting elements which requires Θ(n) time.</span><br><span class="line">• Unsorted list/array: k minute check takes O(n) time.</span><br><span class="line">• Min-Heap: It is possible to insert in O(lg n) time. However, the k minute</span><br><span class="line">check will require O(n) time.</span><br><span class="line">• Dictionary or Python Set: Insertion is O(1) time. k minute check takes</span><br><span class="line">Ω(n) time</span><br></pre></td></tr></table></figure>
+BST的定义：<br>每个节点都有一个key,左节点的key小于等于父节点，右节点的key大于等于父节点<br>所有操作都是O(h)即O(lgn)<br>动态规划中需要找到比一个值大的值中的最小值<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line">next-larger(x)</span><br><span class="line">if right child not NIL, return minimum(right)</span><br><span class="line">else y = parent(x)</span><br><span class="line">while y not NIL and x = right(y)</span><br><span class="line">x = y; y = parent(y)</span><br><span class="line">return(y);</span><br></pre></td></tr></table></figure>
+<code>子问题</code>：如何计算小于等于时间t内着陆的飞机数量<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line">1. Walk down tree to find desired time</span><br><span class="line">2. Add in nodes that are smaller</span><br><span class="line">3. Add in subtree sizes to the left</span><br></pre></td></tr></table></figure></li>
+</ol>
+<h1 id="哈希"><a href="#哈希" class="headerlink" title="哈希"></a>哈希</h1><p>哈希有可能产生碰撞，需要特定处理或者数据结构，检索元素时间最后会由负载因数(n&#x2F;m)决定<br><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016200400451.png"></p>
+<h1 id="线性时间排序"><a href="#线性时间排序" class="headerlink" title="线性时间排序"></a>线性时间排序</h1>
       
     </div>
 
@@ -460,7 +479,7 @@ <h2 id="数据集：美国伊利诺伊州库克县的住房数据集"><a href="#
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/14/%E8%AE%A1%E7%BD%91/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/15/houses/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -478,7 +497,7 @@ <h2 id="数据集：美国伊利诺伊州库克县的住房数据集"><a href="#
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/10/14/%E8%AE%A1%E7%BD%91/" class="post-title-link" itemprop="url">基于中科大郑烇老师授课的计算机网络笔记(待续)</a>
+          <a href="/2023/10/15/houses/" class="post-title-link" itemprop="url">基于伯克利ds100的数据分析项目(待续)</a>
         </h2>
 
         <div class="post-meta-container">
@@ -491,7 +510,7 @@ <h2 class="post-title" itemprop="name headline">
       <span class="post-meta-item-text">发表于</span>
       
 
-      <time title="创建时间：2023-10-14 20:37:40 / 修改时间：20:43:56" itemprop="dateCreated datePublished" datetime="2023-10-14T20:37:40+08:00">2023-10-14</time>
+      <time title="创建时间：2023-10-15 23:17:54 / 修改时间：23:22:04" itemprop="dateCreated datePublished" datetime="2023-10-15T23:17:54+08:00">2023-10-15</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -503,7 +522,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/" itemprop="url" rel="index"><span itemprop="name">计算机网络</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%A7%91%E5%AD%A6/" itemprop="url" rel="index"><span itemprop="name">数据科学</span></a>
         </span>
     </span>
 
@@ -514,14 +533,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>1.4k</span>
+      <span>6.8k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>1 分钟</span>
+      <span>6 分钟</span>
     </span>
 </div>
 
@@ -532,18 +551,12 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h2 id="第一章——概论"><a href="#第一章——概论" class="headerlink" title="第一章——概论"></a>第一章——概论</h2><h3 id="互联网"><a href="#互联网" class="headerlink" title="互联网"></a>互联网</h3><p><code>链路层</code>相邻节点传输数据<br><code>网络层</code>提供源主机到目标主机之间(端到端end to end)的服务(没有保障)</p>
-<ol>
-<li>传统方式：IP协议，路由协议（路由器交换路由信息，根据算法算出路由表，由ip协议根据目标ip查询路由表确定找到合适端口，进行转发）</li>
-<li>SDN(数据平面：交换机，控制平面：网络操作系统)，控制平面中的网络应用根据信息算出有大量字段的流表给交换机，根据字段匹配相应表项<br><code>传输层</code>区分进程，为进程中多个应用提供服务<br><code>传输协议</code>:tcp提供可靠的数据传输，udp更强调实时性<br><code>tcp</code>：往返建立连接得到响应后再传输<br><code>udp</code>：不会先建立连接再传输<br><code>应用层协议</code>：客户端，服务器等应用之间如何交互来实现功能<br><code>网络</code>：节点和边的形成的拓扑结构<br><code>计算机网络</code>：</li>
-</ol>
-<ul>
-<li>节点：主机节点，数据交换节点（转发数据，交换机，路由器等等）</li>
-<li>边被称为链路：接入网链路（主机连接到互联网），主干链路（路由器之间）</li>
-<li>协议：网络设备的工作标准<br><code>互联网</code>：世界上最大的互联计算机网络，网络的网络
+          <h2 id="数据集：美国伊利诺伊州库克县的住房数据集"><a href="#数据集：美国伊利诺伊州库克县的住房数据集" class="headerlink" title="数据集：美国伊利诺伊州库克县的住房数据集"></a>数据集：美国伊利诺伊州库克县的住房数据集</h2><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">#引入python库</span></span><br><span class="line"><span class="keyword">import</span> numpy <span class="keyword">as</span> np</span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> pandas <span class="keyword">as</span> pd</span><br><span class="line"></span><br><span class="line">%matplotlib inline</span><br><span class="line"><span class="keyword">import</span> matplotlib.pyplot <span class="keyword">as</span> plt</span><br><span class="line"><span class="keyword">import</span> seaborn <span class="keyword">as</span> sns</span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> warnings</span><br><span class="line">warnings.filterwarnings(<span class="string">&quot;ignore&quot;</span>)</span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> zipfile</span><br><span class="line"><span class="keyword">import</span> os</span><br><span class="line"></span><br><span class="line"><span class="comment"># Plot settings</span></span><br><span class="line">plt.rcParams[<span class="string">&#x27;figure.figsize&#x27;</span>] = (<span class="number">12</span>, <span class="number">9</span>)</span><br><span class="line">plt.rcParams[<span class="string">&#x27;font.size&#x27;</span>] = <span class="number">12</span></span><br><span class="line"></span><br></pre></td></tr></table></figure>
+
+<p>该数据集包含来自伊利诺伊州库克县（芝加哥所在县）的超过 500,000 条记录。<br>数据集共有61个特征； 第 62 个是销售价格, 每个变量的解释可以在 codebook.txt文件中找到<br>数据分为训练集和测试集，分别有 204,792 个和 68,264 个观测值，但我们将只处理项目这一部分的训练集。 </p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/10/14/%E8%AE%A1%E7%BD%91/#more" rel="contents">
+              <a class="btn" href="/2023/10/15/houses/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -574,7 +587,7 @@ <h2 id="第一章——概论"><a href="#第一章——概论" class="headerlin
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/14/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/14/%E8%AE%A1%E7%BD%91/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -592,7 +605,7 @@ <h2 id="第一章——概论"><a href="#第一章——概论" class="headerlin
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/10/14/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于mit6.006的算法笔记(待续)</a>
+          <a href="/2023/10/14/%E8%AE%A1%E7%BD%91/" class="post-title-link" itemprop="url">基于中科大郑烇老师授课的计算机网络笔记(待续)</a>
         </h2>
 
         <div class="post-meta-container">
@@ -605,7 +618,7 @@ <h2 class="post-title" itemprop="name headline">
       <span class="post-meta-item-text">发表于</span>
       
 
-      <time title="创建时间：2023-10-14 20:31:46 / 修改时间：20:47:51" itemprop="dateCreated datePublished" datetime="2023-10-14T20:31:46+08:00">2023-10-14</time>
+      <time title="创建时间：2023-10-14 20:37:40 / 修改时间：20:43:56" itemprop="dateCreated datePublished" datetime="2023-10-14T20:37:40+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -617,7 +630,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/" itemprop="url" rel="index"><span itemprop="name">数据结构与算法</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/" itemprop="url" rel="index"><span itemprop="name">计算机网络</span></a>
         </span>
     </span>
 
@@ -628,14 +641,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>4k</span>
+      <span>1.4k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>4 分钟</span>
+      <span>1 分钟</span>
     </span>
 </div>
 
@@ -646,10 +659,18 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h2 id="算法性质"><a href="#算法性质" class="headerlink" title="算法性质"></a>算法性质</h2><p><code>循环不变式</code>主要用来帮助我们理解算法的正确性。关千<code>循环不变式</code>，我们必须证明三条<br>性质：<br>初始化：循环的第一次迭代之前，它为真。<br>保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。<br>终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正<br>确的。</p>
+          <h2 id="第一章——概论"><a href="#第一章——概论" class="headerlink" title="第一章——概论"></a>第一章——概论</h2><h3 id="互联网"><a href="#互联网" class="headerlink" title="互联网"></a>互联网</h3><p><code>链路层</code>相邻节点传输数据<br><code>网络层</code>提供源主机到目标主机之间(端到端end to end)的服务(没有保障)</p>
+<ol>
+<li>传统方式：IP协议，路由协议（路由器交换路由信息，根据算法算出路由表，由ip协议根据目标ip查询路由表确定找到合适端口，进行转发）</li>
+<li>SDN(数据平面：交换机，控制平面：网络操作系统)，控制平面中的网络应用根据信息算出有大量字段的流表给交换机，根据字段匹配相应表项<br><code>传输层</code>区分进程，为进程中多个应用提供服务<br><code>传输协议</code>:tcp提供可靠的数据传输，udp更强调实时性<br><code>tcp</code>：往返建立连接得到响应后再传输<br><code>udp</code>：不会先建立连接再传输<br><code>应用层协议</code>：客户端，服务器等应用之间如何交互来实现功能<br><code>网络</code>：节点和边的形成的拓扑结构<br><code>计算机网络</code>：</li>
+</ol>
+<ul>
+<li>节点：主机节点，数据交换节点（转发数据，交换机，路由器等等）</li>
+<li>边被称为链路：接入网链路（主机连接到互联网），主干链路（路由器之间）</li>
+<li>协议：网络设备的工作标准<br><code>互联网</code>：世界上最大的互联计算机网络，网络的网络
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/10/14/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
+              <a class="btn" href="/2023/10/14/%E8%AE%A1%E7%BD%91/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -680,7 +701,7 @@ <h2 id="算法性质"><a href="#算法性质" class="headerlink" title="算法
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/14/%E8%8B%8F%E5%A4%A7linux_ppt/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/14/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -698,7 +719,7 @@ <h2 id="算法性质"><a href="#算法性质" class="headerlink" title="算法
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/10/14/%E8%8B%8F%E5%A4%A7linux_ppt/" class="post-title-link" itemprop="url">基于苏大ppt的linux笔记(待续)</a>
+          <a href="/2023/10/14/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于mit6.006的算法笔记(待续)</a>
         </h2>
 
         <div class="post-meta-container">
@@ -709,9 +730,15 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar"></i>
       </span>
       <span class="post-meta-item-text">发表于</span>
-      
 
-      <time title="创建时间：2023-10-14 20:27:26 / 修改时间：20:46:36" itemprop="dateCreated datePublished" datetime="2023-10-14T20:27:26+08:00">2023-10-14</time>
+      <time title="创建时间：2023-10-14 20:31:46" itemprop="dateCreated datePublished" datetime="2023-10-14T20:31:46+08:00">2023-10-14</time>
+    </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-10-16 23:15:56" itemprop="dateModified" datetime="2023-10-16T23:15:56+08:00">2023-10-16</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -723,7 +750,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/" itemprop="url" rel="index"><span itemprop="name">操作系统</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/" itemprop="url" rel="index"><span itemprop="name">数据结构与算法</span></a>
         </span>
     </span>
 
@@ -734,14 +761,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>2.5k</span>
+      <span>8.7k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>2 分钟</span>
+      <span>8 分钟</span>
     </span>
 </div>
 
@@ -752,14 +779,11 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h2 id="文件系统"><a href="#文件系统" class="headerlink" title="文件系统"></a>文件系统</h2><h3 id="命名"><a href="#命名" class="headerlink" title="命名"></a>命名</h3><p>•除&#x2F;之外，所有的字符都合法</p>
-<p>•大小写敏感</p>
-<p>•有些字符最好不用，如空格符、制表符、退格符和字符：？, @ # $ &amp; () \ | ; ‘ ’ “ ” &lt; &gt;</p>
-<p>•避免使用＋、－或. 来作为普通文件名的第一个字符</p>
-<p>•可以使用长文件名或目录名（255个字符）</p>
+          <h1 id="基础"><a href="#基础" class="headerlink" title="基础"></a>基础</h1><h2 id="数据结构"><a href="#数据结构" class="headerlink" title="数据结构"></a>数据结构</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016191822017.png"></p>
+<h2 id="算法性质"><a href="#算法性质" class="headerlink" title="算法性质"></a>算法性质</h2><p><code>循环不变式</code>主要用来帮助我们理解算法的正确性。关千<code>循环不变式</code>，我们必须证明三条<br>性质：<br>初始化：循环的第一次迭代之前，它为真。<br>保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。<br>终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正<br>确的。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/10/14/%E8%8B%8F%E5%A4%A7linux_ppt/#more" rel="contents">
+              <a class="btn" href="/2023/10/14/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -805,13 +829,13 @@ <h2 id="文件系统"><a href="#文件系统" class="headerlink" title="文件
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/page/2/index.html b/page/2/index.html
index 4210605e9..f48a8d497 100644
--- a/page/2/index.html
+++ b/page/2/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/12/sysadmin/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/14/%E8%8B%8F%E5%A4%A7linux_ppt/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -262,7 +262,7 @@ <h1 class="site-title">thinklive</h1>
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/10/12/sysadmin/" class="post-title-link" itemprop="url">基于伯克利Sysadmin decal的linux笔记</a>
+          <a href="/2023/10/14/%E8%8B%8F%E5%A4%A7linux_ppt/" class="post-title-link" itemprop="url">基于苏大ppt的linux笔记(待续)</a>
         </h2>
 
         <div class="post-meta-container">
@@ -273,15 +273,9 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar"></i>
       </span>
       <span class="post-meta-item-text">发表于</span>
+      
 
-      <time title="创建时间：2023-10-12 20:54:12" itemprop="dateCreated datePublished" datetime="2023-10-12T20:54:12+08:00">2023-10-12</time>
-    </span>
-    <span class="post-meta-item">
-      <span class="post-meta-item-icon">
-        <i class="far fa-calendar-check"></i>
-      </span>
-      <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:48:36" itemprop="dateModified" datetime="2023-10-14T20:48:36+08:00">2023-10-14</time>
+      <time title="创建时间：2023-10-14 20:27:26 / 修改时间：20:46:36" itemprop="dateCreated datePublished" datetime="2023-10-14T20:27:26+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -304,14 +298,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>28k</span>
+      <span>2.5k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>25 分钟</span>
+      <span>2 分钟</span>
     </span>
 </div>
 
@@ -322,11 +316,14 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h1 id="shell脚本"><a href="#shell脚本" class="headerlink" title="shell脚本"></a>shell脚本</h1><p>Shell 脚本通常以 shebang 行开头：#!path&#x2F;to&#x2F;interpreter。</p>
-<p><code>#!</code>是一个人类可读的 <a target="_blank" rel="noopener" href="https://en.wikipedia.org/wiki/Shebang_(Unix)#Magic_number">幻数表示</a> <code>0x23 0x21</code>它可以告诉 shell 将文件其余部分的执行传递给 指定翻译。 如果您的脚本作为可执行文件运行（例如 <code>./awesome_shell_script</code>) 加上 shebang 行，那么 shell 将调用 可执行文件（通常是解释器）位于 <code>path/to/interpreter</code>运行你的 脚本。 如果您的脚本作为参数传递给解释器，例如 <code>bash awesome_shell_script</code>，那么 shebang 没有效果并且 <code>bash</code>会处理 脚本的执行。</p>
+          <h2 id="文件系统"><a href="#文件系统" class="headerlink" title="文件系统"></a>文件系统</h2><h3 id="命名"><a href="#命名" class="headerlink" title="命名"></a>命名</h3><p>•除&#x2F;之外，所有的字符都合法</p>
+<p>•大小写敏感</p>
+<p>•有些字符最好不用，如空格符、制表符、退格符和字符：？, @ # $ &amp; () \ | ; ‘ ’ “ ” &lt; &gt;</p>
+<p>•避免使用＋、－或. 来作为普通文件名的第一个字符</p>
+<p>•可以使用长文件名或目录名（255个字符）</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/10/12/sysadmin/#more" rel="contents">
+              <a class="btn" href="/2023/10/14/%E8%8B%8F%E5%A4%A7linux_ppt/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -357,7 +354,7 @@ <h1 id="shell脚本"><a href="#shell脚本" class="headerlink" title="shell脚
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/09/numpy/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/12/sysadmin/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -375,7 +372,7 @@ <h1 id="shell脚本"><a href="#shell脚本" class="headerlink" title="shell脚
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/10/09/numpy/" class="post-title-link" itemprop="url">基于伯克利ds100和cs231n的numpy笔记</a>
+          <a href="/2023/10/12/sysadmin/" class="post-title-link" itemprop="url">基于伯克利Sysadmin decal的linux笔记</a>
         </h2>
 
         <div class="post-meta-container">
@@ -387,14 +384,14 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">发表于</span>
 
-      <time title="创建时间：2023-10-09 20:02:04" itemprop="dateCreated datePublished" datetime="2023-10-09T20:02:04+08:00">2023-10-09</time>
+      <time title="创建时间：2023-10-12 20:54:12" itemprop="dateCreated datePublished" datetime="2023-10-12T20:54:12+08:00">2023-10-12</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:48:24" itemprop="dateModified" datetime="2023-10-14T20:48:24+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:48:36" itemprop="dateModified" datetime="2023-10-14T20:48:36+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -406,7 +403,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%A7%91%E5%AD%A6/" itemprop="url" rel="index"><span itemprop="name">数据科学</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/" itemprop="url" rel="index"><span itemprop="name">操作系统</span></a>
         </span>
     </span>
 
@@ -417,14 +414,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>6.8k</span>
+      <span>28k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>6 分钟</span>
+      <span>25 分钟</span>
     </span>
 </div>
 
@@ -435,11 +432,11 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <p><a target="_blank" rel="noopener" href="http://www.numpy.org/">Numpy</a> 是 Python 中科学计算的核心库。 它提供了高性能的多维数组对象以及使用这些对象的工具 数组。</p>
-<h2 id="数组"><a href="#数组" class="headerlink" title="数组"></a>数组</h2><p>numpy 数组是一个值网格，所有值都具有相同的类型，并由非负整数组成的元组索引。 它的维度就是数组的秩 ；它的shape就是每个维度的大小组成的元组</p>
+          <h1 id="shell脚本"><a href="#shell脚本" class="headerlink" title="shell脚本"></a>shell脚本</h1><p>Shell 脚本通常以 shebang 行开头：#!path&#x2F;to&#x2F;interpreter。</p>
+<p><code>#!</code>是一个人类可读的 <a target="_blank" rel="noopener" href="https://en.wikipedia.org/wiki/Shebang_(Unix)#Magic_number">幻数表示</a> <code>0x23 0x21</code>它可以告诉 shell 将文件其余部分的执行传递给 指定翻译。 如果您的脚本作为可执行文件运行（例如 <code>./awesome_shell_script</code>) 加上 shebang 行，那么 shell 将调用 可执行文件（通常是解释器）位于 <code>path/to/interpreter</code>运行你的 脚本。 如果您的脚本作为参数传递给解释器，例如 <code>bash awesome_shell_script</code>，那么 shebang 没有效果并且 <code>bash</code>会处理 脚本的执行。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/10/09/numpy/#more" rel="contents">
+              <a class="btn" href="/2023/10/12/sysadmin/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -470,7 +467,7 @@ <h2 id="数组"><a href="#数组" class="headerlink" title="数组"></a>数组</
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/06/61b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/09/numpy/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -488,7 +485,7 @@ <h2 id="数组"><a href="#数组" class="headerlink" title="数组"></a>数组</
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/10/06/61b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于伯克利cs61b的java数据结构笔记</a>
+          <a href="/2023/10/09/numpy/" class="post-title-link" itemprop="url">基于伯克利ds100和cs231n的numpy笔记</a>
         </h2>
 
         <div class="post-meta-container">
@@ -500,14 +497,14 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">发表于</span>
 
-      <time title="创建时间：2023-10-06 23:01:27" itemprop="dateCreated datePublished" datetime="2023-10-06T23:01:27+08:00">2023-10-06</time>
+      <time title="创建时间：2023-10-09 20:02:04" itemprop="dateCreated datePublished" datetime="2023-10-09T20:02:04+08:00">2023-10-09</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:42:36" itemprop="dateModified" datetime="2023-10-14T20:42:36+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:48:24" itemprop="dateModified" datetime="2023-10-14T20:48:24+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -519,7 +516,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/" itemprop="url" rel="index"><span itemprop="name">数据结构与算法</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%A7%91%E5%AD%A6/" itemprop="url" rel="index"><span itemprop="name">数据科学</span></a>
         </span>
     </span>
 
@@ -530,14 +527,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>9.6k</span>
+      <span>6.8k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>9 分钟</span>
+      <span>6 分钟</span>
     </span>
 </div>
 
@@ -548,10 +545,11 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h1 id="ppt部分"><a href="#ppt部分" class="headerlink" title="ppt部分"></a>ppt部分</h1><h2 id="java基础"><a href="#java基础" class="headerlink" title="java基础"></a>java基础</h2><p>类内static方法可以被类名调用，对象定义方法只有对象能调用<br>当类不独立时，嵌套类很有用,并且显然隶属于另一个类。<br> ● 如果其他类不应该使用嵌套类，则将嵌套类设为私有类</p>
+          <p><a target="_blank" rel="noopener" href="http://www.numpy.org/">Numpy</a> 是 Python 中科学计算的核心库。 它提供了高性能的多维数组对象以及使用这些对象的工具 数组。</p>
+<h2 id="数组"><a href="#数组" class="headerlink" title="数组"></a>数组</h2><p>numpy 数组是一个值网格，所有值都具有相同的类型，并由非负整数组成的元组索引。 它的维度就是数组的秩 ；它的shape就是每个维度的大小组成的元组</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/10/06/61b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
+              <a class="btn" href="/2023/10/09/numpy/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -582,7 +580,7 @@ <h1 id="ppt部分"><a href="#ppt部分" class="headerlink" title="ppt部分"></a
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/05/cpp%20primer%20plus%E6%80%BB%E5%92%8C/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/06/61b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -600,7 +598,7 @@ <h1 id="ppt部分"><a href="#ppt部分" class="headerlink" title="ppt部分"></a
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/10/05/cpp%20primer%20plus%E6%80%BB%E5%92%8C/" class="post-title-link" itemprop="url">基于c++ primer plus的读书笔记</a>
+          <a href="/2023/10/06/61b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于伯克利cs61b的java数据结构笔记</a>
         </h2>
 
         <div class="post-meta-container">
@@ -612,14 +610,14 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">发表于</span>
 
-      <time title="创建时间：2023-10-05 22:45:42" itemprop="dateCreated datePublished" datetime="2023-10-05T22:45:42+08:00">2023-10-05</time>
+      <time title="创建时间：2023-10-06 23:01:27" itemprop="dateCreated datePublished" datetime="2023-10-06T23:01:27+08:00">2023-10-06</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:49:51" itemprop="dateModified" datetime="2023-10-14T20:49:51+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:42:36" itemprop="dateModified" datetime="2023-10-14T20:42:36+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -631,7 +629,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E5%85%B6%E4%BB%96/" itemprop="url" rel="index"><span itemprop="name">其他</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/" itemprop="url" rel="index"><span itemprop="name">数据结构与算法</span></a>
         </span>
     </span>
 
@@ -642,14 +640,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>5.8k</span>
+      <span>9.6k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>5 分钟</span>
+      <span>9 分钟</span>
     </span>
 </div>
 
@@ -660,11 +658,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h1 id="c语言部分"><a href="#c语言部分" class="headerlink" title="c语言部分"></a>c语言部分</h1><h2 id="基本函数构成"><a href="#基本函数构成" class="headerlink" title="基本函数构成"></a>基本函数构成</h2><p>将数组传递为函数参数</p>
-<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">int fcname(int arg[],int n)</span><br></pre></td></tr></table></figure>
+          <h1 id="ppt部分"><a href="#ppt部分" class="headerlink" title="ppt部分"></a>ppt部分</h1><h2 id="java基础"><a href="#java基础" class="headerlink" title="java基础"></a>java基础</h2><p>类内static方法可以被类名调用，对象定义方法只有对象能调用<br>当类不独立时，嵌套类很有用,并且显然隶属于另一个类。<br> ● 如果其他类不应该使用嵌套类，则将嵌套类设为私有类</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/10/05/cpp%20primer%20plus%E6%80%BB%E5%92%8C/#more" rel="contents">
+              <a class="btn" href="/2023/10/06/61b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -695,7 +692,7 @@ <h1 id="c语言部分"><a href="#c语言部分" class="headerlink" title="c语
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/05/%E5%BB%BA%E7%AB%99%E6%8C%87%E5%8C%97/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/05/cpp%20primer%20plus%E6%80%BB%E5%92%8C/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -713,7 +710,7 @@ <h1 id="c语言部分"><a href="#c语言部分" class="headerlink" title="c语
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/10/05/%E5%BB%BA%E7%AB%99%E6%8C%87%E5%8C%97/" class="post-title-link" itemprop="url">hexo建立个人博客指北</a>
+          <a href="/2023/10/05/cpp%20primer%20plus%E6%80%BB%E5%92%8C/" class="post-title-link" itemprop="url">基于c++ primer plus的读书笔记</a>
         </h2>
 
         <div class="post-meta-container">
@@ -724,9 +721,15 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar"></i>
       </span>
       <span class="post-meta-item-text">发表于</span>
-      
 
-      <time title="创建时间：2023-10-05 18:22:39 / 修改时间：19:53:06" itemprop="dateCreated datePublished" datetime="2023-10-05T18:22:39+08:00">2023-10-05</time>
+      <time title="创建时间：2023-10-05 22:45:42" itemprop="dateCreated datePublished" datetime="2023-10-05T22:45:42+08:00">2023-10-05</time>
+    </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-10-14 20:49:51" itemprop="dateModified" datetime="2023-10-14T20:49:51+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -734,7 +737,11 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">分类于</span>
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E5%BB%BA%E7%AB%99%E7%BB%8F%E9%AA%8C/" itemprop="url" rel="index"><span itemprop="name">建站经验</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/" itemprop="url" rel="index"><span itemprop="name">课程笔记</span></a>
+        </span>
+          ，
+        <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E5%85%B6%E4%BB%96/" itemprop="url" rel="index"><span itemprop="name">其他</span></a>
         </span>
     </span>
 
@@ -745,7 +752,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>5.9k</span>
+      <span>5.8k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
@@ -763,10 +770,11 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h1 id="概要"><a href="#概要" class="headerlink" title="概要"></a>概要</h1><p>本文用于简要阐释我个人关于使用hexo建个人博客的经验，和解释hexo的各种自定义功能，也可以说是我个人的备忘录。网上很多教程都是直接告诉你怎么做，这在建站时很方便，但如果你要自定义就要知道hexo是怎么自定义的，本文可以帮你对此有一些了解</p>
+          <h1 id="c语言部分"><a href="#c语言部分" class="headerlink" title="c语言部分"></a>c语言部分</h1><h2 id="基本函数构成"><a href="#基本函数构成" class="headerlink" title="基本函数构成"></a>基本函数构成</h2><p>将数组传递为函数参数</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">int fcname(int arg[],int n)</span><br></pre></td></tr></table></figure>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/10/05/%E5%BB%BA%E7%AB%99%E6%8C%87%E5%8C%97/#more" rel="contents">
+              <a class="btn" href="/2023/10/05/cpp%20primer%20plus%E6%80%BB%E5%92%8C/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -812,13 +820,13 @@ <h1 id="概要"><a href="#概要" class="headerlink" title="概要"></a>概要</
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/page/3/index.html b/page/3/index.html
index 22172abf0..3a8928a1a 100644
--- a/page/3/index.html
+++ b/page/3/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E6%B8%B8%E6%88%8F%E7%AE%80%E8%AF%84/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/10/05/%E5%BB%BA%E7%AB%99%E6%8C%87%E5%8C%97/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -262,7 +262,7 @@ <h1 class="site-title">thinklive</h1>
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/30/%E6%B8%B8%E6%88%8F%E7%AE%80%E8%AF%84/" class="post-title-link" itemprop="url">游戏简评</a>
+          <a href="/2023/10/05/%E5%BB%BA%E7%AB%99%E6%8C%87%E5%8C%97/" class="post-title-link" itemprop="url">hexo建立个人博客指北</a>
         </h2>
 
         <div class="post-meta-container">
@@ -273,15 +273,9 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar"></i>
       </span>
       <span class="post-meta-item-text">发表于</span>
+      
 
-      <time title="创建时间：2023-09-30 19:47:32" itemprop="dateCreated datePublished" datetime="2023-09-30T19:47:32+08:00">2023-09-30</time>
-    </span>
-    <span class="post-meta-item">
-      <span class="post-meta-item-icon">
-        <i class="far fa-calendar-check"></i>
-      </span>
-      <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:45:38" itemprop="dateModified" datetime="2023-10-14T20:45:38+08:00">2023-10-14</time>
+      <time title="创建时间：2023-10-05 18:22:39 / 修改时间：19:53:06" itemprop="dateCreated datePublished" datetime="2023-10-05T18:22:39+08:00">2023-10-05</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -289,11 +283,7 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">分类于</span>
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/" itemprop="url" rel="index"><span itemprop="name">游戏杂谈</span></a>
-        </span>
-          ，
-        <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/%E5%85%B6%E4%BB%96%E6%B8%B8%E6%88%8F/" itemprop="url" rel="index"><span itemprop="name">其他游戏</span></a>
+          <a href="/categories/%E5%BB%BA%E7%AB%99%E7%BB%8F%E9%AA%8C/" itemprop="url" rel="index"><span itemprop="name">建站经验</span></a>
         </span>
     </span>
 
@@ -304,14 +294,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>998</span>
+      <span>5.9k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>1 分钟</span>
+      <span>5 分钟</span>
     </span>
 </div>
 
@@ -322,10 +312,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h1 id="428被封锁的涩谷"><a href="#428被封锁的涩谷" class="headerlink" title="428被封锁的涩谷"></a>428被封锁的涩谷</h1><p>希腊神话将命运女神履行职能的过程写作织网，这无疑是一种极为贴切的比喻，对网状结构来说，在中心处的轻轻一拨，边缘处就是极大的震动，越是深入核心，就越是复杂，但所有分支无论看上去多么没有规律，最后都会收束到中心网点，我想这就是428的编剧想实现的叙事结构。</p>
+          <h1 id="概要"><a href="#概要" class="headerlink" title="概要"></a>概要</h1><p>本文用于简要阐释我个人关于使用hexo建个人博客的经验，和解释hexo的各种自定义功能，也可以说是我个人的备忘录。网上很多教程都是直接告诉你怎么做，这在建站时很方便，但如果你要自定义就要知道hexo是怎么自定义的，本文可以帮你对此有一些了解</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/30/%E6%B8%B8%E6%88%8F%E7%AE%80%E8%AF%84/#more" rel="contents">
+              <a class="btn" href="/2023/10/05/%E5%BB%BA%E7%AB%99%E6%8C%87%E5%8C%97/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -356,7 +346,7 @@ <h1 id="428被封锁的涩谷"><a href="#428被封锁的涩谷" class="headerlin
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E9%BE%99%E8%85%BE%E4%B8%96%E7%BA%AA/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E6%B8%B8%E6%88%8F%E7%AE%80%E8%AF%84/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -374,7 +364,7 @@ <h1 id="428被封锁的涩谷"><a href="#428被封锁的涩谷" class="headerlin
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/30/%E9%BE%99%E8%85%BE%E4%B8%96%E7%BA%AA/" class="post-title-link" itemprop="url">龙腾世纪三部曲</a>
+          <a href="/2023/09/30/%E6%B8%B8%E6%88%8F%E7%AE%80%E8%AF%84/" class="post-title-link" itemprop="url">游戏简评</a>
         </h2>
 
         <div class="post-meta-container">
@@ -386,14 +376,14 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">发表于</span>
 
-      <time title="创建时间：2023-09-30 19:45:00" itemprop="dateCreated datePublished" datetime="2023-09-30T19:45:00+08:00">2023-09-30</time>
+      <time title="创建时间：2023-09-30 19:47:32" itemprop="dateCreated datePublished" datetime="2023-09-30T19:47:32+08:00">2023-09-30</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:44:10" itemprop="dateModified" datetime="2023-10-14T20:44:10+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:45:38" itemprop="dateModified" datetime="2023-10-14T20:45:38+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -405,7 +395,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/wrpg/" itemprop="url" rel="index"><span itemprop="name">wrpg</span></a>
+          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/%E5%85%B6%E4%BB%96%E6%B8%B8%E6%88%8F/" itemprop="url" rel="index"><span itemprop="name">其他游戏</span></a>
         </span>
     </span>
 
@@ -416,14 +406,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>11k</span>
+      <span>998</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>10 分钟</span>
+      <span>1 分钟</span>
     </span>
 </div>
 
@@ -434,10 +424,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h1 id="dao"><a href="#dao" class="headerlink" title="dao"></a>dao</h1><p>本世纪的欧美rpg里最出名的应该是巫师三了，你可能曾因为好奇去搜过cdpr的发家史，也就是从卖盗版游戏到引进游戏并本土化赚到了第一桶金，这个引进的游戏是博德之门，博德之门的开发商是生软。</p>
+          <h1 id="428被封锁的涩谷"><a href="#428被封锁的涩谷" class="headerlink" title="428被封锁的涩谷"></a>428被封锁的涩谷</h1><p>希腊神话将命运女神履行职能的过程写作织网，这无疑是一种极为贴切的比喻，对网状结构来说，在中心处的轻轻一拨，边缘处就是极大的震动，越是深入核心，就越是复杂，但所有分支无论看上去多么没有规律，最后都会收束到中心网点，我想这就是428的编剧想实现的叙事结构。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/30/%E9%BE%99%E8%85%BE%E4%B8%96%E7%BA%AA/#more" rel="contents">
+              <a class="btn" href="/2023/09/30/%E6%B8%B8%E6%88%8F%E7%AE%80%E8%AF%84/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -468,7 +458,7 @@ <h1 id="dao"><a href="#dao" class="headerlink" title="dao"></a>dao</h1><p>本世
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E5%B7%AB%E5%B8%88%E4%BA%8C/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E9%BE%99%E8%85%BE%E4%B8%96%E7%BA%AA/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -486,7 +476,7 @@ <h1 id="dao"><a href="#dao" class="headerlink" title="dao"></a>dao</h1><p>本世
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/30/%E5%B7%AB%E5%B8%88%E4%BA%8C/" class="post-title-link" itemprop="url">被所有人遗忘的故事，巫师二之殇</a>
+          <a href="/2023/09/30/%E9%BE%99%E8%85%BE%E4%B8%96%E7%BA%AA/" class="post-title-link" itemprop="url">龙腾世纪三部曲</a>
         </h2>
 
         <div class="post-meta-container">
@@ -498,14 +488,14 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">发表于</span>
 
-      <time title="创建时间：2023-09-30 19:41:52" itemprop="dateCreated datePublished" datetime="2023-09-30T19:41:52+08:00">2023-09-30</time>
+      <time title="创建时间：2023-09-30 19:45:00" itemprop="dateCreated datePublished" datetime="2023-09-30T19:45:00+08:00">2023-09-30</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:45:01" itemprop="dateModified" datetime="2023-10-14T20:45:01+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:44:10" itemprop="dateModified" datetime="2023-10-14T20:44:10+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -528,14 +518,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>4.6k</span>
+      <span>11k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>4 分钟</span>
+      <span>10 分钟</span>
     </span>
 </div>
 
@@ -546,10 +536,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <p>熟悉我的朋友都知道，我本人是巫师系列的死忠，如果让我给rpg游戏做一个排行，我会把巫师放在第一位，有的人可能会说，巫师固然是rpg佳作，但在浩如烟海，名作辈出的rpg里可未必排的上号，又有的人可能会说，说这么多不过是“情怀党”的矫情而已。</p>
+          <h1 id="dao"><a href="#dao" class="headerlink" title="dao"></a>dao</h1><p>本世纪的欧美rpg里最出名的应该是巫师三了，你可能曾因为好奇去搜过cdpr的发家史，也就是从卖盗版游戏到引进游戏并本土化赚到了第一桶金，这个引进的游戏是博德之门，博德之门的开发商是生软。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/30/%E5%B7%AB%E5%B8%88%E4%BA%8C/#more" rel="contents">
+              <a class="btn" href="/2023/09/30/%E9%BE%99%E8%85%BE%E4%B8%96%E7%BA%AA/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -580,7 +570,7 @@ <h2 class="post-title" itemprop="name headline">
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E5%BD%B1%E5%AD%90%E5%B7%A5%E5%8E%82/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E5%B7%AB%E5%B8%88%E4%BA%8C/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -598,7 +588,7 @@ <h2 class="post-title" itemprop="name headline">
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/30/%E5%BD%B1%E5%AD%90%E5%B7%A5%E5%8E%82/" class="post-title-link" itemprop="url">影子工厂</a>
+          <a href="/2023/09/30/%E5%B7%AB%E5%B8%88%E4%BA%8C/" class="post-title-link" itemprop="url">被所有人遗忘的故事，巫师二之殇</a>
         </h2>
 
         <div class="post-meta-container">
@@ -610,14 +600,14 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">发表于</span>
 
-      <time title="创建时间：2023-09-30 19:38:04" itemprop="dateCreated datePublished" datetime="2023-09-30T19:38:04+08:00">2023-09-30</time>
+      <time title="创建时间：2023-09-30 19:41:52" itemprop="dateCreated datePublished" datetime="2023-09-30T19:41:52+08:00">2023-09-30</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:45:10" itemprop="dateModified" datetime="2023-10-14T20:45:10+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:45:01" itemprop="dateModified" datetime="2023-10-14T20:45:01+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -629,7 +619,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/%E7%8B%AC%E7%AB%8B%E6%B8%B8%E6%88%8F/" itemprop="url" rel="index"><span itemprop="name">独立游戏</span></a>
+          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/wrpg/" itemprop="url" rel="index"><span itemprop="name">wrpg</span></a>
         </span>
     </span>
 
@@ -640,14 +630,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>1.1k</span>
+      <span>4.6k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>1 分钟</span>
+      <span>4 分钟</span>
     </span>
 </div>
 
@@ -658,10 +648,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <p>我本以为影子工厂会如简介说的一样，会是杂糅诸多风格的悬疑风，故事的一开始也的确如此，时间穿越配合豪宅血腥谋杀的经典模式别有一番风味，不过结合前传一贯的发展，不难想象出而在这之后又回到了我们熟悉的时间轴环节，比较特殊的是，这次高瞰老师罕见地采用了正叙的方式，而且此次的故事出奇的平淡，尽管感情上依旧无比细腻，但几乎没有什么出乎意料地发展。</p>
+          <p>熟悉我的朋友都知道，我本人是巫师系列的死忠，如果让我给rpg游戏做一个排行，我会把巫师放在第一位，有的人可能会说，巫师固然是rpg佳作，但在浩如烟海，名作辈出的rpg里可未必排的上号，又有的人可能会说，说这么多不过是“情怀党”的矫情而已。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/30/%E5%BD%B1%E5%AD%90%E5%B7%A5%E5%8E%82/#more" rel="contents">
+              <a class="btn" href="/2023/09/30/%E5%B7%AB%E5%B8%88%E4%BA%8C/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -692,7 +682,7 @@ <h2 class="post-title" itemprop="name headline">
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E6%AD%A5%E8%A1%8C%E6%A8%A1%E6%8B%9F%E5%99%A8/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E5%BD%B1%E5%AD%90%E5%B7%A5%E5%8E%82/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -710,7 +700,7 @@ <h2 class="post-title" itemprop="name headline">
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/30/%E6%AD%A5%E8%A1%8C%E6%A8%A1%E6%8B%9F%E5%99%A8/" class="post-title-link" itemprop="url">游戏互动性的新探索——步行模拟器</a>
+          <a href="/2023/09/30/%E5%BD%B1%E5%AD%90%E5%B7%A5%E5%8E%82/" class="post-title-link" itemprop="url">影子工厂</a>
         </h2>
 
         <div class="post-meta-container">
@@ -722,14 +712,14 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">发表于</span>
 
-      <time title="创建时间：2023-09-30 19:35:13" itemprop="dateCreated datePublished" datetime="2023-09-30T19:35:13+08:00">2023-09-30</time>
+      <time title="创建时间：2023-09-30 19:38:04" itemprop="dateCreated datePublished" datetime="2023-09-30T19:38:04+08:00">2023-09-30</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:43:25" itemprop="dateModified" datetime="2023-10-14T20:43:25+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:45:10" itemprop="dateModified" datetime="2023-10-14T20:45:10+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -752,14 +742,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>5.4k</span>
+      <span>1.1k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>5 分钟</span>
+      <span>1 分钟</span>
     </span>
 </div>
 
@@ -770,10 +760,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <p>步行模拟器，在本视频中取操作只局限于步行和一些简单动作，主要获取信息的途径为阅读和观察的游戏，这是一种颇为先锋，也颇为小众的游戏类型，在其中有一些火到出圈的佳作，也有缺点明细的庸作，但都有着共性在其中，今天，我就用一个业余爱好者的身份来浅析一下这类游戏。</p>
+          <p>我本以为影子工厂会如简介说的一样，会是杂糅诸多风格的悬疑风，故事的一开始也的确如此，时间穿越配合豪宅血腥谋杀的经典模式别有一番风味，不过结合前传一贯的发展，不难想象出而在这之后又回到了我们熟悉的时间轴环节，比较特殊的是，这次高瞰老师罕见地采用了正叙的方式，而且此次的故事出奇的平淡，尽管感情上依旧无比细腻，但几乎没有什么出乎意料地发展。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/30/%E6%AD%A5%E8%A1%8C%E6%A8%A1%E6%8B%9F%E5%99%A8/#more" rel="contents">
+              <a class="btn" href="/2023/09/30/%E5%BD%B1%E5%AD%90%E5%B7%A5%E5%8E%82/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -819,13 +809,13 @@ <h2 class="post-title" itemprop="name headline">
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/page/4/index.html b/page/4/index.html
index ff28f2903..fa571c2ae 100644
--- a/page/4/index.html
+++ b/page/4/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E4%B8%8D%E4%BA%88%E6%92%AD%E5%87%BA/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E6%AD%A5%E8%A1%8C%E6%A8%A1%E6%8B%9F%E5%99%A8/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -262,7 +262,7 @@ <h1 class="site-title">thinklive</h1>
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/30/%E4%B8%8D%E4%BA%88%E6%92%AD%E5%87%BA/" class="post-title-link" itemprop="url">不予播出——极端意识形态大乱斗</a>
+          <a href="/2023/09/30/%E6%AD%A5%E8%A1%8C%E6%A8%A1%E6%8B%9F%E5%99%A8/" class="post-title-link" itemprop="url">游戏互动性的新探索——步行模拟器</a>
         </h2>
 
         <div class="post-meta-container">
@@ -274,14 +274,14 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">发表于</span>
 
-      <time title="创建时间：2023-09-30 19:29:37" itemprop="dateCreated datePublished" datetime="2023-09-30T19:29:37+08:00">2023-09-30</time>
+      <time title="创建时间：2023-09-30 19:35:13" itemprop="dateCreated datePublished" datetime="2023-09-30T19:35:13+08:00">2023-09-30</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:43:26" itemprop="dateModified" datetime="2023-10-14T20:43:26+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:43:25" itemprop="dateModified" datetime="2023-10-14T20:43:25+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -304,14 +304,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>2.8k</span>
+      <span>5.4k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>3 分钟</span>
+      <span>5 分钟</span>
     </span>
 </div>
 
@@ -322,10 +322,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <p>吉姆哈克：当一个国家走在下坡路上，必须有一个给它踩一脚油门。<br>你生活在一个贫富差距分化严重，外部国家敌意渐升的民主国家，而在此危难关头，一个名为先进党的政党，凭借集体主义的价值观，以及消灭富人扶持穷人的竞选纲领上了台，时代变换的帷幕在你面前缓缓拉开，这时，你能做什么呢？</p>
+          <p>步行模拟器，在本视频中取操作只局限于步行和一些简单动作，主要获取信息的途径为阅读和观察的游戏，这是一种颇为先锋，也颇为小众的游戏类型，在其中有一些火到出圈的佳作，也有缺点明细的庸作，但都有着共性在其中，今天，我就用一个业余爱好者的身份来浅析一下这类游戏。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/30/%E4%B8%8D%E4%BA%88%E6%92%AD%E5%87%BA/#more" rel="contents">
+              <a class="btn" href="/2023/09/30/%E6%AD%A5%E8%A1%8C%E6%A8%A1%E6%8B%9F%E5%99%A8/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -356,7 +356,7 @@ <h2 class="post-title" itemprop="name headline">
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E6%9D%80%E6%89%8B47/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E4%B8%8D%E4%BA%88%E6%92%AD%E5%87%BA/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -374,7 +374,7 @@ <h2 class="post-title" itemprop="name headline">
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/30/%E6%9D%80%E6%89%8B47/" class="post-title-link" itemprop="url">【杀手3争议】拟真性与游戏性之争</a>
+          <a href="/2023/09/30/%E4%B8%8D%E4%BA%88%E6%92%AD%E5%87%BA/" class="post-title-link" itemprop="url">不予播出——极端意识形态大乱斗</a>
         </h2>
 
         <div class="post-meta-container">
@@ -386,14 +386,14 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">发表于</span>
 
-      <time title="创建时间：2023-09-30 19:28:34" itemprop="dateCreated datePublished" datetime="2023-09-30T19:28:34+08:00">2023-09-30</time>
+      <time title="创建时间：2023-09-30 19:29:37" itemprop="dateCreated datePublished" datetime="2023-09-30T19:29:37+08:00">2023-09-30</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:44:27" itemprop="dateModified" datetime="2023-10-14T20:44:27+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:43:26" itemprop="dateModified" datetime="2023-10-14T20:43:26+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -405,7 +405,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/%E5%85%B6%E4%BB%96%E6%B8%B8%E6%88%8F/" itemprop="url" rel="index"><span itemprop="name">其他游戏</span></a>
+          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/%E7%8B%AC%E7%AB%8B%E6%B8%B8%E6%88%8F/" itemprop="url" rel="index"><span itemprop="name">独立游戏</span></a>
         </span>
     </span>
 
@@ -416,14 +416,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>1.5k</span>
+      <span>2.8k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>1 分钟</span>
+      <span>3 分钟</span>
     </span>
 </div>
 
@@ -434,10 +434,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <p>2022年一月份，杀手3将解除一周年的独占，登录steam，而早在21年初，杀手3就成了一款有点话题性的游戏，这是因为游戏的一张重庆的地图，这一地图因为缝合了赛博朋克，老大哥等元素被指责有乳制品嫌疑。</p>
+          <p>吉姆哈克：当一个国家走在下坡路上，必须有一个给它踩一脚油门。<br>你生活在一个贫富差距分化严重，外部国家敌意渐升的民主国家，而在此危难关头，一个名为先进党的政党，凭借集体主义的价值观，以及消灭富人扶持穷人的竞选纲领上了台，时代变换的帷幕在你面前缓缓拉开，这时，你能做什么呢？</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/30/%E6%9D%80%E6%89%8B47/#more" rel="contents">
+              <a class="btn" href="/2023/09/30/%E4%B8%8D%E4%BA%88%E6%92%AD%E5%87%BA/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -468,7 +468,7 @@ <h2 class="post-title" itemprop="name headline">
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/black%20souls%E5%89%A7%E6%83%85%E8%A7%A3%E6%9E%90/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/30/%E6%9D%80%E6%89%8B47/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -486,7 +486,7 @@ <h2 class="post-title" itemprop="name headline">
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/black%20souls%E5%89%A7%E6%83%85%E8%A7%A3%E6%9E%90/" class="post-title-link" itemprop="url">blacksouls剧情解析</a>
+          <a href="/2023/09/30/%E6%9D%80%E6%89%8B47/" class="post-title-link" itemprop="url">【杀手3争议】拟真性与游戏性之争</a>
         </h2>
 
         <div class="post-meta-container">
@@ -498,14 +498,14 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">发表于</span>
 
-      <time title="创建时间：2023-09-29 10:18:45" itemprop="dateCreated datePublished" datetime="2023-09-29T10:18:45+08:00">2023-09-29</time>
+      <time title="创建时间：2023-09-30 19:28:34" itemprop="dateCreated datePublished" datetime="2023-09-30T19:28:34+08:00">2023-09-30</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-09-19 13:09:43" itemprop="dateModified" datetime="2023-09-19T13:09:43+08:00">2023-09-19</time>
+      <time title="修改时间：2023-10-14 20:44:27" itemprop="dateModified" datetime="2023-10-14T20:44:27+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -517,7 +517,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/black-souls/" itemprop="url" rel="index"><span itemprop="name">black souls</span></a>
+          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/%E5%85%B6%E4%BB%96%E6%B8%B8%E6%88%8F/" itemprop="url" rel="index"><span itemprop="name">其他游戏</span></a>
         </span>
     </span>
 
@@ -528,14 +528,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>4.5k</span>
+      <span>1.5k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>4 分钟</span>
+      <span>1 分钟</span>
     </span>
 </div>
 
@@ -546,10 +546,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h1 id="冬之钟"><a href="#冬之钟" class="headerlink" title="冬之钟"></a>冬之钟</h1><p>由于black souls的故事远远没有完结，因此现阶段我们很难对<code>红白女王</code>与<code>梅贝尔</code>这些与格林牵扯极深的支配者们进行什么定论，只能就已有的剧情和文本进行一些归纳，本期视频我将就bs2比较难懂的一处地方，冬之钟的主线事件，进行一些个人向的分析。</p>
+          <p>2022年一月份，杀手3将解除一周年的独占，登录steam，而早在21年初，杀手3就成了一款有点话题性的游戏，这是因为游戏的一张重庆的地图，这一地图因为缝合了赛博朋克，老大哥等元素被指责有乳制品嫌疑。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/black%20souls%E5%89%A7%E6%83%85%E8%A7%A3%E6%9E%90/#more" rel="contents">
+              <a class="btn" href="/2023/09/30/%E6%9D%80%E6%89%8B47/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -580,7 +580,7 @@ <h1 id="冬之钟"><a href="#冬之钟" class="headerlink" title="冬之钟"></a
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/cs106l%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/black%20souls%E5%89%A7%E6%83%85%E8%A7%A3%E6%9E%90/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -598,7 +598,7 @@ <h1 id="冬之钟"><a href="#冬之钟" class="headerlink" title="冬之钟"></a
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/cs106l%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于斯坦福cs106l的c++编程规范笔记</a>
+          <a href="/2023/09/29/black%20souls%E5%89%A7%E6%83%85%E8%A7%A3%E6%9E%90/" class="post-title-link" itemprop="url">blacksouls剧情解析</a>
         </h2>
 
         <div class="post-meta-container">
@@ -617,7 +617,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:47:05" itemprop="dateModified" datetime="2023-10-14T20:47:05+08:00">2023-10-14</time>
+      <time title="修改时间：2023-09-19 13:09:43" itemprop="dateModified" datetime="2023-09-19T13:09:43+08:00">2023-09-19</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -625,11 +625,11 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">分类于</span>
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/" itemprop="url" rel="index"><span itemprop="name">课程笔记</span></a>
+          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/" itemprop="url" rel="index"><span itemprop="name">游戏杂谈</span></a>
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/" itemprop="url" rel="index"><span itemprop="name">数据结构与算法</span></a>
+          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/black-souls/" itemprop="url" rel="index"><span itemprop="name">black souls</span></a>
         </span>
     </span>
 
@@ -640,14 +640,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>3.2k</span>
+      <span>4.5k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>3 分钟</span>
+      <span>4 分钟</span>
     </span>
 </div>
 
@@ -658,11 +658,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h2 id="c-特性"><a href="#c-特性" class="headerlink" title="c++特性"></a>c++特性</h2><ul>
-<li>更好的C<br>C++支持<code>命令式编程</code>，一种编程风格，其中程序按顺序执行的命令序列。从这个意义上讲，C++ 可以看作是对C 编程语言，使日常命令式编程更加直观和更容易使用。课程阅读器的这一部分介绍了一些 C++ 最常用的库,包括标准模板库，并展示了如何使用这些库来构建命令程式。 此外，它探索了最初出现在 C++ 语言中的新原语。C 编程语言，即指针、C 字符串和预处理器。
+          <h1 id="冬之钟"><a href="#冬之钟" class="headerlink" title="冬之钟"></a>冬之钟</h1><p>由于black souls的故事远远没有完结，因此现阶段我们很难对<code>红白女王</code>与<code>梅贝尔</code>这些与格林牵扯极深的支配者们进行什么定论，只能就已有的剧情和文本进行一些归纳，本期视频我将就bs2比较难懂的一处地方，冬之钟的主线事件，进行一些个人向的分析。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/cs106l%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/black%20souls%E5%89%A7%E6%83%85%E8%A7%A3%E6%9E%90/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -693,7 +692,7 @@ <h2 id="c-特性"><a href="#c-特性" class="headerlink" title="c++特性"></a>c
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/jupyter%20notebook/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/cs106l%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -711,7 +710,7 @@ <h2 id="c-特性"><a href="#c-特性" class="headerlink" title="c++特性"></a>c
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/jupyter%20notebook/" class="post-title-link" itemprop="url">基于伯克利ds100的数据科学笔记pandas部分</a>
+          <a href="/2023/09/29/cs106l%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于斯坦福cs106l的c++编程规范笔记</a>
         </h2>
 
         <div class="post-meta-container">
@@ -730,7 +729,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:47:24" itemprop="dateModified" datetime="2023-10-14T20:47:24+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:47:05" itemprop="dateModified" datetime="2023-10-14T20:47:05+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -742,7 +741,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%A7%91%E5%AD%A6/" itemprop="url" rel="index"><span itemprop="name">数据科学</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/" itemprop="url" rel="index"><span itemprop="name">数据结构与算法</span></a>
         </span>
     </span>
 
@@ -753,14 +752,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>4.2k</span>
+      <span>3.2k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>4 分钟</span>
+      <span>3 分钟</span>
     </span>
 </div>
 
@@ -771,19 +770,11 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h2 id="notebook"><a href="#notebook" class="headerlink" title="notebook"></a>notebook</h2><ol>
-<li><code>Ctrl</code> + <code>Return</code>（或者 <code>Cmd</code> + <code>Return</code>在 Mac 上）： <em>评估当前单元格</em></li>
-<li><code>Shift</code> + <code>Return</code>： <em>评估当前单元格并移至下一个单元格</em></li>
-<li><code>ESC</code>： <em>命令模式</em> （在使用以下任何命令之前可能需要按）</li>
-<li><code>a</code>: <em>在上面创建一个单元格</em></li>
-<li><code>b</code>： <em>在下面创建一个单元格</em></li>
-<li><code>dd</code>: <em>删除一个单元格</em></li>
-<li><code>z</code>： <em>撤消上一次单元格操作</em></li>
-<li><code>m</code>： <em>将单元格转换为 Markdown</em></li>
-<li><code>y</code>： <em>将单元格转换为代码</em>
+          <h2 id="c-特性"><a href="#c-特性" class="headerlink" title="c++特性"></a>c++特性</h2><ul>
+<li>更好的C<br>C++支持<code>命令式编程</code>，一种编程风格，其中程序按顺序执行的命令序列。从这个意义上讲，C++ 可以看作是对C 编程语言，使日常命令式编程更加直观和更容易使用。课程阅读器的这一部分介绍了一些 C++ 最常用的库,包括标准模板库，并展示了如何使用这些库来构建命令程式。 此外，它探索了最初出现在 C++ 语言中的新原语。C 编程语言，即指针、C 字符串和预处理器。
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/jupyter%20notebook/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/cs106l%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -829,13 +820,13 @@ <h2 id="notebook"><a href="#notebook" class="headerlink" title="notebook"></a>no
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/page/5/index.html b/page/5/index.html
index 5dc6a64b9..217402956 100644
--- a/page/5/index.html
+++ b/page/5/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/vim%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/jupyter%20notebook/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -262,7 +262,7 @@ <h1 class="site-title">thinklive</h1>
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/vim%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于北大前沿计算实践课和missing semester的vim笔记</a>
+          <a href="/2023/09/29/jupyter%20notebook/" class="post-title-link" itemprop="url">基于伯克利ds100的数据科学笔记pandas部分</a>
         </h2>
 
         <div class="post-meta-container">
@@ -281,7 +281,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:48:55" itemprop="dateModified" datetime="2023-10-14T20:48:55+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:47:24" itemprop="dateModified" datetime="2023-10-14T20:47:24+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -293,7 +293,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E5%85%B6%E4%BB%96/" itemprop="url" rel="index"><span itemprop="name">其他</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%A7%91%E5%AD%A6/" itemprop="url" rel="index"><span itemprop="name">数据科学</span></a>
         </span>
     </span>
 
@@ -304,14 +304,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>3.7k</span>
+      <span>4.2k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>3 分钟</span>
+      <span>4 分钟</span>
     </span>
 </div>
 
@@ -322,10 +322,19 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h1 id="you-are-your-dotfiles"><a href="#you-are-your-dotfiles" class="headerlink" title="you are your dotfiles"></a>you are your dotfiles</h1><h2 id="帮助"><a href="#帮助" class="headerlink" title="帮助"></a>帮助</h2><p>按f1或命令行输入help开启在线帮助<br>&lt;Cw&gt;切换到另一个窗口q关闭窗口</p>
+          <h2 id="notebook"><a href="#notebook" class="headerlink" title="notebook"></a>notebook</h2><ol>
+<li><code>Ctrl</code> + <code>Return</code>（或者 <code>Cmd</code> + <code>Return</code>在 Mac 上）： <em>评估当前单元格</em></li>
+<li><code>Shift</code> + <code>Return</code>： <em>评估当前单元格并移至下一个单元格</em></li>
+<li><code>ESC</code>： <em>命令模式</em> （在使用以下任何命令之前可能需要按）</li>
+<li><code>a</code>: <em>在上面创建一个单元格</em></li>
+<li><code>b</code>： <em>在下面创建一个单元格</em></li>
+<li><code>dd</code>: <em>删除一个单元格</em></li>
+<li><code>z</code>： <em>撤消上一次单元格操作</em></li>
+<li><code>m</code>： <em>将单元格转换为 Markdown</em></li>
+<li><code>y</code>： <em>将单元格转换为代码</em>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/vim%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/jupyter%20notebook/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -356,7 +365,7 @@ <h1 id="you-are-your-dotfiles"><a href="#you-are-your-dotfiles" class="headerlin
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89rpg%E8%AE%BE%E5%AE%9A%E9%9B%86/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/vim%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -374,7 +383,7 @@ <h1 id="you-are-your-dotfiles"><a href="#you-are-your-dotfiles" class="headerlin
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89rpg%E8%AE%BE%E5%AE%9A%E9%9B%86/" class="post-title-link" itemprop="url">迪瑞克拉rpg设定集</a>
+          <a href="/2023/09/29/vim%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于北大前沿计算实践课和missing semester的vim笔记</a>
         </h2>
 
         <div class="post-meta-container">
@@ -393,7 +402,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-09-19 19:22:33" itemprop="dateModified" datetime="2023-09-19T19:22:33+08:00">2023-09-19</time>
+      <time title="修改时间：2023-10-14 20:48:55" itemprop="dateModified" datetime="2023-10-14T20:48:55+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -401,7 +410,11 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">分类于</span>
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89/" itemprop="url" rel="index"><span itemprop="name">迪瑞克拉</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/" itemprop="url" rel="index"><span itemprop="name">课程笔记</span></a>
+        </span>
+          ，
+        <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E5%85%B6%E4%BB%96/" itemprop="url" rel="index"><span itemprop="name">其他</span></a>
         </span>
     </span>
 
@@ -412,14 +425,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>1.4k</span>
+      <span>3.7k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>1 分钟</span>
+      <span>3 分钟</span>
     </span>
 </div>
 
@@ -430,10 +443,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h1 id="队友"><a href="#队友" class="headerlink" title="队友"></a>队友</h1><h2 id="雷克"><a href="#雷克" class="headerlink" title="雷克"></a>雷克</h2><p>帝国法律系学生，成长于如今兄弟会的前身，幼时被走投无路的父母托付给了盗贼兄弟会，并经受了盗贼训练，随后由于帝国发展进程，盗贼兄弟会决定洗白自己，于是选拔了手下聪明的学徒接受高等教育并改名兄弟会，雷克就是其中的佼佼者。</p>
+          <h1 id="you-are-your-dotfiles"><a href="#you-are-your-dotfiles" class="headerlink" title="you are your dotfiles"></a>you are your dotfiles</h1><h2 id="帮助"><a href="#帮助" class="headerlink" title="帮助"></a>帮助</h2><p>按f1或命令行输入help开启在线帮助<br>&lt;Cw&gt;切换到另一个窗口q关闭窗口</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89rpg%E8%AE%BE%E5%AE%9A%E9%9B%86/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/vim%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -464,7 +477,7 @@ <h1 id="队友"><a href="#队友" class="headerlink" title="队友"></a>队友</
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E4%B8%96%E7%95%8C%E8%A7%82/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89rpg%E8%AE%BE%E5%AE%9A%E9%9B%86/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -482,7 +495,7 @@ <h1 id="队友"><a href="#队友" class="headerlink" title="队友"></a>队友</
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E4%B8%96%E7%95%8C%E8%A7%82/" class="post-title-link" itemprop="url">迪瑞克拉世界观设定集</a>
+          <a href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89rpg%E8%AE%BE%E5%AE%9A%E9%9B%86/" class="post-title-link" itemprop="url">迪瑞克拉rpg设定集</a>
         </h2>
 
         <div class="post-meta-container">
@@ -501,7 +514,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-09-19 19:22:28" itemprop="dateModified" datetime="2023-09-19T19:22:28+08:00">2023-09-19</time>
+      <time title="修改时间：2023-09-19 19:22:33" itemprop="dateModified" datetime="2023-09-19T19:22:33+08:00">2023-09-19</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -520,14 +533,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>2.9k</span>
+      <span>1.4k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>3 分钟</span>
+      <span>1 分钟</span>
     </span>
 </div>
 
@@ -538,12 +551,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">起初，世界是一团思索，它向所有的方向迈了一步，于是万物由此而生……</span><br></pre></td></tr></table></figure>
-
-<p>  这是邪神辛克莱温教徒传颂的创世神话，也是目前为止我们所知最早的创世神话，可以说后世诸多关于创世的传说都有它的影子。</p>
+          <h1 id="队友"><a href="#队友" class="headerlink" title="队友"></a>队友</h1><h2 id="雷克"><a href="#雷克" class="headerlink" title="雷克"></a>雷克</h2><p>帝国法律系学生，成长于如今兄弟会的前身，幼时被走投无路的父母托付给了盗贼兄弟会，并经受了盗贼训练，随后由于帝国发展进程，盗贼兄弟会决定洗白自己，于是选拔了手下聪明的学徒接受高等教育并改名兄弟会，雷克就是其中的佼佼者。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E4%B8%96%E7%95%8C%E8%A7%82/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89rpg%E8%AE%BE%E5%AE%9A%E9%9B%86/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -574,7 +585,7 @@ <h2 class="post-title" itemprop="name headline">
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E8%BD%B6%E4%BA%8B%E9%9B%86/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E4%B8%96%E7%95%8C%E8%A7%82/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -592,7 +603,7 @@ <h2 class="post-title" itemprop="name headline">
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E8%BD%B6%E4%BA%8B%E9%9B%86/" class="post-title-link" itemprop="url">迪瑞克拉世界观轶事集</a>
+          <a href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E4%B8%96%E7%95%8C%E8%A7%82/" class="post-title-link" itemprop="url">迪瑞克拉世界观设定集</a>
         </h2>
 
         <div class="post-meta-container">
@@ -611,7 +622,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-09-19 19:23:25" itemprop="dateModified" datetime="2023-09-19T19:23:25+08:00">2023-09-19</time>
+      <time title="修改时间：2023-09-19 19:22:28" itemprop="dateModified" datetime="2023-09-19T19:22:28+08:00">2023-09-19</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -630,14 +641,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>2.4k</span>
+      <span>2.9k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>2 分钟</span>
+      <span>3 分钟</span>
     </span>
 </div>
 
@@ -648,10 +659,12 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h2 id="泰特斯"><a href="#泰特斯" class="headerlink" title="泰特斯"></a>泰特斯</h2><p>正如童话故事常见的开头一样，泰特斯是个贫穷而有志气的青年，有一天当他在王国的大街上闲逛时，他遇到了公主的轿子，年轻的泰特斯对美丽淑慧的公主一见钟情，他下定决心一定要当上王国的驸马爷。</p>
+          <figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">起初，世界是一团思索，它向所有的方向迈了一步，于是万物由此而生……</span><br></pre></td></tr></table></figure>
+
+<p>  这是邪神辛克莱温教徒传颂的创世神话，也是目前为止我们所知最早的创世神话，可以说后世诸多关于创世的传说都有它的影子。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E8%BD%B6%E4%BA%8B%E9%9B%86/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E4%B8%96%E7%95%8C%E8%A7%82/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -682,7 +695,7 @@ <h2 id="泰特斯"><a href="#泰特斯" class="headerlink" title="泰特斯"></a
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/black%20souls%E4%BA%BA%E7%89%A9%E8%A7%A3%E6%9E%90/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E8%BD%B6%E4%BA%8B%E9%9B%86/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -700,7 +713,7 @@ <h2 id="泰特斯"><a href="#泰特斯" class="headerlink" title="泰特斯"></a
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/black%20souls%E4%BA%BA%E7%89%A9%E8%A7%A3%E6%9E%90/" class="post-title-link" itemprop="url">blacksouls人物解析</a>
+          <a href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E8%BD%B6%E4%BA%8B%E9%9B%86/" class="post-title-link" itemprop="url">迪瑞克拉世界观轶事集</a>
         </h2>
 
         <div class="post-meta-container">
@@ -719,7 +732,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-09-22 08:05:07" itemprop="dateModified" datetime="2023-09-22T08:05:07+08:00">2023-09-22</time>
+      <time title="修改时间：2023-09-19 19:23:25" itemprop="dateModified" datetime="2023-09-19T19:23:25+08:00">2023-09-19</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -727,11 +740,7 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">分类于</span>
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/" itemprop="url" rel="index"><span itemprop="name">游戏杂谈</span></a>
-        </span>
-          ，
-        <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/black-souls/" itemprop="url" rel="index"><span itemprop="name">black souls</span></a>
+          <a href="/categories/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89/" itemprop="url" rel="index"><span itemprop="name">迪瑞克拉</span></a>
         </span>
     </span>
 
@@ -742,14 +751,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>7.1k</span>
+      <span>2.4k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>6 分钟</span>
+      <span>2 分钟</span>
     </span>
 </div>
 
@@ -760,11 +769,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h1 id="尸龙贾巴沃克"><a href="#尸龙贾巴沃克" class="headerlink" title="尸龙贾巴沃克"></a>尸龙贾巴沃克</h1><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">在天之繁星哟！命数已定之众哟！尽管去为爱所煎熬吧，为嫉妒之苦吧！呜呼！感激涕零吧！为这幸灾乐祸暗黑舞台点缀色彩就好！！！</span><br></pre></td></tr></table></figure>
-<p>象征着腐败与神秘的紫黑色，遍布全身的缝合痕迹与绷带，恶魔一样的卷曲角，晦暗如死尸的肤色，以及左眼燃烧着的灵魂之火（致敬黑岩射手可能性微存），<code>尸龙</code>姐姐的人物形象无时无刻不在传达着神秘强大而阴暗的气氛，本视频将对<code>尸龙</code>的整个人物进行解析</p>
+          <h2 id="泰特斯"><a href="#泰特斯" class="headerlink" title="泰特斯"></a>泰特斯</h2><p>正如童话故事常见的开头一样，泰特斯是个贫穷而有志气的青年，有一天当他在王国的大街上闲逛时，他遇到了公主的轿子，年轻的泰特斯对美丽淑慧的公主一见钟情，他下定决心一定要当上王国的驸马爷。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/black%20souls%E4%BA%BA%E7%89%A9%E8%A7%A3%E6%9E%90/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/%E8%BF%AA%E7%91%9E%E5%85%8B%E6%8B%89%E8%BD%B6%E4%BA%8B%E9%9B%86/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -810,13 +818,13 @@ <h1 id="尸龙贾巴沃克"><a href="#尸龙贾巴沃克" class="headerlink" tit
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/page/6/index.html b/page/6/index.html
index c8782eacb..c1386ad40 100644
--- a/page/6/index.html
+++ b/page/6/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -244,7 +244,7 @@ <h1 class="site-title">thinklive</h1>
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/cs106b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/black%20souls%E4%BA%BA%E7%89%A9%E8%A7%A3%E6%9E%90/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -262,7 +262,7 @@ <h1 class="site-title">thinklive</h1>
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/cs106b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于斯坦福cs106b的c++数据结构笔记</a>
+          <a href="/2023/09/29/black%20souls%E4%BA%BA%E7%89%A9%E8%A7%A3%E6%9E%90/" class="post-title-link" itemprop="url">blacksouls人物解析</a>
         </h2>
 
         <div class="post-meta-container">
@@ -281,7 +281,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:45:59" itemprop="dateModified" datetime="2023-10-14T20:45:59+08:00">2023-10-14</time>
+      <time title="修改时间：2023-09-22 08:05:07" itemprop="dateModified" datetime="2023-09-22T08:05:07+08:00">2023-09-22</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -289,11 +289,11 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">分类于</span>
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/" itemprop="url" rel="index"><span itemprop="name">课程笔记</span></a>
+          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/" itemprop="url" rel="index"><span itemprop="name">游戏杂谈</span></a>
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/" itemprop="url" rel="index"><span itemprop="name">数据结构与算法</span></a>
+          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/black-souls/" itemprop="url" rel="index"><span itemprop="name">black souls</span></a>
         </span>
     </span>
 
@@ -304,14 +304,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>17k</span>
+      <span>7.1k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>15 分钟</span>
+      <span>6 分钟</span>
     </span>
 </div>
 
@@ -322,10 +322,11 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h2 id="一些查找和排序算法"><a href="#一些查找和排序算法" class="headerlink" title="一些查找和排序算法"></a>一些查找和排序算法</h2><p>二分查找法<br><img src="/images/obsidian/20230226101843.png" alt="图片" title="image"><br>最坏情况：log2n</p>
+          <h1 id="尸龙贾巴沃克"><a href="#尸龙贾巴沃克" class="headerlink" title="尸龙贾巴沃克"></a>尸龙贾巴沃克</h1><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">在天之繁星哟！命数已定之众哟！尽管去为爱所煎熬吧，为嫉妒之苦吧！呜呼！感激涕零吧！为这幸灾乐祸暗黑舞台点缀色彩就好！！！</span><br></pre></td></tr></table></figure>
+<p>象征着腐败与神秘的紫黑色，遍布全身的缝合痕迹与绷带，恶魔一样的卷曲角，晦暗如死尸的肤色，以及左眼燃烧着的灵魂之火（致敬黑岩射手可能性微存），<code>尸龙</code>姐姐的人物形象无时无刻不在传达着神秘强大而阴暗的气氛，本视频将对<code>尸龙</code>的整个人物进行解析</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/cs106b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/black%20souls%E4%BA%BA%E7%89%A9%E8%A7%A3%E6%9E%90/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -356,7 +357,7 @@ <h2 id="一些查找和排序算法"><a href="#一些查找和排序算法" clas
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/61a%E6%80%BB%E5%92%8C/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/cs106b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -374,7 +375,7 @@ <h2 id="一些查找和排序算法"><a href="#一些查找和排序算法" clas
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/61a%E6%80%BB%E5%92%8C/" class="post-title-link" itemprop="url">基于伯克利cs61a的python笔记</a>
+          <a href="/2023/09/29/cs106b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于斯坦福cs106b的c++数据结构笔记</a>
         </h2>
 
         <div class="post-meta-container">
@@ -393,7 +394,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:42:43" itemprop="dateModified" datetime="2023-10-14T20:42:43+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:45:59" itemprop="dateModified" datetime="2023-10-14T20:45:59+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -416,14 +417,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>18k</span>
+      <span>17k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>17 分钟</span>
+      <span>15 分钟</span>
     </span>
 </div>
 
@@ -434,10 +435,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h2 id="python语言特性"><a href="#python语言特性" class="headerlink" title="python语言特性"></a>python语言特性</h2><h3 id="函数"><a href="#函数" class="headerlink" title="函数"></a>函数</h3><p>名称也可以与函数绑定。例如，名称 <code>max</code> 就和我们之前使用的 <code>max</code> 函数进行了绑定。与数字不同，函数很难以文本呈现，因此当询问一个函数时，Python 会打印一个标识来描述：</p>
+          <h2 id="一些查找和排序算法"><a href="#一些查找和排序算法" class="headerlink" title="一些查找和排序算法"></a>一些查找和排序算法</h2><p>二分查找法<br><img src="/images/obsidian/20230226101843.png" alt="图片" title="image"><br>最坏情况：log2n</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/61a%E6%80%BB%E5%92%8C/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/cs106b%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -468,7 +469,7 @@ <h2 id="python语言特性"><a href="#python语言特性" class="headerlink" tit
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/blacksouls%E5%8E%9F%E8%91%97%E6%A2%97%E8%A7%A3%E6%9E%90/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/61a%E6%80%BB%E5%92%8C/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -486,7 +487,7 @@ <h2 id="python语言特性"><a href="#python语言特性" class="headerlink" tit
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/blacksouls%E5%8E%9F%E8%91%97%E6%A2%97%E8%A7%A3%E6%9E%90/" class="post-title-link" itemprop="url">blacksouls原著梗解析</a>
+          <a href="/2023/09/29/61a%E6%80%BB%E5%92%8C/" class="post-title-link" itemprop="url">基于伯克利cs61a的python笔记</a>
         </h2>
 
         <div class="post-meta-container">
@@ -505,7 +506,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-09-30 19:27:29" itemprop="dateModified" datetime="2023-09-30T19:27:29+08:00">2023-09-30</time>
+      <time title="修改时间：2023-10-14 20:42:43" itemprop="dateModified" datetime="2023-10-14T20:42:43+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -513,11 +514,11 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">分类于</span>
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/" itemprop="url" rel="index"><span itemprop="name">游戏杂谈</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/" itemprop="url" rel="index"><span itemprop="name">课程笔记</span></a>
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/black-souls/" itemprop="url" rel="index"><span itemprop="name">black souls</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/" itemprop="url" rel="index"><span itemprop="name">数据结构与算法</span></a>
         </span>
     </span>
 
@@ -528,14 +529,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>13k</span>
+      <span>18k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>12 分钟</span>
+      <span>17 分钟</span>
     </span>
 </div>
 
@@ -546,10 +547,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h1 id="01"><a href="#01" class="headerlink" title="01"></a>01</h1><p>众所周知，black souls的原型，或者说最重要的灵感来源就是爱丽丝梦游仙境以及它衍生的爱丽丝镜中奇遇，我本人一直对游戏和原著的对应关系感到很好奇，但由于工作量很大，一直没下定决心做这件事，但最近突然想到，如果分期做一些整理会不会就没那么麻烦了呢，于是决定开启这个系列。</p>
+          <h2 id="python语言特性"><a href="#python语言特性" class="headerlink" title="python语言特性"></a>python语言特性</h2><h3 id="函数"><a href="#函数" class="headerlink" title="函数"></a>函数</h3><p>名称也可以与函数绑定。例如，名称 <code>max</code> 就和我们之前使用的 <code>max</code> 函数进行了绑定。与数字不同，函数很难以文本呈现，因此当询问一个函数时，Python 会打印一个标识来描述：</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/blacksouls%E5%8E%9F%E8%91%97%E6%A2%97%E8%A7%A3%E6%9E%90/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/61a%E6%80%BB%E5%92%8C/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -580,7 +581,7 @@ <h1 id="01"><a href="#01" class="headerlink" title="01"></a>01</h1><p>众所周
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/linux%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/blacksouls%E5%8E%9F%E8%91%97%E6%A2%97%E8%A7%A3%E6%9E%90/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -598,7 +599,7 @@ <h1 id="01"><a href="#01" class="headerlink" title="01"></a>01</h1><p>众所周
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/linux%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于北大前沿计算实践课和missing semester的linux等编程工具笔记</a>
+          <a href="/2023/09/29/blacksouls%E5%8E%9F%E8%91%97%E6%A2%97%E8%A7%A3%E6%9E%90/" class="post-title-link" itemprop="url">blacksouls原著梗解析</a>
         </h2>
 
         <div class="post-meta-container">
@@ -617,7 +618,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:47:38" itemprop="dateModified" datetime="2023-10-14T20:47:38+08:00">2023-10-14</time>
+      <time title="修改时间：2023-09-30 19:27:29" itemprop="dateModified" datetime="2023-09-30T19:27:29+08:00">2023-09-30</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -625,11 +626,11 @@ <h2 class="post-title" itemprop="name headline">
       </span>
       <span class="post-meta-item-text">分类于</span>
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/" itemprop="url" rel="index"><span itemprop="name">课程笔记</span></a>
+          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/" itemprop="url" rel="index"><span itemprop="name">游戏杂谈</span></a>
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/" itemprop="url" rel="index"><span itemprop="name">操作系统</span></a>
+          <a href="/categories/%E6%B8%B8%E6%88%8F%E6%9D%82%E8%B0%88/black-souls/" itemprop="url" rel="index"><span itemprop="name">black souls</span></a>
         </span>
     </span>
 
@@ -640,14 +641,14 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>18k</span>
+      <span>13k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
         <i class="far fa-clock"></i>
       </span>
       <span class="post-meta-item-text">阅读时长 &asymp;</span>
-      <span>17 分钟</span>
+      <span>12 分钟</span>
     </span>
 </div>
 
@@ -658,14 +659,10 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <h2 id="简介"><a href="#简介" class="headerlink" title="简介"></a>简介</h2><p><a target="_blank" rel="noopener" href="https://en.wikipedia.org/wiki/Linux">Linux</a>是一群<strong>开源</strong>的、基于<strong>Linux内核</strong>的<strong>类Unix操作系统</strong>集合。</p>
-<ul>
-<li>操作系统(operating system)：管理计算机硬件和软件资源的程序，为用户程序提供硬件抽象和接口。</li>
-<li>操作系统内核(operating system kernel)：操作系统最核心的部分，管理系统的进程、内存、设备驱动程序、文件和网络系统，一直在内存中，不包括图形界面、Shell等功能</li>
-<li>Shell：内核的封装，为用户提供更高级的抽象，比如<code>echo</code>、<code>ls</code>、<code>cd</code>等命令，以及进程间通信功能（管道）
+          <h1 id="01"><a href="#01" class="headerlink" title="01"></a>01</h1><p>众所周知，black souls的原型，或者说最重要的灵感来源就是爱丽丝梦游仙境以及它衍生的爱丽丝镜中奇遇，我本人一直对游戏和原著的对应关系感到很好奇，但由于工作量很大，一直没下定决心做这件事，但最近突然想到，如果分期做一些整理会不会就没那么麻烦了呢，于是决定开启这个系列。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/linux%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/blacksouls%E5%8E%9F%E8%91%97%E6%A2%97%E8%A7%A3%E6%9E%90/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -696,7 +693,7 @@ <h2 id="简介"><a href="#简介" class="headerlink" title="简介"></a>简介</
   
 
   <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/%E7%A1%AC%E4%BB%B6%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/linux%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
 
     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
       <meta itemprop="image" content="/images/thive.png">
@@ -714,7 +711,7 @@ <h2 id="简介"><a href="#简介" class="headerlink" title="简介"></a>简介</
     </span>
       <header class="post-header">
         <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/09/29/%E7%A1%AC%E4%BB%B6%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于苏大ppt的计算机硬件笔记</a>
+          <a href="/2023/09/29/linux%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于北大前沿计算实践课和missing semester的linux等编程工具笔记</a>
         </h2>
 
         <div class="post-meta-container">
@@ -733,7 +730,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-14 20:45:28" itemprop="dateModified" datetime="2023-10-14T20:45:28+08:00">2023-10-14</time>
+      <time title="修改时间：2023-10-14 20:47:38" itemprop="dateModified" datetime="2023-10-14T20:47:38+08:00">2023-10-14</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -745,7 +742,7 @@ <h2 class="post-title" itemprop="name headline">
         </span>
           ，
         <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
-          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E8%AE%A1%E7%BB%84/" itemprop="url" rel="index"><span itemprop="name">计组</span></a>
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/" itemprop="url" rel="index"><span itemprop="name">操作系统</span></a>
         </span>
     </span>
 
@@ -756,7 +753,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-file-word"></i>
       </span>
       <span class="post-meta-item-text">本文字数：</span>
-      <span>19k</span>
+      <span>18k</span>
     </span>
     <span class="post-meta-item" title="阅读时长">
       <span class="post-meta-item-icon">
@@ -774,10 +771,14 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          <p>&#96;冯·诺依曼计算机特点<br>– 计算机由五大部件组成<br>• 输入数据和程序的“输入设备”<br>• 记忆程序和数据的“存储器”<br>• 完成数据加工处理的“运算器”<br>• 控制程序执行的“控制器”<br>• 输出处理结果的“输出设备”  </p>
+          <h2 id="简介"><a href="#简介" class="headerlink" title="简介"></a>简介</h2><p><a target="_blank" rel="noopener" href="https://en.wikipedia.org/wiki/Linux">Linux</a>是一群<strong>开源</strong>的、基于<strong>Linux内核</strong>的<strong>类Unix操作系统</strong>集合。</p>
+<ul>
+<li>操作系统(operating system)：管理计算机硬件和软件资源的程序，为用户程序提供硬件抽象和接口。</li>
+<li>操作系统内核(operating system kernel)：操作系统最核心的部分，管理系统的进程、内存、设备驱动程序、文件和网络系统，一直在内存中，不包括图形界面、Shell等功能</li>
+<li>Shell：内核的封装，为用户提供更高级的抽象，比如<code>echo</code>、<code>ls</code>、<code>cd</code>等命令，以及进程间通信功能（管道）
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2023/09/29/%E7%A1%AC%E4%BB%B6%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
+              <a class="btn" href="/2023/09/29/linux%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
                 阅读全文 &raquo;
               </a>
             </div>
@@ -823,13 +824,13 @@ <h2 class="post-title" itemprop="name headline">
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/page/7/index.html b/page/7/index.html
index 10b9e0ace..9d25ec87a 100644
--- a/page/7/index.html
+++ b/page/7/index.html
@@ -193,7 +193,7 @@ <h1 class="site-title">thinklive</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -239,6 +239,118 @@ <h1 class="site-title">thinklive</h1>
     
 
 
+<div class="post-block">
+  
+  
+
+  <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
+    <link itemprop="mainEntityOfPage" href="https://thinklive1.github.io/2023/09/29/%E7%A1%AC%E4%BB%B6%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/">
+
+    <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
+      <meta itemprop="image" content="/images/thive.png">
+      <meta itemprop="name" content="thinklive">
+    </span>
+
+    <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
+      <meta itemprop="name" content="thinklive">
+      <meta itemprop="description" content="起初，世界是一团思索，它向所有的方向迈了一步，于是万物由此而生">
+    </span>
+
+    <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
+      <meta itemprop="name" content="undefined | thinklive">
+      <meta itemprop="description" content="">
+    </span>
+      <header class="post-header">
+        <h2 class="post-title" itemprop="name headline">
+          <a href="/2023/09/29/%E7%A1%AC%E4%BB%B6%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/" class="post-title-link" itemprop="url">基于苏大ppt的计算机硬件笔记</a>
+        </h2>
+
+        <div class="post-meta-container">
+          
+          <div class="post-meta">
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar"></i>
+      </span>
+      <span class="post-meta-item-text">发表于</span>
+
+      <time title="创建时间：2023-09-29 10:18:45" itemprop="dateCreated datePublished" datetime="2023-09-29T10:18:45+08:00">2023-09-29</time>
+    </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-10-14 20:45:28" itemprop="dateModified" datetime="2023-10-14T20:45:28+08:00">2023-10-14</time>
+    </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-folder"></i>
+      </span>
+      <span class="post-meta-item-text">分类于</span>
+        <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/" itemprop="url" rel="index"><span itemprop="name">课程笔记</span></a>
+        </span>
+          ，
+        <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
+          <a href="/categories/%E8%AF%BE%E7%A8%8B%E7%AC%94%E8%AE%B0/%E8%AE%A1%E7%BB%84/" itemprop="url" rel="index"><span itemprop="name">计组</span></a>
+        </span>
+    </span>
+
+  
+    <span class="post-meta-break"></span>
+    <span class="post-meta-item" title="本文字数">
+      <span class="post-meta-item-icon">
+        <i class="far fa-file-word"></i>
+      </span>
+      <span class="post-meta-item-text">本文字数：</span>
+      <span>19k</span>
+    </span>
+    <span class="post-meta-item" title="阅读时长">
+      <span class="post-meta-item-icon">
+        <i class="far fa-clock"></i>
+      </span>
+      <span class="post-meta-item-text">阅读时长 &asymp;</span>
+      <span>17 分钟</span>
+    </span>
+</div>
+
+        </div>
+      </header>
+
+    
+    
+    
+    <div class="post-body" itemprop="articleBody">
+          <p>&#96;冯·诺依曼计算机特点<br>– 计算机由五大部件组成<br>• 输入数据和程序的“输入设备”<br>• 记忆程序和数据的“存储器”<br>• 完成数据加工处理的“运算器”<br>• 控制程序执行的“控制器”<br>• 输出处理结果的“输出设备”  </p>
+          <!--noindex-->
+            <div class="post-button">
+              <a class="btn" href="/2023/09/29/%E7%A1%AC%E4%BB%B6%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/#more" rel="contents">
+                阅读全文 &raquo;
+              </a>
+            </div>
+          <!--/noindex-->
+        
+      
+    </div>
+
+    
+    
+    
+
+    <footer class="post-footer">
+        <div class="post-eof"></div>
+      
+    </footer>
+  </article>
+</div>
+
+
+
+
+    
+
+
 <div class="post-block">
   
   
@@ -473,13 +585,13 @@ <h2 class="post-title" itemprop="name headline">
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/photos/index.html b/photos/index.html
index f94b9cc4e..384df17c7 100644
--- a/photos/index.html
+++ b/photos/index.html
@@ -209,7 +209,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -300,13 +300,13 @@ <h1 id="艺术作品集"><a href="#艺术作品集" class="headerlink" title="
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/search.xml b/search.xml
index fe044eeb4..acf5b520d 100644
--- a/search.xml
+++ b/search.xml
@@ -24,7 +24,54 @@
 ]]></content>
   </entry>
   <entry>
-    <title>基于伯克利ds100的数据分析项目</title>
+    <title></title>
+    <url>/2023/10/16/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B01/</url>
+    <content><![CDATA[<h1 id="基础"><a href="#基础" class="headerlink" title="基础"></a>基础</h1><h2 id="数据结构"><a href="#数据结构" class="headerlink" title="数据结构"></a>数据结构</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016191822017.png"></p>
+<h2 id="算法性质"><a href="#算法性质" class="headerlink" title="算法性质"></a>算法性质</h2><p><code>循环不变式</code>主要用来帮助我们理解算法的正确性。关千<code>循环不变式</code>，我们必须证明三条<br>性质：<br>初始化：循环的第一次迭代之前，它为真。<br>保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。<br>终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正<br>确的。<br><code>分治算法</code>运行时间的递归式来自基本模式的三个步骤。如前所述，我们假设 T(n) 是规模为n 的一个问题的运行时间。若问题规模足够小，如对某个常量 c, n~c, 则直接求解需要常量时间，我们将其写作 @(1) 。假设把原问题分解成 a 个子问题，每个子问题的规模是原问题的 l&#x2F;b （对归并排序， a 和 b 都为 2, 然而，我们将看到在许多分治算法中， a&#x3D;&#x2F;&#x3D;-b 。)为了求解一个规模为  n&#x2F;b 的子问题，需要 T(n&#x2F;b) 的时间，所以需要 aT(n&#x2F;b) 的时间来求解 a 个子问题。如果分解问题  成子问题需要时间 D(n), 合并子问题的解成原问题的解需要时间 C(n), 那么得到递归式：  ![[Pasted image 20230519142006.png]]</p>
+<p>![[Pasted image 20230519142707.png]]<br>f(n) &#x3D; O(g(n)) 类似于 a&lt;&#x3D;b<br>f(n) &#x3D; Ω (g(n)) 类似于 a&gt;&#x3D;b<br>f(n) &#x3D; θ (g(n))  类似于 a&#x3D;b<br>f(n) &#x3D; o(g(n)) 类似于 a&lt;b<br>f(n) &#x3D; w(g(n)) 类似于 a&gt;b<br>![[Pasted image 20230519150021.png]]</p>
+<h2 id="分治法（递归）"><a href="#分治法（递归）" class="headerlink" title="分治法（递归）"></a>分治法（递归）</h2><h3 id="选择排序"><a href="#选择排序" class="headerlink" title="选择排序"></a>选择排序</h3><p>• Find a largest number in prefix A[:i + 1] and swap it to A[i]<br>• Recursively sort prefix A[:i]</p>
+<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">def selection_sort(A, i = None): # T(i)</span><br><span class="line">2 ’’’Sort A[:i + 1]’’’</span><br><span class="line">3 if i is None: i = len(A) - 1 # O(1)</span><br><span class="line">4 if i &gt; 0: # O(1)</span><br><span class="line">5 j = prefix_max(A, i) # S(i)</span><br><span class="line">6 A[i], A[j] = A[j], A[i] # O(1)</span><br><span class="line">7 selection_sort(A, i - 1) # T(i - 1)</span><br><span class="line">8</span><br><span class="line">9 def prefix_max(A, i): # S(i)</span><br><span class="line">10 ’’’Return index of maximum in A[:i + 1]’’’</span><br><span class="line">11 if i &gt; 0: # O(1)</span><br><span class="line">12 j = prefix_max(A, i - 1) # S(i - 1)</span><br><span class="line">13 if A[i] &lt; A[j]: # O(1)</span><br><span class="line">14 return j # O(1)</span><br><span class="line">15 return i # O(1)</span><br></pre></td></tr></table></figure>
+<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">• prefix max analysis:</span><br><span class="line">– Base case: for i = 0, array has one element, so index of max is i</span><br><span class="line">– Induction: assume correct for i, maximum is either the maximum of A[:i] or A[i],</span><br><span class="line">returns correct index in either case</span><br><span class="line">• selection sort analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, last number of a sorted output is a largest number of</span><br><span class="line">the array, and the algorithm puts one there; then A[:i] is sorted by inductio</span><br></pre></td></tr></table></figure>
+<h3 id="插入排序"><a href="#插入排序" class="headerlink" title="插入排序"></a>插入排序</h3><figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">def insertion_sort(A, i = None): # T(i)</span><br><span class="line">2 ’’’Sort A[:i + 1]’’’</span><br><span class="line">3 if i is None: i = len(A) - 1 # O(1)</span><br><span class="line">4 if i &gt; 0: # O(1)</span><br><span class="line">5 insertion_sort(A, i - 1) # T(i - 1)</span><br><span class="line">6 insert_last(A, i) # S(i)</span><br><span class="line">7</span><br><span class="line">8 def insert_last(A, i): # S(i)</span><br><span class="line">9 ’’’Sort A[:i + 1] assuming sorted A[:i]’’’</span><br><span class="line">10 if i &gt; 0 and A[i] &lt; A[i - 1]: # O(1)</span><br><span class="line">11 A[i], A[i - 1] = A[i - 1], A[i] # O(1)</span><br><span class="line">12 insert_last(A, i - 1) # S(i - 1)</span><br><span class="line">• insert last analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, if A[i] &gt;= A[i - 1], array is sorted; otherwise,</span><br><span class="line">swapping last two elements allows us to sort A[:i] by induction</span><br><span class="line">• insertion sort analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, algorithm sorts A[:i] by induction, and then</span><br><span class="line">insert last correctly sorts the rest as proved above</span><br></pre></td></tr></table></figure>
+<h3 id="归并排序"><a href="#归并排序" class="headerlink" title="归并排序"></a>归并排序</h3><figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">def merge_sort(A, a = 0, b = None): # T(b - a = n)</span><br><span class="line">2 ’’’Sort A[a:b]’’’</span><br><span class="line">3 if b is None: b = len(A) # O(1)</span><br><span class="line">4 if 1 &lt; b - a: # O(1)</span><br><span class="line">5 c = (a + b + 1) // 2 # O(1)</span><br><span class="line">6 merge_sort(A, a, c) # T(n / 2)</span><br><span class="line">7 merge_sort(A, c, b) # T(n / 2)</span><br><span class="line">8 L, R = A[a:c], A[c:b] # O(n)</span><br><span class="line">9 merge(L, R, A, len(L), len(R), a, b) # S(n)</span><br><span class="line">10</span><br><span class="line">11 def merge(L, R, A, i, j, a, b): # S(b - a = n)</span><br><span class="line">12 ’’’Merge sorted L[:i] and R[:j] into A[a:b]’’’</span><br><span class="line">13 if a &lt; b: # O(1)</span><br><span class="line">14 if (j &lt;= 0) or (i &gt; 0 and L[i - 1] &gt; R[j - 1]): # O(1)</span><br><span class="line">15 A[b - 1] = L[i - 1] # O(1)</span><br><span class="line">16 i = i - 1 # O(1)</span><br><span class="line">17 else: # O(1)</span><br><span class="line">18 A[b - 1] = R[j - 1] # O(1)</span><br><span class="line">19 j = j - 1 # O(1)</span><br><span class="line">20 merge(L, R, A, i, j, a, b - 1)</span><br></pre></td></tr></table></figure>
+
+<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">• merge analysis:</span><br><span class="line">– Base case: for n = 0, arrays are empty, so vacuously correct</span><br><span class="line">– Induction: assume correct for n, item in A[r] must be a largest number from remaining</span><br><span class="line">prefixes of L and R, and since they are sorted, taking largest of last items suffices;</span><br><span class="line">remainder is merged by induction</span><br><span class="line"> merge sort analysis:</span><br><span class="line">– Base case: for n = 1, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for k &lt; n, algorithm sorts smaller halves by induction, and then merge merges into a sorted array as proved above.</span><br></pre></td></tr></table></figure>
+<h3 id="寻峰算法"><a href="#寻峰算法" class="headerlink" title="寻峰算法"></a>寻峰算法</h3><figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">• If a[n/2] &lt; a[n/2 − 1] then only look at left half 1 . . . n/2 − − − 1 to look for peak</span><br><span class="line">• Else if a[n/2] &lt; a[n/2 + 1] then only look at right half n/2 + 1 . . . n to look for peak</span><br><span class="line">• Else n/2 position is a peak: WHY?</span><br><span class="line">a[n/2] ≥ a[n/2 − 1]</span><br><span class="line">a[n/2] ≥ a[n/2 + 1]</span><br><span class="line">What is the complexity?</span><br><span class="line">T (n) = T (n/2) + Θ(1) = Θ(1) + . . . + Θ(1) (log2(n) times) = Θ(log2(n))</span><br></pre></td></tr></table></figure>
+<p>二维情况下：</p>
+<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">• Pick middle column j = m/2</span><br><span class="line">• Find global maximum on column j at (i, j)</span><br><span class="line">• Compare (i, j − 1), (i, j), (i, j + 1)</span><br><span class="line">• Pick left columns of (i, j − 1) &gt; (i, j)</span><br><span class="line">• Similarly for right</span><br><span class="line">• (i, j) is a 2D-peak if neither condition holds</span><br><span class="line">• Solve the new problem with half the number of columns.</span><br><span class="line">• When you have a single column, find global maximum and you‘re done.</span><br><span class="line"></span><br><span class="line">T (n, m) = T (n, m/2) + Θ(n) (to find global maximum on a column — (n rows))</span><br><span class="line">T (n, m) = Θ(n) + . . . + Θ(n)</span><br><span class="line">&#x27; -v &quot;</span><br><span class="line">log m</span><br><span class="line">= Θ(n log m) = Θ(n log n) if m = n</span><br></pre></td></tr></table></figure>
+
+<h3 id="最大子数组"><a href="#最大子数组" class="headerlink" title="最大子数组"></a>最大子数组</h3><p>算法思路：<br>元素和最大的子数组有三种情况：在左半数组，右半数组，或者跨越中点，第一和第二种情况可以用递归遍历解决，第三种情况则分为两个半边数组的组合，只要从中点出发寻找最大子数组，然后组合就可以了<br><code>时间复杂度分析</code>：，其中线性时间为跨越中点的子数组，最终需要时间为O(NlogN)<br>![[Pasted image 20230522103507.png]]</p>
+<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">FIND-MAXIMUM-SUBARRAYCA, low, high)  </span><br><span class="line">if high== low  </span><br><span class="line">return Clow, high, A[low])  </span><br><span class="line">else mid=L Clow 十 high)/2 」  </span><br><span class="line">Cleft-low, left-high, left-sum) =  </span><br><span class="line">// base case, only one element  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, low, mid)  </span><br><span class="line">(right-low, right-high, right-sum) =  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, mid+l. high)  </span><br><span class="line">(cross-low, cross-high, cross-sum) =  </span><br><span class="line">FIND-MAX-CROSSING-SUBARRAY(A, low, mid, high)  </span><br><span class="line">if left-sum~right-sum and left-sum~cross-sum  </span><br><span class="line">return (left-low, left-high, left-sum)  </span><br><span class="line">elseif rightr-sum;?, left-sum and right-sum;?, cross-sum  </span><br><span class="line">return (right-low, right-high, right-sum)  </span><br><span class="line">else return (cross-low, cross-high, cross-sum)</span><br><span class="line"></span><br><span class="line">FIND-MAX-CROSSING--SUBARRAY(A, low, mid, high)  </span><br><span class="line"> left-sum = -oo  </span><br><span class="line"> sum=O  </span><br><span class="line"> for i = mid downto low  </span><br><span class="line"> sum=sum+A[i]  </span><br><span class="line"> if sum&gt; left-sum  </span><br><span class="line"> left-sum = sum  </span><br><span class="line"> max-left = i  </span><br><span class="line"> right-sum= -oo  </span><br><span class="line"> sum=O  </span><br><span class="line"> for j = mid + 1 to high</span><br><span class="line"> sum=sum + A[j]  </span><br><span class="line"> if sum &gt; right-sum  </span><br><span class="line"> right-sum = sum  </span><br><span class="line"> max-right = j  </span><br><span class="line"> return (max-left, max-right, left-sum + right-sum)</span><br></pre></td></tr></table></figure>
+<h2 id="代入法求解递归式"><a href="#代入法求解递归式" class="headerlink" title="代入法求解递归式"></a>代入法求解递归式</h2><ol>
+<li>猜测解的形式。  </li>
+<li>用数学归纳法求出解中的常数，并证明解是正确的。<br>猜测T(n)的上界，将其带入递归式，求出一个上界，随后寻找一个N0证明对所有n&gt;&#x3D;n0，递归式T(n)成立<br>![[Pasted image 20230522140116.png]]<br>![[Pasted image 20230522140235.png]]</li>
+</ol>
+<h2 id="递归树法"><a href="#递归树法" class="headerlink" title="递归树法"></a>递归树法</h2><p>递归树是良好的猜测递归式时间复杂度的方法，但由于构建递归树经常伴随简化，所以用其证明的话则不够严谨<br>以递归式 T(n)&#x3D;3T(ln&#x2F;4 」) +S(n2) 为例，来看一下如何用递归树生成一个好的猜测<br>![[Pasted image 20230523212855.png]]<br>递归树有 log4n+l 层，<br>![[Pasted image 20230523213613.png]]<br>![[Pasted image 20230523213754.png]]<br>由于根结点对总代价的贡献为 cn^2, 所以根结点的代价占总代价的一个常数  比例。换句话说，根结点的代价支配了整棵树的总代价。</p>
+<h2 id="主方法求解递归式"><a href="#主方法求解递归式" class="headerlink" title="主方法求解递归式"></a>主方法求解递归式</h2><p>主方法为如下形式的递归式提供了一种”菜谱”式的求解方法<br>T(n) &#x3D; aT(n&#x2F;b) + f(n)<br>其中 a&gt;&#x3D;l1和 b&gt;&#x3D;1 是常数， f(n) 是渐近正函数。<br>![[Pasted image 20230524215056.png]]</p>
+<h1 id="比较排序"><a href="#比较排序" class="headerlink" title="比较排序"></a>比较排序</h1><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016192215938.png"></p>
+<h2 id="决策树"><a href="#决策树" class="headerlink" title="决策树"></a>决策树</h2><p>决策树<br> • 任何算法都可以被视为所执行操作的决策树<br> • 内部节点表示二进制比较，分支为 True 或 False<br> • 对于比较算法，决策树是二元的<br> • 叶子代表算法终止，产生算法输出<br> • 根到叶路径表示算法在某些输入上的执行<br> • 每个算法输出至少需要一个叶子，因此搜索需要 ≥ n + 1 个叶子<br> • 高度 ≥ mod(lg(n + 1)) − 1 &#x3D; Ω(log n)，因此任何比较排序的运行时间均为 Ω(log n)</p>
+<h2 id="堆排序"><a href="#堆排序" class="headerlink" title="堆排序"></a>堆排序</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231014112423645.png"><br>最大堆的生成</p>
+<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">l = left(i)</span><br><span class="line">r = right(i)</span><br><span class="line">if (l &lt;= heap-size(A) and A[l] &gt; A[i])</span><br><span class="line">then largest = l else largest = i</span><br><span class="line">if (r &lt;= heap-size(A) and A[r] &gt; A[largest])</span><br><span class="line">then largest = r</span><br><span class="line">if largest = i</span><br><span class="line">then exchange A[i] and A[largest]</span><br><span class="line">Max_Heapify(A, largest)</span><br><span class="line"></span><br><span class="line">//Converts A[1…n] to a max heap</span><br><span class="line">Build_Max_Heap(A):</span><br><span class="line">for i=n/2 downto 1</span><br><span class="line">do Max_Heapify(A, i)</span><br><span class="line"></span><br><span class="line">/*</span><br><span class="line">Why start at n/2?</span><br><span class="line">Because elements A[n/2 + 1 … n] are all leaves of the tree</span><br><span class="line">*/</span><br></pre></td></tr></table></figure>
+<p>时间复杂度分析：</p>
+<p>Total amount of work in the for loop can be summed as:<br>n&#x2F;4 (1 c) + n&#x2F;8 (2 c) + n&#x2F;16 (3 c) + … + 1 (lg n c)<br>Setting n&#x2F;4 &#x3D; 2k and simplifying we get:<br>c 2k( 1&#x2F;20 + 2&#x2F;21 + 3&#x2F;22 + … (k+1)&#x2F;2k )<br>The term is brackets is bounded by a constant<br>This means that Build_Max_Heap is O(n)</p>
+<p>排序策略：</p>
+<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">Sorting Strategy:</span><br><span class="line">1. Build Max Heap from unordered array;</span><br><span class="line">2. Find maximum element A[1];</span><br><span class="line">3. Swap elements A[n] and A[1]:</span><br><span class="line">now max element is at the end of the array!</span><br><span class="line">4. Discard node n from heap</span><br><span class="line">(by decrementing heap-size variable)</span><br><span class="line">5. New root may violate max heap property, but its</span><br><span class="line">children are max heaps. Run max_heapify to fix this.</span><br><span class="line">6. Go to Step 2 unless heap is empty</span><br></pre></td></tr></table></figure>
+
+<h2 id="动态规划和二分搜索树"><a href="#动态规划和二分搜索树" class="headerlink" title="动态规划和二分搜索树"></a>动态规划和二分搜索树</h2><p>实例——机场的动态规划：</p>
+<ol>
+<li>机场维护一个跑道队列</li>
+<li>未来的着陆预定登记到队列</li>
+<li>一架飞机着陆后就出队</li>
+<li>有新的请求且需要着陆时间t时，如果k时间内没有其他需求，则需求t时间的请求入队(k可以实时改变)<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">init: R = [ ]</span><br><span class="line">req(t): if t &lt; now: return &quot;error&quot;</span><br><span class="line">for i in range (len(R)):</span><br><span class="line">if abs(t-R[i]) &lt; k: return &quot;error&quot;</span><br><span class="line">R.append(t)</span><br><span class="line">R = sorted(R)</span><br><span class="line">land: t = R[0]</span><br><span class="line">if (t != now) return error</span><br><span class="line">R = R[1: ] (drop R[0] from R)</span><br></pre></td></tr></table></figure>
+Goal: Run this system efficiently in O(lg n) time<br>常见数据结构运行时间分析<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">• Sorted list: Appending and sorting takes Θ(n lg n) time. However, it is pos-</span><br><span class="line">sible to insert new time/plane rather than append and sort but insertion takes</span><br><span class="line">Θ(n) time. A k minute check can be done in O(1) once the insertion point is</span><br><span class="line">found.</span><br><span class="line">• Sorted array: It is possible to do binary search to find place to insert in</span><br><span class="line">O(lg n) time. Using binary search, we find the smallest i such that R[i] ≥ t,</span><br><span class="line">i.e., the next larger element. We then compare R[i] and R[i − 1] against t.</span><br><span class="line">Actual insertion however requires shifting elements which requires Θ(n) time.</span><br><span class="line">• Unsorted list/array: k minute check takes O(n) time.</span><br><span class="line">• Min-Heap: It is possible to insert in O(lg n) time. However, the k minute</span><br><span class="line">check will require O(n) time.</span><br><span class="line">• Dictionary or Python Set: Insertion is O(1) time. k minute check takes</span><br><span class="line">Ω(n) time</span><br></pre></td></tr></table></figure>
+BST的定义：<br>每个节点都有一个key,左节点的key小于等于父节点，右节点的key大于等于父节点<br>所有操作都是O(h)即O(lgn)<br>动态规划中需要找到比一个值大的值中的最小值<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">next-larger(x)</span><br><span class="line">if right child not NIL, return minimum(right)</span><br><span class="line">else y = parent(x)</span><br><span class="line">while y not NIL and x = right(y)</span><br><span class="line">x = y; y = parent(y)</span><br><span class="line">return(y);</span><br></pre></td></tr></table></figure>
+<code>子问题</code>：如何计算小于等于时间t内着陆的飞机数量<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">1. Walk down tree to find desired time</span><br><span class="line">2. Add in nodes that are smaller</span><br><span class="line">3. Add in subtree sizes to the left</span><br></pre></td></tr></table></figure></li>
+</ol>
+<h1 id="哈希"><a href="#哈希" class="headerlink" title="哈希"></a>哈希</h1><p>哈希有可能产生碰撞，需要特定处理或者数据结构，检索元素时间最后会由负载因数(n&#x2F;m)决定<br><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016200400451.png"></p>
+<h1 id="线性时间排序"><a href="#线性时间排序" class="headerlink" title="线性时间排序"></a>线性时间排序</h1>]]></content>
+  </entry>
+  <entry>
+    <title>基于伯克利ds100的数据分析项目(待续)</title>
     <url>/2023/10/15/houses/</url>
     <content><![CDATA[<h2 id="数据集：美国伊利诺伊州库克县的住房数据集"><a href="#数据集：美国伊利诺伊州库克县的住房数据集" class="headerlink" title="数据集：美国伊利诺伊州库克县的住房数据集"></a>数据集：美国伊利诺伊州库克县的住房数据集</h2><figure class="highlight python"><table><tr><td class="code"><pre><span class="line"><span class="comment">#引入python库</span></span><br><span class="line"><span class="keyword">import</span> numpy <span class="keyword">as</span> np</span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> pandas <span class="keyword">as</span> pd</span><br><span class="line"></span><br><span class="line">%matplotlib inline</span><br><span class="line"><span class="keyword">import</span> matplotlib.pyplot <span class="keyword">as</span> plt</span><br><span class="line"><span class="keyword">import</span> seaborn <span class="keyword">as</span> sns</span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> warnings</span><br><span class="line">warnings.filterwarnings(<span class="string">&quot;ignore&quot;</span>)</span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> zipfile</span><br><span class="line"><span class="keyword">import</span> os</span><br><span class="line"></span><br><span class="line"><span class="comment"># Plot settings</span></span><br><span class="line">plt.rcParams[<span class="string">&#x27;figure.figsize&#x27;</span>] = (<span class="number">12</span>, <span class="number">9</span>)</span><br><span class="line">plt.rcParams[<span class="string">&#x27;font.size&#x27;</span>] = <span class="number">12</span></span><br><span class="line"></span><br></pre></td></tr></table></figure>
 
@@ -347,15 +394,23 @@
   <entry>
     <title>基于mit6.006的算法笔记(待续)</title>
     <url>/2023/10/14/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/</url>
-    <content><![CDATA[<h2 id="算法性质"><a href="#算法性质" class="headerlink" title="算法性质"></a>算法性质</h2><p><code>循环不变式</code>主要用来帮助我们理解算法的正确性。关千<code>循环不变式</code>，我们必须证明三条<br>性质：<br>初始化：循环的第一次迭代之前，它为真。<br>保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。<br>终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正<br>确的。</p>
+    <content><![CDATA[<h1 id="基础"><a href="#基础" class="headerlink" title="基础"></a>基础</h1><h2 id="数据结构"><a href="#数据结构" class="headerlink" title="数据结构"></a>数据结构</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016191822017.png"></p>
+<h2 id="算法性质"><a href="#算法性质" class="headerlink" title="算法性质"></a>算法性质</h2><p><code>循环不变式</code>主要用来帮助我们理解算法的正确性。关千<code>循环不变式</code>，我们必须证明三条<br>性质：<br>初始化：循环的第一次迭代之前，它为真。<br>保持：如果循环的某次迭代之前它为真，那么下次迭代之前它仍为真。<br>终止：在循环终止时，不变式为我们提供一个有用的性质，该性质有助千证明算法是正<br>确的。</p>
 <span id="more"></span>
-<p><code>分治算法</code>运行时间的递归式来自基本模式的三个步骤。如前所述，我们假设 T(n) 是规模为n 的一个问题的运行时间。若问题规模足够小，如对某个常量 c, n~c, 则直接求解需要常量时间，我们将其写作 @(1) 。假设把原问题分解成 a 个子问题，每个子问题的规模是原问题的 l&#x2F;b （对归并排序， a 和 b 都为 2, 然而，我们将看到在许多分治算法中， a&#x3D;&#x2F;&#x3D;-b 。)为了求解一个规模为  n&#x2F;b 的子问题，需要 T(n&#x2F;b) 的时间，所以需要 aT(n&#x2F;b) 的时间来求解 a 个子问题。如果分解问题  成子问题需要时间 D(n), 合并子问题的解成原问题的解需要时间 C(n), 那么得到递归式：<br><img src="/images/obsidian/202305191420061.png" alt="图片" title="image"><br><img src="/images/obsidian/20230519142707.png" alt="图片" title="image"></p>
+<p><code>分治算法</code>运行时间的递归式来自基本模式的三个步骤。如前所述，我们假设 T(n) 是规模为n 的一个问题的运行时间。若问题规模足够小，如对某个常量 c, n~c, 则直接求解需要常量时间，我们将其写作 @(1) 。假设把原问题分解成 a 个子问题，每个子问题的规模是原问题的 l&#x2F;b （对归并排序， a 和 b 都为 2, 然而，我们将看到在许多分治算法中， a&#x3D;&#x2F;&#x3D;-b 。)为了求解一个规模为  n&#x2F;b 的子问题，需要 T(n&#x2F;b) 的时间，所以需要 aT(n&#x2F;b) 的时间来求解 a 个子问题。如果分解问题  成子问题需要时间 D(n), 合并子问题的解成原问题的解需要时间 C(n), 那么得到递归式：<br><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/20230519142006.png" alt="图片" title="image"><br><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/20230519142707.png" alt="图片" title="image"></p>
 <p>f(n) &#x3D; O(g(n)) 类似于 a&lt;&#x3D;b<br>f(n) &#x3D; Ω (g(n)) 类似于 a&gt;&#x3D;b<br>f(n) &#x3D; θ (g(n))  类似于 a&#x3D;b<br>f(n) &#x3D; o(g(n)) 类似于 a&lt;b<br>f(n) &#x3D; w(g(n)) 类似于 a&gt;b<br><img src="/images/obsidian/20230519150021.png" alt="图片" title="image"></p>
-<h1 id="分治与递归"><a href="#分治与递归" class="headerlink" title="分治与递归"></a>分治与递归</h1><h2 id="实例"><a href="#实例" class="headerlink" title="实例"></a>实例</h2><h3 id="归并排序"><a href="#归并排序" class="headerlink" title="归并排序"></a>归并排序</h3><figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">MERGE(A, p, q, r)</span><br><span class="line"></span><br><span class="line">n1 = q - p + 1 </span><br><span class="line">n2 = r - q  </span><br><span class="line"></span><br><span class="line">let L[1.. n1 + 1] and R[1.. n2 + 1] be new arrays</span><br><span class="line"></span><br><span class="line">for i = 1 to n1</span><br><span class="line">L[i] = A[p + i - 1] </span><br><span class="line"></span><br><span class="line">for j = 1 to n2 </span><br><span class="line">R[j] = A[q + j]</span><br><span class="line"></span><br><span class="line">L[n1+ 1] = ∞</span><br><span class="line">R[n2 + 1] = ∞</span><br><span class="line"></span><br><span class="line">i = 1</span><br><span class="line">j = 1</span><br><span class="line"></span><br><span class="line">for k = p to r</span><br><span class="line">if L[i] &lt;= R[j]</span><br><span class="line">A[k] = L[i]</span><br><span class="line">i = i + 1</span><br><span class="line">else </span><br><span class="line">A[k] = R[j] </span><br><span class="line">j = j + 1</span><br><span class="line"></span><br><span class="line">MERGE-SORT(A, p, r)</span><br><span class="line">1 if p&lt;r</span><br><span class="line">z q =  ⌊ (P+r)/2 ⌋</span><br><span class="line">3 MERGE-SORT(A, p, q)</span><br><span class="line">4 MERGE-SORT(A, q+1, r)</span><br><span class="line">5 MERGE(A, p, q, r)</span><br></pre></td></tr></table></figure>
+<h2 id="分治法（递归）"><a href="#分治法（递归）" class="headerlink" title="分治法（递归）"></a>分治法（递归）</h2><h3 id="选择排序"><a href="#选择排序" class="headerlink" title="选择排序"></a>选择排序</h3><p>• Find a largest number in prefix A[:i + 1] and swap it to A[i]<br>• Recursively sort prefix A[:i]</p>
+<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">def selection_sort(A, i = None): # T(i)</span><br><span class="line">2 ’’’Sort A[:i + 1]’’’</span><br><span class="line">3 if i is None: i = len(A) - 1 # O(1)</span><br><span class="line">4 if i &gt; 0: # O(1)</span><br><span class="line">5 j = prefix_max(A, i) # S(i)</span><br><span class="line">6 A[i], A[j] = A[j], A[i] # O(1)</span><br><span class="line">7 selection_sort(A, i - 1) # T(i - 1)</span><br><span class="line">8</span><br><span class="line">9 def prefix_max(A, i): # S(i)</span><br><span class="line">10 ’’’Return index of maximum in A[:i + 1]’’’</span><br><span class="line">11 if i &gt; 0: # O(1)</span><br><span class="line">12 j = prefix_max(A, i - 1) # S(i - 1)</span><br><span class="line">13 if A[i] &lt; A[j]: # O(1)</span><br><span class="line">14 return j # O(1)</span><br><span class="line">15 return i # O(1)</span><br></pre></td></tr></table></figure>
+<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">• prefix max analysis:</span><br><span class="line">– Base case: for i = 0, array has one element, so index of max is i</span><br><span class="line">– Induction: assume correct for i, maximum is either the maximum of A[:i] or A[i],</span><br><span class="line">returns correct index in either case</span><br><span class="line">• selection sort analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, last number of a sorted output is a largest number of</span><br><span class="line">the array, and the algorithm puts one there; then A[:i] is sorted by inductio</span><br></pre></td></tr></table></figure>
+<h3 id="插入排序"><a href="#插入排序" class="headerlink" title="插入排序"></a>插入排序</h3><figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">def insertion_sort(A, i = None): # T(i)</span><br><span class="line">2 ’’’Sort A[:i + 1]’’’</span><br><span class="line">3 if i is None: i = len(A) - 1 # O(1)</span><br><span class="line">4 if i &gt; 0: # O(1)</span><br><span class="line">5 insertion_sort(A, i - 1) # T(i - 1)</span><br><span class="line">6 insert_last(A, i) # S(i)</span><br><span class="line">7</span><br><span class="line">8 def insert_last(A, i): # S(i)</span><br><span class="line">9 ’’’Sort A[:i + 1] assuming sorted A[:i]’’’</span><br><span class="line">10 if i &gt; 0 and A[i] &lt; A[i - 1]: # O(1)</span><br><span class="line">11 A[i], A[i - 1] = A[i - 1], A[i] # O(1)</span><br><span class="line">12 insert_last(A, i - 1) # S(i - 1)</span><br><span class="line">• insert last analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, if A[i] &gt;= A[i - 1], array is sorted; otherwise,</span><br><span class="line">swapping last two elements allows us to sort A[:i] by induction</span><br><span class="line">• insertion sort analysis:</span><br><span class="line">– Base case: for i = 0, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for i, algorithm sorts A[:i] by induction, and then</span><br><span class="line">insert last correctly sorts the rest as proved above</span><br></pre></td></tr></table></figure>
+<h3 id="归并排序"><a href="#归并排序" class="headerlink" title="归并排序"></a>归并排序</h3><figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">def merge_sort(A, a = 0, b = None): # T(b - a = n)</span><br><span class="line">2 ’’’Sort A[a:b]’’’</span><br><span class="line">3 if b is None: b = len(A) # O(1)</span><br><span class="line">4 if 1 &lt; b - a: # O(1)</span><br><span class="line">5 c = (a + b + 1) // 2 # O(1)</span><br><span class="line">6 merge_sort(A, a, c) # T(n / 2)</span><br><span class="line">7 merge_sort(A, c, b) # T(n / 2)</span><br><span class="line">8 L, R = A[a:c], A[c:b] # O(n)</span><br><span class="line">9 merge(L, R, A, len(L), len(R), a, b) # S(n)</span><br><span class="line">10</span><br><span class="line">11 def merge(L, R, A, i, j, a, b): # S(b - a = n)</span><br><span class="line">12 ’’’Merge sorted L[:i] and R[:j] into A[a:b]’’’</span><br><span class="line">13 if a &lt; b: # O(1)</span><br><span class="line">14 if (j &lt;= 0) or (i &gt; 0 and L[i - 1] &gt; R[j - 1]): # O(1)</span><br><span class="line">15 A[b - 1] = L[i - 1] # O(1)</span><br><span class="line">16 i = i - 1 # O(1)</span><br><span class="line">17 else: # O(1)</span><br><span class="line">18 A[b - 1] = R[j - 1] # O(1)</span><br><span class="line">19 j = j - 1 # O(1)</span><br><span class="line">20 merge(L, R, A, i, j, a, b - 1)</span><br></pre></td></tr></table></figure>
+
+<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">• merge analysis:</span><br><span class="line">– Base case: for n = 0, arrays are empty, so vacuously correct</span><br><span class="line">– Induction: assume correct for n, item in A[r] must be a largest number from remaining</span><br><span class="line">prefixes of L and R, and since they are sorted, taking largest of last items suffices;</span><br><span class="line">remainder is merged by induction</span><br><span class="line"> merge sort analysis:</span><br><span class="line">– Base case: for n = 1, array has one element so is sorted</span><br><span class="line">– Induction: assume correct for k &lt; n, algorithm sorts smaller halves by induction, and then merge merges into a sorted array as proved above.</span><br></pre></td></tr></table></figure>
 <h3 id="寻峰算法"><a href="#寻峰算法" class="headerlink" title="寻峰算法"></a>寻峰算法</h3><figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">• If a[n/2] &lt; a[n/2 − 1] then only look at left half 1 . . . n/2 − − − 1 to look for peak</span><br><span class="line">• Else if a[n/2] &lt; a[n/2 + 1] then only look at right half n/2 + 1 . . . n to look for peak</span><br><span class="line">• Else n/2 position is a peak: WHY?</span><br><span class="line">a[n/2] ≥ a[n/2 − 1]</span><br><span class="line">a[n/2] ≥ a[n/2 + 1]</span><br><span class="line">What is the complexity?</span><br><span class="line">T (n) = T (n/2) + Θ(1) = Θ(1) + . . . + Θ(1) (log2(n) times) = Θ(log2(n))</span><br></pre></td></tr></table></figure>
 <p>二维情况下：</p>
 <figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">• Pick middle column j = m/2</span><br><span class="line">• Find global maximum on column j at (i, j)</span><br><span class="line">• Compare (i, j − 1), (i, j), (i, j + 1)</span><br><span class="line">• Pick left columns of (i, j − 1) &gt; (i, j)</span><br><span class="line">• Similarly for right</span><br><span class="line">• (i, j) is a 2D-peak if neither condition holds</span><br><span class="line">• Solve the new problem with half the number of columns.</span><br><span class="line">• When you have a single column, find global maximum and you‘re done.</span><br><span class="line"></span><br><span class="line">T (n, m) = T (n, m/2) + Θ(n) (to find global maximum on a column — (n rows))</span><br><span class="line">T (n, m) = Θ(n) + . . . + Θ(n)</span><br><span class="line">&#x27; -v &quot;</span><br><span class="line">log m</span><br><span class="line">= Θ(n log m) = Θ(n log n) if m = n</span><br></pre></td></tr></table></figure>
-
+<h3 id="最大子数组"><a href="#最大子数组" class="headerlink" title="最大子数组"></a>最大子数组</h3><p>算法思路：<br>元素和最大的子数组有三种情况：在左半数组，右半数组，或者跨越中点，第一和第二种情况可以用递归遍历解决，第三种情况则分为两个半边数组的组合，只要从中点出发寻找最大子数组，然后组合就可以了<br><code>时间复杂度分析</code>：，其中线性时间为跨越中点的子数组，最终需要时间为O(NlogN)<br>![[Pasted image 20230522103507.png]]</p>
+<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">FIND-MAXIMUM-SUBARRAYCA, low, high)  </span><br><span class="line">if high== low  </span><br><span class="line">return Clow, high, A[low])  </span><br><span class="line">else mid=L Clow 十 high)/2 」  </span><br><span class="line">Cleft-low, left-high, left-sum) =  </span><br><span class="line">// base case, only one element  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, low, mid)  </span><br><span class="line">(right-low, right-high, right-sum) =  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, mid+l. high)  </span><br><span class="line">(cross-low, cross-high, cross-sum) =  </span><br><span class="line">FIND-MAX-CROSSING-SUBARRAY(A, low, mid, high)  </span><br><span class="line">if left-sum~right-sum and left-sum~cross-sum  </span><br><span class="line">return (left-low, left-high, left-sum)  </span><br><span class="line">elseif rightr-sum;?, left-sum and right-sum;?, cross-sum  </span><br><span class="line">return (right-low, right-high, right-sum)  </span><br><span class="line">else return (cross-low, cross-high, cross-sum)</span><br><span class="line"></span><br><span class="line">FIND-MAX-CROSSING--SUBARRAY(A, low, mid, high)  </span><br><span class="line"> left-sum = -oo  </span><br><span class="line"> sum=O  </span><br><span class="line"> for i = mid downto low  </span><br><span class="line"> sum=sum+A[i]  </span><br><span class="line"> if sum&gt; left-sum  </span><br><span class="line"> left-sum = sum  </span><br><span class="line"> max-left = i  </span><br><span class="line"> right-sum= -oo  </span><br><span class="line"> sum=O  </span><br><span class="line"> for j = mid + 1 to high</span><br><span class="line"> sum=sum + A[j]  </span><br><span class="line"> if sum &gt; right-sum  </span><br><span class="line"> right-sum = sum  </span><br><span class="line"> max-right = j  </span><br><span class="line"> return (max-left, max-right, left-sum + right-sum)</span><br></pre></td></tr></table></figure>
 <h2 id="代入法求解递归式"><a href="#代入法求解递归式" class="headerlink" title="代入法求解递归式"></a>代入法求解递归式</h2><ol>
 <li>猜测解的形式。  </li>
 <li>用数学归纳法求出解中的常数，并证明解是正确的。<br>猜测T(n)的上界，将其带入递归式，求出一个上界，随后寻找一个N0证明对所有n&gt;&#x3D;n0，递归式T(n)成立<br><img src="/images/obsidian/20230522140116.png" alt="图片" title="image"><br><img src="/images/obsidian/20230522140235.png" alt="图片" title="image"></li>
@@ -365,14 +420,26 @@
 <p>算法思路：<br>元素和最大的子数组有三种情况：在左半数组，右半数组，或者跨越中点，第一和第二种情况可以用递归遍历解决，第三种情况则分为两个半边数组的组合，只要从中点出发寻找最大子数组，然后组合就可以了<br><code>时间复杂度分析</code>：，其中线性时间为跨越中点的子数组，最终需要时间为O(NlogN)<br><img src="/images/obsidian/202305221035071.png" alt="图片" title="image"></p>
 <figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">FIND-MAXIMUM-SUBARRAYCA, low, high)  </span><br><span class="line">1 if high== low  </span><br><span class="line">2 return Clow, high, A[low])  </span><br><span class="line">3 else mid=L Clow 十 high)/2 」  </span><br><span class="line">4 Cleft-low, left-high, left-sum) =  </span><br><span class="line">// base case, only one element  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, low, mid)  </span><br><span class="line">5 (right-low, right-high, right-sum) =  </span><br><span class="line">FIND-MAXIMUM-SUBARRAY(A, mid+l. high)  </span><br><span class="line">6 (cross-low, cross-high, cross-sum) =  </span><br><span class="line">FIND-MAX-CROSSING-SUBARRAY(A, low, mid, high)  </span><br><span class="line">7 if left-sum~right-sum and left-sum~cross-sum  </span><br><span class="line">8 return (left-low, left-high, left-sum)  </span><br><span class="line">elseif rightr-sum;?, left-sum and right-sum;?, cross-sum  </span><br><span class="line">return (right-low, right-high, right-sum)  </span><br><span class="line">else return (cross-low, cross-high, cross-sum)</span><br><span class="line"></span><br><span class="line">FIND-MAX-CROSSING--SUBARRAY(A, low, mid, high)  </span><br><span class="line">1 left-sum = -oo  </span><br><span class="line">2 sum=O  </span><br><span class="line">3 for i = mid downto low  </span><br><span class="line">4 sum=sum+A[i]  </span><br><span class="line">5 if sum&gt; left-sum  </span><br><span class="line">6 left-sum = sum  </span><br><span class="line">7 max-left = i  </span><br><span class="line">8 right-sum= -oo  </span><br><span class="line">9 sum=O  </span><br><span class="line">10 for j = mid + 1 to high</span><br><span class="line">11 sum=sum + A[j]  </span><br><span class="line">12 if sum &gt; right-sum  </span><br><span class="line">13 right-sum = sum  </span><br><span class="line">14 max-right = j  </span><br><span class="line">15 return (max-left, max-right, left-sum + right-sum)</span><br></pre></td></tr></table></figure>
 
-<h1 id="比较排序"><a href="#比较排序" class="headerlink" title="比较排序"></a>比较排序</h1><h2 id="堆排序"><a href="#堆排序" class="headerlink" title="堆排序"></a>堆排序</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231014112423645.png"><br>最大堆的生成</p>
+<h1 id="比较排序"><a href="#比较排序" class="headerlink" title="比较排序"></a>比较排序</h1><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016192215938.png"></p>
+<h2 id="决策树"><a href="#决策树" class="headerlink" title="决策树"></a>决策树</h2><p>决策树<br> • 任何算法都可以被视为所执行操作的决策树<br> • 内部节点表示二进制比较，分支为 True 或 False<br> • 对于比较算法，决策树是二元的<br> • 叶子代表算法终止，产生算法输出<br> • 根到叶路径表示算法在某些输入上的执行<br> • 每个算法输出至少需要一个叶子，因此搜索需要 ≥ n + 1 个叶子<br> • 高度 ≥ mod(lg(n + 1)) − 1 &#x3D; Ω(log n)，因此任何比较排序的运行时间均为 Ω(log n)</p>
+<h2 id="堆排序"><a href="#堆排序" class="headerlink" title="堆排序"></a>堆排序</h2><p><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231014112423645.png"><br>最大堆的生成</p>
 <figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">l = left(i)</span><br><span class="line">r = right(i)</span><br><span class="line">if (l &lt;= heap-size(A) and A[l] &gt; A[i])</span><br><span class="line">then largest = l else largest = i</span><br><span class="line">if (r &lt;= heap-size(A) and A[r] &gt; A[largest])</span><br><span class="line">then largest = r</span><br><span class="line">if largest = i</span><br><span class="line">then exchange A[i] and A[largest]</span><br><span class="line">Max_Heapify(A, largest)</span><br><span class="line"></span><br><span class="line">//Converts A[1…n] to a max heap</span><br><span class="line">Build_Max_Heap(A):</span><br><span class="line">for i=n/2 downto 1</span><br><span class="line">do Max_Heapify(A, i)</span><br><span class="line"></span><br><span class="line">/*</span><br><span class="line">Why start at n/2?</span><br><span class="line">Because elements A[n/2 + 1 … n] are all leaves of the tree</span><br><span class="line">*/</span><br></pre></td></tr></table></figure>
 <p>时间复杂度分析：</p>
 <p>Total amount of work in the for loop can be summed as:<br>n&#x2F;4 (1 c) + n&#x2F;8 (2 c) + n&#x2F;16 (3 c) + … + 1 (lg n c)<br>Setting n&#x2F;4 &#x3D; 2k and simplifying we get:<br>c 2k( 1&#x2F;20 + 2&#x2F;21 + 3&#x2F;22 + … (k+1)&#x2F;2k )<br>The term is brackets is bounded by a constant<br>This means that Build_Max_Heap is O(n)</p>
 <p>排序策略：</p>
 <figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">Sorting Strategy:</span><br><span class="line">1. Build Max Heap from unordered array;</span><br><span class="line">2. Find maximum element A[1];</span><br><span class="line">3. Swap elements A[n] and A[1]:</span><br><span class="line">now max element is at the end of the array!</span><br><span class="line">4. Discard node n from heap</span><br><span class="line">(by decrementing heap-size variable)</span><br><span class="line">5. New root may violate max heap property, but its</span><br><span class="line">children are max heaps. Run max_heapify to fix this.</span><br><span class="line">6. Go to Step 2 unless heap is empty</span><br></pre></td></tr></table></figure>
-
-]]></content>
+<h2 id="动态规划和二分搜索树"><a href="#动态规划和二分搜索树" class="headerlink" title="动态规划和二分搜索树"></a>动态规划和二分搜索树</h2><p>实例——机场的动态规划：</p>
+<ol>
+<li>机场维护一个跑道队列</li>
+<li>未来的着陆预定登记到队列</li>
+<li>一架飞机着陆后就出队</li>
+<li>有新的请求且需要着陆时间t时，如果k时间内没有其他需求，则需求t时间的请求入队(k可以实时改变)<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">init: R = [ ]</span><br><span class="line">req(t): if t &lt; now: return &quot;error&quot;</span><br><span class="line">for i in range (len(R)):</span><br><span class="line">if abs(t-R[i]) &lt; k: return &quot;error&quot;</span><br><span class="line">R.append(t)</span><br><span class="line">R = sorted(R)</span><br><span class="line">land: t = R[0]</span><br><span class="line">if (t != now) return error</span><br><span class="line">R = R[1: ] (drop R[0] from R)</span><br></pre></td></tr></table></figure>
+Goal: Run this system efficiently in O(lg n) time<br>常见数据结构运行时间分析<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">• Sorted list: Appending and sorting takes Θ(n lg n) time. However, it is pos-</span><br><span class="line">sible to insert new time/plane rather than append and sort but insertion takes</span><br><span class="line">Θ(n) time. A k minute check can be done in O(1) once the insertion point is</span><br><span class="line">found.</span><br><span class="line">• Sorted array: It is possible to do binary search to find place to insert in</span><br><span class="line">O(lg n) time. Using binary search, we find the smallest i such that R[i] ≥ t,</span><br><span class="line">i.e., the next larger element. We then compare R[i] and R[i − 1] against t.</span><br><span class="line">Actual insertion however requires shifting elements which requires Θ(n) time.</span><br><span class="line">• Unsorted list/array: k minute check takes O(n) time.</span><br><span class="line">• Min-Heap: It is possible to insert in O(lg n) time. However, the k minute</span><br><span class="line">check will require O(n) time.</span><br><span class="line">• Dictionary or Python Set: Insertion is O(1) time. k minute check takes</span><br><span class="line">Ω(n) time</span><br></pre></td></tr></table></figure>
+BST的定义：<br>每个节点都有一个key,左节点的key小于等于父节点，右节点的key大于等于父节点<br>所有操作都是O(h)即O(lgn)<br>动态规划中需要找到比一个值大的值中的最小值<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">next-larger(x)</span><br><span class="line">if right child not NIL, return minimum(right)</span><br><span class="line">else y = parent(x)</span><br><span class="line">while y not NIL and x = right(y)</span><br><span class="line">x = y; y = parent(y)</span><br><span class="line">return(y);</span><br></pre></td></tr></table></figure>
+<code>子问题</code>：如何计算小于等于时间t内着陆的飞机数量<figure class="highlight plaintext"><table><tr><td class="code"><pre><span class="line">1. Walk down tree to find desired time</span><br><span class="line">2. Add in nodes that are smaller</span><br><span class="line">3. Add in subtree sizes to the left</span><br></pre></td></tr></table></figure></li>
+</ol>
+<h1 id="哈希"><a href="#哈希" class="headerlink" title="哈希"></a>哈希</h1><p>哈希有可能产生碰撞，需要特定处理或者数据结构，检索元素时间最后会由负载因数(n&#x2F;m)决定<br><img src="/assets/mit6.006%E6%80%BB%E5%92%8C%E7%AC%94%E8%AE%B0/image-20231016200400451.png"></p>
+<h1 id="线性时间排序"><a href="#线性时间排序" class="headerlink" title="线性时间排序"></a>线性时间排序</h1>]]></content>
       <categories>
         <category>课程笔记</category>
         <category>数据结构与算法</category>
diff --git a/tags/JAVA/index.html b/tags/JAVA/index.html
index 9f02327ba..1f02cf44d 100644
--- a/tags/JAVA/index.html
+++ b/tags/JAVA/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">JAVA
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/black-souls/index.html b/tags/black-souls/index.html
index 2a53d9009..7feaca9e5 100644
--- a/tags/black-souls/index.html
+++ b/tags/black-souls/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -338,13 +338,13 @@ <h1 class="collection-header">black souls
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/c/index.html b/tags/c/index.html
index cb405bd0f..2e7f4a8dd 100644
--- a/tags/c/index.html
+++ b/tags/c/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -338,13 +338,13 @@ <h1 class="collection-header">c++
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/hexo/index.html b/tags/hexo/index.html
index ce82d0437..c0130d913 100644
--- a/tags/hexo/index.html
+++ b/tags/hexo/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">hexo
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/hitman/index.html b/tags/hitman/index.html
index 99684e0db..61520dd72 100644
--- a/tags/hitman/index.html
+++ b/tags/hitman/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">hitman
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/icarus/index.html b/tags/icarus/index.html
index 6c3744a44..f3f211e9e 100644
--- a/tags/icarus/index.html
+++ b/tags/icarus/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">icarus
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/index.html b/tags/index.html
index 15a809466..3e1d0201a 100644
--- a/tags/index.html
+++ b/tags/index.html
@@ -196,7 +196,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -293,13 +293,13 @@ <h1 class="post-title" itemprop="name headline">tags
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/linux/index.html b/tags/linux/index.html
index 392cf41dc..5c63b4253 100644
--- a/tags/linux/index.html
+++ b/tags/linux/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -338,13 +338,13 @@ <h1 class="collection-header">linux
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/next/index.html b/tags/next/index.html
index 6d85bfd3f..dc4c43de8 100644
--- a/tags/next/index.html
+++ b/tags/next/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">next
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/not-for-broadcast/index.html b/tags/not-for-broadcast/index.html
index f62867b1c..5915401c4 100644
--- a/tags/not-for-broadcast/index.html
+++ b/tags/not-for-broadcast/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">not for broadcast
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/pandas/index.html b/tags/pandas/index.html
index 4f63f8884..5f934b664 100644
--- a/tags/pandas/index.html
+++ b/tags/pandas/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -265,7 +265,7 @@ <h1 class="collection-header">pandas
 
       <div class="post-title">
         <a class="post-title-link" href="/2023/10/15/houses/" itemprop="url">
-          <span itemprop="name">基于伯克利ds100的数据分析项目</span>
+          <span itemprop="name">基于伯克利ds100的数据分析项目(待续)</span>
         </a>
       </div>
 
@@ -338,13 +338,13 @@ <h1 class="collection-header">pandas
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/python/index.html b/tags/python/index.html
index 5a7335231..c26d6c382 100644
--- a/tags/python/index.html
+++ b/tags/python/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -265,7 +265,7 @@ <h1 class="collection-header">python
 
       <div class="post-title">
         <a class="post-title-link" href="/2023/10/15/houses/" itemprop="url">
-          <span itemprop="name">基于伯克利ds100的数据分析项目</span>
+          <span itemprop="name">基于伯克利ds100的数据分析项目(待续)</span>
         </a>
       </div>
 
@@ -358,13 +358,13 @@ <h1 class="collection-header">python
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/vim/index.html b/tags/vim/index.html
index d39806dcc..bc6023e12 100644
--- a/tags/vim/index.html
+++ b/tags/vim/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">vim
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/tags/webstack/index.html b/tags/webstack/index.html
index e68594547..8a9950ec0 100644
--- a/tags/webstack/index.html
+++ b/tags/webstack/index.html
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">webstack
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\344\270\255\347\247\221\345\244\247/index.html" "b/tags/\344\270\255\347\247\221\345\244\247/index.html"
index cf5357283..be2eea85b 100644
--- "a/tags/\344\270\255\347\247\221\345\244\247/index.html"
+++ "b/tags/\344\270\255\347\247\221\345\244\247/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">中科大
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\344\274\257\345\205\213\345\210\251/index.html" "b/tags/\344\274\257\345\205\213\345\210\251/index.html"
index ef7c1b2a5..78755dbeb 100644
--- "a/tags/\344\274\257\345\205\213\345\210\251/index.html"
+++ "b/tags/\344\274\257\345\205\213\345\210\251/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -265,7 +265,7 @@ <h1 class="collection-header">伯克利
 
       <div class="post-title">
         <a class="post-title-link" href="/2023/10/15/houses/" itemprop="url">
-          <span itemprop="name">基于伯克利ds100的数据分析项目</span>
+          <span itemprop="name">基于伯克利ds100的数据分析项目(待续)</span>
         </a>
       </div>
 
@@ -378,13 +378,13 @@ <h1 class="collection-header">伯克利
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\345\214\227\344\272\254\345\244\247\345\255\246/index.html" "b/tags/\345\214\227\344\272\254\345\244\247\345\255\246/index.html"
index 940212c71..d67f437fd 100644
--- "a/tags/\345\214\227\344\272\254\345\244\247\345\255\246/index.html"
+++ "b/tags/\345\214\227\344\272\254\345\244\247\345\255\246/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -318,13 +318,13 @@ <h1 class="collection-header">北京大学
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\345\267\253\345\270\210\344\272\214/index.html" "b/tags/\345\267\253\345\270\210\344\272\214/index.html"
index bf5e8ca42..f8184f4ef 100644
--- "a/tags/\345\267\253\345\270\210\344\272\214/index.html"
+++ "b/tags/\345\267\253\345\270\210\344\272\214/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">巫师二
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\345\275\261\345\255\220\345\267\245\345\216\202/index.html" "b/tags/\345\275\261\345\255\220\345\267\245\345\216\202/index.html"
index 88628fc9c..477bef623 100644
--- "a/tags/\345\275\261\345\255\220\345\267\245\345\216\202/index.html"
+++ "b/tags/\345\275\261\345\255\220\345\267\245\345\216\202/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">影子工厂
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\346\223\215\344\275\234\347\263\273\347\273\237/index.html" "b/tags/\346\223\215\344\275\234\347\263\273\347\273\237/index.html"
index 8046783b2..b0e6f6c2d 100644
--- "a/tags/\346\223\215\344\275\234\347\263\273\347\273\237/index.html"
+++ "b/tags/\346\223\215\344\275\234\347\263\273\347\273\237/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">操作系统
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\346\225\260\346\215\256\347\247\221\345\255\246/index.html" "b/tags/\346\225\260\346\215\256\347\247\221\345\255\246/index.html"
index 7a68f8327..7eb3b4aa2 100644
--- "a/tags/\346\225\260\346\215\256\347\247\221\345\255\246/index.html"
+++ "b/tags/\346\225\260\346\215\256\347\247\221\345\255\246/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -265,7 +265,7 @@ <h1 class="collection-header">数据科学
 
       <div class="post-title">
         <a class="post-title-link" href="/2023/10/15/houses/" itemprop="url">
-          <span itemprop="name">基于伯克利ds100的数据分析项目</span>
+          <span itemprop="name">基于伯克利ds100的数据分析项目(待续)</span>
         </a>
       </div>
 
@@ -338,13 +338,13 @@ <h1 class="collection-header">数据科学
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\346\225\260\346\215\256\347\273\223\346\236\204\344\270\216\347\256\227\346\263\225/index.html" "b/tags/\346\225\260\346\215\256\347\273\223\346\236\204\344\270\216\347\256\227\346\263\225/index.html"
index 6ccd5fbc5..3ce8d218c 100644
--- "a/tags/\346\225\260\346\215\256\347\273\223\346\236\204\344\270\216\347\256\227\346\263\225/index.html"
+++ "b/tags/\346\225\260\346\215\256\347\273\223\346\236\204\344\270\216\347\256\227\346\263\225/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -338,13 +338,13 @@ <h1 class="collection-header">数据结构与算法
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\346\226\257\345\235\246\347\246\217/index.html" "b/tags/\346\226\257\345\235\246\347\246\217/index.html"
index fb297f26e..3a15f053b 100644
--- "a/tags/\346\226\257\345\235\246\347\246\217/index.html"
+++ "b/tags/\346\226\257\345\235\246\347\246\217/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -318,13 +318,13 @@ <h1 class="collection-header">斯坦福
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\346\255\245\350\241\214\346\250\241\346\213\237\345\231\250/index.html" "b/tags/\346\255\245\350\241\214\346\250\241\346\213\237\345\231\250/index.html"
index 837e4a81e..d70edf044 100644
--- "a/tags/\346\255\245\350\241\214\346\250\241\346\213\237\345\231\250/index.html"
+++ "b/tags/\346\255\245\350\241\214\346\250\241\346\213\237\345\231\250/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">步行模拟器
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\346\270\270\346\210\217\346\235\202\350\260\210/index.html" "b/tags/\346\270\270\346\210\217\346\235\202\350\260\210/index.html"
index 2241646df..f7a097240 100644
--- "a/tags/\346\270\270\346\210\217\346\235\202\350\260\210/index.html"
+++ "b/tags/\346\270\270\346\210\217\346\235\202\350\260\210/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -478,13 +478,13 @@ <h1 class="collection-header">游戏杂谈
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\347\247\230\345\257\206/index.html" "b/tags/\347\247\230\345\257\206/index.html"
index 1f0123382..49abbac26 100644
--- "a/tags/\347\247\230\345\257\206/index.html"
+++ "b/tags/\347\247\230\345\257\206/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">秘密
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\347\256\227\346\263\225/index.html" "b/tags/\347\256\227\346\263\225/index.html"
index e23533838..c3adc13ba 100644
--- "a/tags/\347\256\227\346\263\225/index.html"
+++ "b/tags/\347\256\227\346\263\225/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">算法
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\347\263\273\347\273\237\347\256\241\347\220\206/index.html" "b/tags/\347\263\273\347\273\237\347\256\241\347\220\206/index.html"
index 85203d3be..f3c48badd 100644
--- "a/tags/\347\263\273\347\273\237\347\256\241\347\220\206/index.html"
+++ "b/tags/\347\263\273\347\273\237\347\256\241\347\220\206/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">系统管理
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\347\274\226\347\250\213\345\267\245\345\205\267/index.html" "b/tags/\347\274\226\347\250\213\345\267\245\345\205\267/index.html"
index cb2b16554..5fbb41fef 100644
--- "a/tags/\347\274\226\347\250\213\345\267\245\345\205\267/index.html"
+++ "b/tags/\347\274\226\347\250\213\345\267\245\345\205\267/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -318,13 +318,13 @@ <h1 class="collection-header">编程工具
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\350\213\217\345\267\236\345\244\247\345\255\246/index.html" "b/tags/\350\213\217\345\267\236\345\244\247\345\255\246/index.html"
index 8759f614c..affa04429 100644
--- "a/tags/\350\213\217\345\267\236\345\244\247\345\255\246/index.html"
+++ "b/tags/\350\213\217\345\267\236\345\244\247\345\255\246/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -338,13 +338,13 @@ <h1 class="collection-header">苏州大学
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\350\256\241\347\256\227\346\234\272\347\273\204\346\210\220/index.html" "b/tags/\350\256\241\347\256\227\346\234\272\347\273\204\346\210\220/index.html"
index 168a16438..899fc5f0f 100644
--- "a/tags/\350\256\241\347\256\227\346\234\272\347\273\204\346\210\220/index.html"
+++ "b/tags/\350\256\241\347\256\227\346\234\272\347\273\204\346\210\220/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">计算机组成
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\350\256\241\347\256\227\346\234\272\347\275\221\347\273\234/index.html" "b/tags/\350\256\241\347\256\227\346\234\272\347\275\221\347\273\234/index.html"
index c24571cf9..ead6ffb48 100644
--- "a/tags/\350\256\241\347\256\227\346\234\272\347\275\221\347\273\234/index.html"
+++ "b/tags/\350\256\241\347\256\227\346\234\272\347\275\221\347\273\234/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">计算机网络
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\350\257\273\344\271\246\347\254\224\350\256\260/index.html" "b/tags/\350\257\273\344\271\246\347\254\224\350\256\260/index.html"
index 40e1b383c..6b2305668 100644
--- "a/tags/\350\257\273\344\271\246\347\254\224\350\256\260/index.html"
+++ "b/tags/\350\257\273\344\271\246\347\254\224\350\256\260/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">读书笔记
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\350\257\276\347\250\213\347\254\224\350\256\260/index.html" "b/tags/\350\257\276\347\250\213\347\254\224\350\256\260/index.html"
index 1ef854ae2..f6e231427 100644
--- "a/tags/\350\257\276\347\250\213\347\254\224\350\256\260/index.html"
+++ "b/tags/\350\257\276\347\250\213\347\254\224\350\256\260/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -265,7 +265,7 @@ <h1 class="collection-header">课程笔记
 
       <div class="post-title">
         <a class="post-title-link" href="/2023/10/15/houses/" itemprop="url">
-          <span itemprop="name">基于伯克利ds100的数据分析项目</span>
+          <span itemprop="name">基于伯克利ds100的数据分析项目(待续)</span>
         </a>
       </div>
 
@@ -481,13 +481,13 @@ <h1 class="collection-header">课程笔记
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\350\257\276\347\250\213\347\254\224\350\256\260/page/2/index.html" "b/tags/\350\257\276\347\250\213\347\254\224\350\256\260/page/2/index.html"
index 88f8b2b7f..f622ef181 100644
--- "a/tags/\350\257\276\347\250\213\347\254\224\350\256\260/page/2/index.html"
+++ "b/tags/\350\257\276\347\250\213\347\254\224\350\256\260/page/2/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -381,13 +381,13 @@ <h1 class="collection-header">课程笔记
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\350\277\252\347\221\236\345\205\213\346\213\211/index.html" "b/tags/\350\277\252\347\221\236\345\205\213\346\213\211/index.html"
index bde82a37d..6b2e277bc 100644
--- "a/tags/\350\277\252\347\221\236\345\205\213\346\213\211/index.html"
+++ "b/tags/\350\277\252\347\221\236\345\205\213\346\213\211/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -338,13 +338,13 @@ <h1 class="collection-header">迪瑞克拉
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\351\272\273\347\234\201\347\220\206\345\267\245/index.html" "b/tags/\351\272\273\347\234\201\347\220\206\345\267\245/index.html"
index 3e8ab4d84..86bc2305c 100644
--- "a/tags/\351\272\273\347\234\201\347\220\206\345\267\245/index.html"
+++ "b/tags/\351\272\273\347\234\201\347\220\206\345\267\245/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -338,13 +338,13 @@ <h1 class="collection-header">麻省理工
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git "a/tags/\351\276\231\350\205\276\344\270\226\347\272\252/index.html" "b/tags/\351\276\231\350\205\276\344\270\226\347\272\252/index.html"
index 5e51e658d..fbdf9f3cd 100644
--- "a/tags/\351\276\231\350\205\276\344\270\226\347\272\252/index.html"
+++ "b/tags/\351\276\231\350\205\276\344\270\226\347\272\252/index.html"
@@ -193,7 +193,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -298,13 +298,13 @@ <h1 class="collection-header">龙腾世纪
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">
diff --git a/thanks/index.html b/thanks/index.html
index eb8193077..4c4c28621 100644
--- a/thanks/index.html
+++ b/thanks/index.html
@@ -197,7 +197,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">32</span>
+          <span class="site-state-item-count">33</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -293,13 +293,13 @@ <h1 id="And-you"><a href="#And-you" class="headerlink" title="And you"></a>And y
     <span class="post-meta-item-icon">
       <i class="fa fa-chart-line"></i>
     </span>
-    <span title="站点总字数">238k</span>
+    <span title="站点总字数">250k</span>
   </span>
   <span class="post-meta-item">
     <span class="post-meta-item-icon">
       <i class="fa fa-coffee"></i>
     </span>
-    <span title="站点阅读时长">3:36</span>
+    <span title="站点阅读时长">3:48</span>
   </span>
 </div>
 <div class="busuanzi-count">