Ver código fonte

Site updated: 2020-03-26 08:16:08

schtonn 5 anos atrás
pai
commit
a9e93164d3

+ 10 - 10
archives/2020/03/index.html

@@ -186,7 +186,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/matrix-pow/" itemprop="url">
+          <a class="post-title-link" href="/posts/matrix-pow/" itemprop="url">
             <span itemprop="name">矩阵快速幂运用</span>
           </a>
       </h2>
@@ -206,7 +206,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/computer/" itemprop="url">
+          <a class="post-title-link" href="/posts/computer/" itemprop="url">
             <span itemprop="name">How do computers work?</span>
           </a>
       </h2>
@@ -226,7 +226,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/segment-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/segment-tree/" itemprop="url">
             <span itemprop="name">线段树</span>
           </a>
       </h2>
@@ -246,7 +246,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/ferbonacci/" itemprop="url">
+          <a class="post-title-link" href="/posts/ferbonacci/" itemprop="url">
             <span itemprop="name">斐波那契数列-O(1)</span>
           </a>
       </h2>
@@ -266,7 +266,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/dinic/" itemprop="url">
+          <a class="post-title-link" href="/posts/dinic/" itemprop="url">
             <span itemprop="name">网络最大流-Dinic</span>
           </a>
       </h2>
@@ -286,7 +286,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/min-span-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/min-span-tree/" itemprop="url">
             <span itemprop="name">最小生成树</span>
           </a>
       </h2>
@@ -306,7 +306,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/union-find/" itemprop="url">
+          <a class="post-title-link" href="/posts/union-find/" itemprop="url">
             <span itemprop="name">并查集</span>
           </a>
       </h2>
@@ -326,7 +326,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/tree-link/" itemprop="url">
+          <a class="post-title-link" href="/posts/tree-link/" itemprop="url">
             <span itemprop="name">树链剖分</span>
           </a>
       </h2>
@@ -346,7 +346,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/plan/" itemprop="url">
+          <a class="post-title-link" href="/posts/plan/" itemprop="url">
             <span itemprop="name">plan</span>
           </a>
       </h2>
@@ -366,7 +366,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/test/" itemprop="url">
+          <a class="post-title-link" href="/posts/test/" itemprop="url">
             <span itemprop="name">test</span>
           </a>
       </h2>

+ 10 - 10
archives/2020/index.html

@@ -186,7 +186,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/matrix-pow/" itemprop="url">
+          <a class="post-title-link" href="/posts/matrix-pow/" itemprop="url">
             <span itemprop="name">矩阵快速幂运用</span>
           </a>
       </h2>
@@ -206,7 +206,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/computer/" itemprop="url">
+          <a class="post-title-link" href="/posts/computer/" itemprop="url">
             <span itemprop="name">How do computers work?</span>
           </a>
       </h2>
@@ -226,7 +226,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/segment-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/segment-tree/" itemprop="url">
             <span itemprop="name">线段树</span>
           </a>
       </h2>
@@ -246,7 +246,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/ferbonacci/" itemprop="url">
+          <a class="post-title-link" href="/posts/ferbonacci/" itemprop="url">
             <span itemprop="name">斐波那契数列-O(1)</span>
           </a>
       </h2>
@@ -266,7 +266,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/dinic/" itemprop="url">
+          <a class="post-title-link" href="/posts/dinic/" itemprop="url">
             <span itemprop="name">网络最大流-Dinic</span>
           </a>
       </h2>
@@ -286,7 +286,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/min-span-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/min-span-tree/" itemprop="url">
             <span itemprop="name">最小生成树</span>
           </a>
       </h2>
@@ -306,7 +306,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/union-find/" itemprop="url">
+          <a class="post-title-link" href="/posts/union-find/" itemprop="url">
             <span itemprop="name">并查集</span>
           </a>
       </h2>
@@ -326,7 +326,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/tree-link/" itemprop="url">
+          <a class="post-title-link" href="/posts/tree-link/" itemprop="url">
             <span itemprop="name">树链剖分</span>
           </a>
       </h2>
@@ -346,7 +346,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/plan/" itemprop="url">
+          <a class="post-title-link" href="/posts/plan/" itemprop="url">
             <span itemprop="name">plan</span>
           </a>
       </h2>
@@ -366,7 +366,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/test/" itemprop="url">
+          <a class="post-title-link" href="/posts/test/" itemprop="url">
             <span itemprop="name">test</span>
           </a>
       </h2>

+ 10 - 10
archives/index.html

@@ -186,7 +186,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/matrix-pow/" itemprop="url">
+          <a class="post-title-link" href="/posts/matrix-pow/" itemprop="url">
             <span itemprop="name">矩阵快速幂运用</span>
           </a>
       </h2>
@@ -206,7 +206,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/computer/" itemprop="url">
+          <a class="post-title-link" href="/posts/computer/" itemprop="url">
             <span itemprop="name">How do computers work?</span>
           </a>
       </h2>
@@ -226,7 +226,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/segment-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/segment-tree/" itemprop="url">
             <span itemprop="name">线段树</span>
           </a>
       </h2>
@@ -246,7 +246,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/ferbonacci/" itemprop="url">
+          <a class="post-title-link" href="/posts/ferbonacci/" itemprop="url">
             <span itemprop="name">斐波那契数列-O(1)</span>
           </a>
       </h2>
@@ -266,7 +266,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/dinic/" itemprop="url">
+          <a class="post-title-link" href="/posts/dinic/" itemprop="url">
             <span itemprop="name">网络最大流-Dinic</span>
           </a>
       </h2>
@@ -286,7 +286,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/min-span-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/min-span-tree/" itemprop="url">
             <span itemprop="name">最小生成树</span>
           </a>
       </h2>
@@ -306,7 +306,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/union-find/" itemprop="url">
+          <a class="post-title-link" href="/posts/union-find/" itemprop="url">
             <span itemprop="name">并查集</span>
           </a>
       </h2>
@@ -326,7 +326,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/tree-link/" itemprop="url">
+          <a class="post-title-link" href="/posts/tree-link/" itemprop="url">
             <span itemprop="name">树链剖分</span>
           </a>
       </h2>
@@ -346,7 +346,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/plan/" itemprop="url">
+          <a class="post-title-link" href="/posts/plan/" itemprop="url">
             <span itemprop="name">plan</span>
           </a>
       </h2>
@@ -366,7 +366,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/test/" itemprop="url">
+          <a class="post-title-link" href="/posts/test/" itemprop="url">
             <span itemprop="name">test</span>
           </a>
       </h2>

Diferenças do arquivo suprimidas por serem muito extensas
+ 5 - 5
index.html


+ 8 - 8
posts/2020/computer/index.html → posts/computer/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="This page is locked">
 <meta property="og:type" content="article">
 <meta property="og:title" content="How do computers work?">
-<meta property="og:url" content="https://schtonn.github.io/posts/2020/computer/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/computer/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="This page is locked">
 <meta property="og:locale" content="en_US">
@@ -39,7 +39,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://schtonn.github.io/images/transistor.png">
 
-<link rel="canonical" href="https://schtonn.github.io/posts/2020/computer/">
+<link rel="canonical" href="https://schtonn.github.io/posts/computer/">
 
 
 <script id="page-configurations">
@@ -172,7 +172,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/computer/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/computer/">
 <script>
     (function(){
         if('x14'){
@@ -226,8 +226,8 @@
       </span>
       <span class="post-meta-item-text">Valine: </span>
     
-    <a title="valine" href="/posts/2020/computer/#valine-comments" itemprop="discussionUrl">
-      <span class="post-comments-count valine-comment-count" data-xid="/posts/2020/computer/" itemprop="commentCount"></span>
+    <a title="valine" href="/posts/computer/#valine-comments" itemprop="discussionUrl">
+      <span class="post-comments-count valine-comment-count" data-xid="/posts/computer/" itemprop="commentCount"></span>
     </a>
   </span>
   
@@ -332,7 +332,7 @@ your browser does not support the video tag<br />
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/posts/2020/computer/" title="How do computers work?">https://schtonn.github.io/posts/2020/computer/</a>
+    <a href="https://schtonn.github.io/posts/computer/" title="How do computers work?">https://schtonn.github.io/posts/computer/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -353,11 +353,11 @@ your browser does not support the video tag<br />
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/posts/2020/segment-tree/" rel="prev" title="线段树">
+    <a href="/posts/segment-tree/" rel="prev" title="线段树">
       <i class="fa fa-chevron-left"></i> 线段树
     </a></div>
       <div class="post-nav-item">
-    <a href="/posts/2020/matrix-pow/" rel="next" title="矩阵快速幂运用">
+    <a href="/posts/matrix-pow/" rel="next" title="矩阵快速幂运用">
       矩阵快速幂运用 <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>

+ 8 - 8
posts/2020/dinic/index.html → posts/dinic/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="前置知识 存图方式(邻接表,邻接矩阵),图的遍历(dfs,bfs)  引入 我们举个例子吧: 有一个毒瘤水管工,他会造水管,有一天他造了一个水管网络,就像一个图。其中有一个点只有出边,就是起点,还有一个点只有入边,是终点。 点之间有一些管子,这些管子都有单位时间内的容量,现在毒瘤水管工想知道,他的管子在单位时间内在起点终点之间最多能流多少水。">
 <meta property="og:type" content="article">
 <meta property="og:title" content="网络最大流-Dinic">
-<meta property="og:url" content="https://schtonn.github.io/posts/2020/dinic/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/dinic/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="前置知识 存图方式(邻接表,邻接矩阵),图的遍历(dfs,bfs)  引入 我们举个例子吧: 有一个毒瘤水管工,他会造水管,有一天他造了一个水管网络,就像一个图。其中有一个点只有出边,就是起点,还有一个点只有入边,是终点。 点之间有一些管子,这些管子都有单位时间内的容量,现在毒瘤水管工想知道,他的管子在单位时间内在起点终点之间最多能流多少水。">
 <meta property="og:locale" content="en_US">
@@ -39,7 +39,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://img-blog.csdnimg.cn/20200111112801923.png">
 
-<link rel="canonical" href="https://schtonn.github.io/posts/2020/dinic/">
+<link rel="canonical" href="https://schtonn.github.io/posts/dinic/">
 
 
 <script id="page-configurations">
@@ -172,7 +172,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/dinic/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/dinic/">
 <script>
     (function(){
         if(''){
@@ -226,8 +226,8 @@
       </span>
       <span class="post-meta-item-text">Valine: </span>
     
-    <a title="valine" href="/posts/2020/dinic/#valine-comments" itemprop="discussionUrl">
-      <span class="post-comments-count valine-comment-count" data-xid="/posts/2020/dinic/" itemprop="commentCount"></span>
+    <a title="valine" href="/posts/dinic/#valine-comments" itemprop="discussionUrl">
+      <span class="post-comments-count valine-comment-count" data-xid="/posts/dinic/" itemprop="commentCount"></span>
     </a>
   </span>
   
@@ -303,7 +303,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/posts/2020/dinic/" title="网络最大流-Dinic">https://schtonn.github.io/posts/2020/dinic/</a>
+    <a href="https://schtonn.github.io/posts/dinic/" title="网络最大流-Dinic">https://schtonn.github.io/posts/dinic/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -324,11 +324,11 @@
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/posts/2020/min-span-tree/" rel="prev" title="最小生成树">
+    <a href="/posts/min-span-tree/" rel="prev" title="最小生成树">
       <i class="fa fa-chevron-left"></i> 最小生成树
     </a></div>
       <div class="post-nav-item">
-    <a href="/posts/2020/ferbonacci/" rel="next" title="斐波那契数列-O(1)">
+    <a href="/posts/ferbonacci/" rel="next" title="斐波那契数列-O(1)">
       斐波那契数列-O(1) <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>

+ 8 - 8
posts/2020/ferbonacci/index.html → posts/ferbonacci/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="引自:《信息学奥赛之-数学一本通》 揍是这样: F⁡(n)&#x3D;55⋅[(1+5)n−(1−5)n]\operatorname{F}(n)&#x3D;\dfrac{\sqrt{5}}{5}\cdot\left[\left(1+\sqrt{5}\right)^n-\left(1-\sqrt{5}\right)^n\right] F(n)&#x3D;55​​⋅[(1+5​)n−(1−5​)n] 代码揍这么简单: 123int">
 <meta property="og:type" content="article">
 <meta property="og:title" content="斐波那契数列-O(1)">
-<meta property="og:url" content="https://schtonn.github.io/posts/2020/ferbonacci/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/ferbonacci/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="引自:《信息学奥赛之-数学一本通》 揍是这样: F⁡(n)&#x3D;55⋅[(1+5)n−(1−5)n]\operatorname{F}(n)&#x3D;\dfrac{\sqrt{5}}{5}\cdot\left[\left(1+\sqrt{5}\right)^n-\left(1-\sqrt{5}\right)^n\right] F(n)&#x3D;55​​⋅[(1+5​)n−(1−5​)n] 代码揍这么简单: 123int">
 <meta property="og:locale" content="en_US">
@@ -35,7 +35,7 @@
 <meta property="article:tag" content="math">
 <meta name="twitter:card" content="summary">
 
-<link rel="canonical" href="https://schtonn.github.io/posts/2020/ferbonacci/">
+<link rel="canonical" href="https://schtonn.github.io/posts/ferbonacci/">
 
 
 <script id="page-configurations">
@@ -168,7 +168,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/ferbonacci/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/ferbonacci/">
 <script>
     (function(){
         if(''){
@@ -222,8 +222,8 @@
       </span>
       <span class="post-meta-item-text">Valine: </span>
     
-    <a title="valine" href="/posts/2020/ferbonacci/#valine-comments" itemprop="discussionUrl">
-      <span class="post-comments-count valine-comment-count" data-xid="/posts/2020/ferbonacci/" itemprop="commentCount"></span>
+    <a title="valine" href="/posts/ferbonacci/#valine-comments" itemprop="discussionUrl">
+      <span class="post-comments-count valine-comment-count" data-xid="/posts/ferbonacci/" itemprop="commentCount"></span>
     </a>
   </span>
   
@@ -278,7 +278,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/posts/2020/ferbonacci/" title="斐波那契数列-O(1)">https://schtonn.github.io/posts/2020/ferbonacci/</a>
+    <a href="https://schtonn.github.io/posts/ferbonacci/" title="斐波那契数列-O(1)">https://schtonn.github.io/posts/ferbonacci/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -299,11 +299,11 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/posts/2020/dinic/" rel="prev" title="网络最大流-Dinic">
+    <a href="/posts/dinic/" rel="prev" title="网络最大流-Dinic">
       <i class="fa fa-chevron-left"></i> 网络最大流-Dinic
     </a></div>
       <div class="post-nav-item">
-    <a href="/posts/2020/segment-tree/" rel="next" title="线段树">
+    <a href="/posts/segment-tree/" rel="next" title="线段树">
       线段树 <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>

+ 7 - 7
posts/2020/matrix-pow/index.html → posts/matrix-pow/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="引入 想要了解矩阵快速幂,就不得不提到矩阵的概念。矩阵就像一个二维数组,存储了一组数据,如: M&#x3D;[123456789]M&#x3D;\left[  \begin{matrix}   1&amp;2&amp;3\\   4&amp;5&amp;6\\   7&amp;8&amp;9\end{matrix} \right]M&#x3D;⎣⎡​147​258​369​⎦⎤​ 用 MijM_{ij}Mij​ 表示矩阵第">
 <meta property="og:type" content="article">
 <meta property="og:title" content="矩阵快速幂运用">
-<meta property="og:url" content="https://schtonn.github.io/posts/2020/matrix-pow/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/matrix-pow/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="引入 想要了解矩阵快速幂,就不得不提到矩阵的概念。矩阵就像一个二维数组,存储了一组数据,如: M&#x3D;[123456789]M&#x3D;\left[  \begin{matrix}   1&amp;2&amp;3\\   4&amp;5&amp;6\\   7&amp;8&amp;9\end{matrix} \right]M&#x3D;⎣⎡​147​258​369​⎦⎤​ 用 MijM_{ij}Mij​ 表示矩阵第">
 <meta property="og:locale" content="en_US">
@@ -35,7 +35,7 @@
 <meta property="article:tag" content="math">
 <meta name="twitter:card" content="summary">
 
-<link rel="canonical" href="https://schtonn.github.io/posts/2020/matrix-pow/">
+<link rel="canonical" href="https://schtonn.github.io/posts/matrix-pow/">
 
 
 <script id="page-configurations">
@@ -168,7 +168,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/matrix-pow/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/matrix-pow/">
 <script>
     (function(){
         if(''){
@@ -216,8 +216,8 @@
       </span>
       <span class="post-meta-item-text">Valine: </span>
     
-    <a title="valine" href="/posts/2020/matrix-pow/#valine-comments" itemprop="discussionUrl">
-      <span class="post-comments-count valine-comment-count" data-xid="/posts/2020/matrix-pow/" itemprop="commentCount"></span>
+    <a title="valine" href="/posts/matrix-pow/#valine-comments" itemprop="discussionUrl">
+      <span class="post-comments-count valine-comment-count" data-xid="/posts/matrix-pow/" itemprop="commentCount"></span>
     </a>
   </span>
   
@@ -341,7 +341,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/posts/2020/matrix-pow/" title="矩阵快速幂运用">https://schtonn.github.io/posts/2020/matrix-pow/</a>
+    <a href="https://schtonn.github.io/posts/matrix-pow/" title="矩阵快速幂运用">https://schtonn.github.io/posts/matrix-pow/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -362,7 +362,7 @@
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/posts/2020/computer/" rel="prev" title="How do computers work?">
+    <a href="/posts/computer/" rel="prev" title="How do computers work?">
       <i class="fa fa-chevron-left"></i> How do computers work?
     </a></div>
       <div class="post-nav-item"></div>

+ 8 - 8
posts/2020/min-span-tree/index.html → posts/min-span-tree/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="前置知识 存图方式(邻接表,邻接矩阵),并查集。 不会的快进入链接学习吧!  引入 生成树,就是从一个图中选中n−1n-1n−1条边,使得这些边构成一棵树,并包含图中的所有节点。 最小生成树,就是找到一种生成树,使得这个生成树的边权和最小。">
 <meta property="og:type" content="article">
 <meta property="og:title" content="最小生成树">
-<meta property="og:url" content="https://schtonn.github.io/posts/2020/min-span-tree/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/min-span-tree/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="前置知识 存图方式(邻接表,邻接矩阵),并查集。 不会的快进入链接学习吧!  引入 生成树,就是从一个图中选中n−1n-1n−1条边,使得这些边构成一棵树,并包含图中的所有节点。 最小生成树,就是找到一种生成树,使得这个生成树的边权和最小。">
 <meta property="og:locale" content="en_US">
@@ -48,7 +48,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://img-blog.csdnimg.cn/20200103203601629.png">
 
-<link rel="canonical" href="https://schtonn.github.io/posts/2020/min-span-tree/">
+<link rel="canonical" href="https://schtonn.github.io/posts/min-span-tree/">
 
 
 <script id="page-configurations">
@@ -181,7 +181,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/min-span-tree/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/min-span-tree/">
 <script>
     (function(){
         if(''){
@@ -235,8 +235,8 @@
       </span>
       <span class="post-meta-item-text">Valine: </span>
     
-    <a title="valine" href="/posts/2020/min-span-tree/#valine-comments" itemprop="discussionUrl">
-      <span class="post-comments-count valine-comment-count" data-xid="/posts/2020/min-span-tree/" itemprop="commentCount"></span>
+    <a title="valine" href="/posts/min-span-tree/#valine-comments" itemprop="discussionUrl">
+      <span class="post-comments-count valine-comment-count" data-xid="/posts/min-span-tree/" itemprop="commentCount"></span>
     </a>
   </span>
   
@@ -314,7 +314,7 @@ kruskal算法使用了一种极速闪电致命又自杀的东西:并查集。<
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/posts/2020/min-span-tree/" title="最小生成树">https://schtonn.github.io/posts/2020/min-span-tree/</a>
+    <a href="https://schtonn.github.io/posts/min-span-tree/" title="最小生成树">https://schtonn.github.io/posts/min-span-tree/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -335,11 +335,11 @@ kruskal算法使用了一种极速闪电致命又自杀的东西:并查集。<
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/posts/2020/union-find/" rel="prev" title="并查集">
+    <a href="/posts/union-find/" rel="prev" title="并查集">
       <i class="fa fa-chevron-left"></i> 并查集
     </a></div>
       <div class="post-nav-item">
-    <a href="/posts/2020/dinic/" rel="next" title="网络最大流-Dinic">
+    <a href="/posts/dinic/" rel="next" title="网络最大流-Dinic">
       网络最大流-Dinic <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>

+ 8 - 8
posts/2020/plan/index.html → posts/plan/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="This page is locked.">
 <meta property="og:type" content="article">
 <meta property="og:title" content="plan">
-<meta property="og:url" content="https://schtonn.github.io/posts/2020/plan/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/plan/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="This page is locked.">
 <meta property="og:locale" content="en_US">
@@ -35,7 +35,7 @@
 <meta property="article:tag" content="other">
 <meta name="twitter:card" content="summary">
 
-<link rel="canonical" href="https://schtonn.github.io/posts/2020/plan/">
+<link rel="canonical" href="https://schtonn.github.io/posts/plan/">
 
 
 <script id="page-configurations">
@@ -168,7 +168,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/plan/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/plan/">
 <script>
     (function(){
         if('159375abc'){
@@ -226,8 +226,8 @@
       </span>
       <span class="post-meta-item-text">Valine: </span>
     
-    <a title="valine" href="/posts/2020/plan/#valine-comments" itemprop="discussionUrl">
-      <span class="post-comments-count valine-comment-count" data-xid="/posts/2020/plan/" itemprop="commentCount"></span>
+    <a title="valine" href="/posts/plan/#valine-comments" itemprop="discussionUrl">
+      <span class="post-comments-count valine-comment-count" data-xid="/posts/plan/" itemprop="commentCount"></span>
     </a>
   </span>
   
@@ -360,7 +360,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/posts/2020/plan/" title="plan">https://schtonn.github.io/posts/2020/plan/</a>
+    <a href="https://schtonn.github.io/posts/plan/" title="plan">https://schtonn.github.io/posts/plan/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -381,11 +381,11 @@
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/posts/2020/test/" rel="prev" title="test">
+    <a href="/posts/test/" rel="prev" title="test">
       <i class="fa fa-chevron-left"></i> test
     </a></div>
       <div class="post-nav-item">
-    <a href="/posts/2020/tree-link/" rel="next" title="树链剖分">
+    <a href="/posts/tree-link/" rel="next" title="树链剖分">
       树链剖分 <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>

+ 8 - 8
posts/2020/segment-tree/index.html → posts/segment-tree/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="前置知识 数组,结构体,二叉树  引入 有时候我们会遇到一些大规模的区间查找和区间修改问题,比如让你维护一个 10510^5105 长度的数列,要求操作有区间求和、区间加(区间每个数加上一个值),让你在一秒内完成 10510^5105 次操作。 暴力是肯定不行的,数据范围太大,操作太多,会超时。 所以我们就有一种专门解决大范围区间修改查询的数据结构:线段树。">
 <meta property="og:type" content="article">
 <meta property="og:title" content="线段树">
-<meta property="og:url" content="https://schtonn.github.io/posts/2020/segment-tree/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/segment-tree/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="前置知识 数组,结构体,二叉树  引入 有时候我们会遇到一些大规模的区间查找和区间修改问题,比如让你维护一个 10510^5105 长度的数列,要求操作有区间求和、区间加(区间每个数加上一个值),让你在一秒内完成 10510^5105 次操作。 暴力是肯定不行的,数据范围太大,操作太多,会超时。 所以我们就有一种专门解决大范围区间修改查询的数据结构:线段树。">
 <meta property="og:locale" content="en_US">
@@ -37,7 +37,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://schtonn.github.io/images/segment-1.png">
 
-<link rel="canonical" href="https://schtonn.github.io/posts/2020/segment-tree/">
+<link rel="canonical" href="https://schtonn.github.io/posts/segment-tree/">
 
 
 <script id="page-configurations">
@@ -170,7 +170,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/segment-tree/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/segment-tree/">
 <script>
     (function(){
         if(''){
@@ -224,8 +224,8 @@
       </span>
       <span class="post-meta-item-text">Valine: </span>
     
-    <a title="valine" href="/posts/2020/segment-tree/#valine-comments" itemprop="discussionUrl">
-      <span class="post-comments-count valine-comment-count" data-xid="/posts/2020/segment-tree/" itemprop="commentCount"></span>
+    <a title="valine" href="/posts/segment-tree/#valine-comments" itemprop="discussionUrl">
+      <span class="post-comments-count valine-comment-count" data-xid="/posts/segment-tree/" itemprop="commentCount"></span>
     </a>
   </span>
   
@@ -296,7 +296,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/posts/2020/segment-tree/" title="线段树">https://schtonn.github.io/posts/2020/segment-tree/</a>
+    <a href="https://schtonn.github.io/posts/segment-tree/" title="线段树">https://schtonn.github.io/posts/segment-tree/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -317,11 +317,11 @@
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/posts/2020/ferbonacci/" rel="prev" title="斐波那契数列-O(1)">
+    <a href="/posts/ferbonacci/" rel="prev" title="斐波那契数列-O(1)">
       <i class="fa fa-chevron-left"></i> 斐波那契数列-O(1)
     </a></div>
       <div class="post-nav-item">
-    <a href="/posts/2020/computer/" rel="next" title="How do computers work?">
+    <a href="/posts/computer/" rel="next" title="How do computers work?">
       How do computers work? <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>

+ 7 - 7
posts/2020/test/index.html → posts/test/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="Is KaTeX working?-IT WORKED!NICE!\texttt{Is KaTeX working?-IT WORKED!NICE!}Is KaTeX working?-IT WORKED!NICE! aba^b ab (ab)\left(\dfrac{a}{b}\right) (ba​)">
 <meta property="og:type" content="article">
 <meta property="og:title" content="test">
-<meta property="og:url" content="https://schtonn.github.io/posts/2020/test/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/test/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="Is KaTeX working?-IT WORKED!NICE!\texttt{Is KaTeX working?-IT WORKED!NICE!}Is KaTeX working?-IT WORKED!NICE! aba^b ab (ab)\left(\dfrac{a}{b}\right) (ba​)">
 <meta property="og:locale" content="en_US">
@@ -35,7 +35,7 @@
 <meta property="article:tag" content="other">
 <meta name="twitter:card" content="summary">
 
-<link rel="canonical" href="https://schtonn.github.io/posts/2020/test/">
+<link rel="canonical" href="https://schtonn.github.io/posts/test/">
 
 
 <script id="page-configurations">
@@ -168,7 +168,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/test/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/test/">
 <script>
     (function(){
         if(''){
@@ -222,8 +222,8 @@
       </span>
       <span class="post-meta-item-text">Valine: </span>
     
-    <a title="valine" href="/posts/2020/test/#valine-comments" itemprop="discussionUrl">
-      <span class="post-comments-count valine-comment-count" data-xid="/posts/2020/test/" itemprop="commentCount"></span>
+    <a title="valine" href="/posts/test/#valine-comments" itemprop="discussionUrl">
+      <span class="post-comments-count valine-comment-count" data-xid="/posts/test/" itemprop="commentCount"></span>
     </a>
   </span>
   
@@ -258,7 +258,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/posts/2020/test/" title="test">https://schtonn.github.io/posts/2020/test/</a>
+    <a href="https://schtonn.github.io/posts/test/" title="test">https://schtonn.github.io/posts/test/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -280,7 +280,7 @@
     <div class="post-nav">
       <div class="post-nav-item"></div>
       <div class="post-nav-item">
-    <a href="/posts/2020/plan/" rel="next" title="plan">
+    <a href="/posts/plan/" rel="next" title="plan">
       plan <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>

+ 8 - 8
posts/2020/tree-link/index.html → posts/tree-link/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="前置知识 必备:存图方式(邻接表,邻接矩阵),dfs序。 维护:线段树、树状数组、BST。 不会的快进入链接学习吧!  引入 树链剖分,简单来说就是把树分割成链,然后维护每一条链。一般的维护算法有线段树,树状数组和BST。复杂度为O(logn)O(log n)O(logn)。">
 <meta property="og:type" content="article">
 <meta property="og:title" content="树链剖分">
-<meta property="og:url" content="https://schtonn.github.io/posts/2020/tree-link/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/tree-link/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="前置知识 必备:存图方式(邻接表,邻接矩阵),dfs序。 维护:线段树、树状数组、BST。 不会的快进入链接学习吧!  引入 树链剖分,简单来说就是把树分割成链,然后维护每一条链。一般的维护算法有线段树,树状数组和BST。复杂度为O(logn)O(log n)O(logn)。">
 <meta property="og:locale" content="en_US">
@@ -37,7 +37,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://img-blog.csdnimg.cn/20191228195815530.png">
 
-<link rel="canonical" href="https://schtonn.github.io/posts/2020/tree-link/">
+<link rel="canonical" href="https://schtonn.github.io/posts/tree-link/">
 
 
 <script id="page-configurations">
@@ -170,7 +170,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/tree-link/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/tree-link/">
 <script>
     (function(){
         if(''){
@@ -224,8 +224,8 @@
       </span>
       <span class="post-meta-item-text">Valine: </span>
     
-    <a title="valine" href="/posts/2020/tree-link/#valine-comments" itemprop="discussionUrl">
-      <span class="post-comments-count valine-comment-count" data-xid="/posts/2020/tree-link/" itemprop="commentCount"></span>
+    <a title="valine" href="/posts/tree-link/#valine-comments" itemprop="discussionUrl">
+      <span class="post-comments-count valine-comment-count" data-xid="/posts/tree-link/" itemprop="commentCount"></span>
     </a>
   </span>
   
@@ -313,7 +313,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/posts/2020/tree-link/" title="树链剖分">https://schtonn.github.io/posts/2020/tree-link/</a>
+    <a href="https://schtonn.github.io/posts/tree-link/" title="树链剖分">https://schtonn.github.io/posts/tree-link/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -334,11 +334,11 @@
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/posts/2020/plan/" rel="prev" title="plan">
+    <a href="/posts/plan/" rel="prev" title="plan">
       <i class="fa fa-chevron-left"></i> plan
     </a></div>
       <div class="post-nav-item">
-    <a href="/posts/2020/union-find/" rel="next" title="并查集">
+    <a href="/posts/union-find/" rel="next" title="并查集">
       并查集 <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>

+ 8 - 8
posts/2020/union-find/index.html → posts/union-find/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="前置知识 哈哈,简单到爆,没有。  引入 并查集是一种快到爆炸的集合算法,可以进行两项基本操作:合并两个集合(并)、查询两个参数是否在一个集合内(查)。这也是它名字的由来。">
 <meta property="og:type" content="article">
 <meta property="og:title" content="并查集">
-<meta property="og:url" content="https://schtonn.github.io/posts/2020/union-find/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/union-find/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="前置知识 哈哈,简单到爆,没有。  引入 并查集是一种快到爆炸的集合算法,可以进行两项基本操作:合并两个集合(并)、查询两个参数是否在一个集合内(查)。这也是它名字的由来。">
 <meta property="og:locale" content="en_US">
@@ -44,7 +44,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://img-blog.csdnimg.cn/20200105142700396.png">
 
-<link rel="canonical" href="https://schtonn.github.io/posts/2020/union-find/">
+<link rel="canonical" href="https://schtonn.github.io/posts/union-find/">
 
 
 <script id="page-configurations">
@@ -177,7 +177,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/union-find/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/union-find/">
 <script>
     (function(){
         if(''){
@@ -231,8 +231,8 @@
       </span>
       <span class="post-meta-item-text">Valine: </span>
     
-    <a title="valine" href="/posts/2020/union-find/#valine-comments" itemprop="discussionUrl">
-      <span class="post-comments-count valine-comment-count" data-xid="/posts/2020/union-find/" itemprop="commentCount"></span>
+    <a title="valine" href="/posts/union-find/#valine-comments" itemprop="discussionUrl">
+      <span class="post-comments-count valine-comment-count" data-xid="/posts/union-find/" itemprop="commentCount"></span>
     </a>
   </span>
   
@@ -344,7 +344,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/posts/2020/union-find/" title="并查集">https://schtonn.github.io/posts/2020/union-find/</a>
+    <a href="https://schtonn.github.io/posts/union-find/" title="并查集">https://schtonn.github.io/posts/union-find/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -365,11 +365,11 @@
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/posts/2020/tree-link/" rel="prev" title="树链剖分">
+    <a href="/posts/tree-link/" rel="prev" title="树链剖分">
       <i class="fa fa-chevron-left"></i> 树链剖分
     </a></div>
       <div class="post-nav-item">
-    <a href="/posts/2020/min-span-tree/" rel="next" title="最小生成树">
+    <a href="/posts/min-span-tree/" rel="next" title="最小生成树">
       最小生成树 <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>

+ 4 - 4
tags/graph/index.html

@@ -188,7 +188,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/segment-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/segment-tree/" itemprop="url">
             <span itemprop="name">线段树</span>
           </a>
       </h2>
@@ -208,7 +208,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/dinic/" itemprop="url">
+          <a class="post-title-link" href="/posts/dinic/" itemprop="url">
             <span itemprop="name">网络最大流-Dinic</span>
           </a>
       </h2>
@@ -228,7 +228,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/min-span-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/min-span-tree/" itemprop="url">
             <span itemprop="name">最小生成树</span>
           </a>
       </h2>
@@ -248,7 +248,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/tree-link/" itemprop="url">
+          <a class="post-title-link" href="/posts/tree-link/" itemprop="url">
             <span itemprop="name">树链剖分</span>
           </a>
       </h2>

+ 2 - 2
tags/math/index.html

@@ -188,7 +188,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/matrix-pow/" itemprop="url">
+          <a class="post-title-link" href="/posts/matrix-pow/" itemprop="url">
             <span itemprop="name">矩阵快速幂运用</span>
           </a>
       </h2>
@@ -208,7 +208,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/ferbonacci/" itemprop="url">
+          <a class="post-title-link" href="/posts/ferbonacci/" itemprop="url">
             <span itemprop="name">斐波那契数列-O(1)</span>
           </a>
       </h2>

+ 3 - 3
tags/other/index.html

@@ -188,7 +188,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/computer/" itemprop="url">
+          <a class="post-title-link" href="/posts/computer/" itemprop="url">
             <span itemprop="name">How do computers work?</span>
           </a>
       </h2>
@@ -208,7 +208,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/plan/" itemprop="url">
+          <a class="post-title-link" href="/posts/plan/" itemprop="url">
             <span itemprop="name">plan</span>
           </a>
       </h2>
@@ -228,7 +228,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/test/" itemprop="url">
+          <a class="post-title-link" href="/posts/test/" itemprop="url">
             <span itemprop="name">test</span>
           </a>
       </h2>

+ 1 - 1
tags/struct/index.html

@@ -188,7 +188,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/posts/2020/union-find/" itemprop="url">
+          <a class="post-title-link" href="/posts/union-find/" itemprop="url">
             <span itemprop="name">并查集</span>
           </a>
       </h2>

Alguns arquivos não foram mostrados porque muitos arquivos mudaram nesse diff