leancloud_counter_security_urls.json

[{"title":"2017 ICPC Asia Urumqi A.coins (概率DP + 期望)","url":"/2019/08/10/2017-ICPC-Asia-Urumqi-A-coins-概率DP-期望/"},{"title":"2015 ACM-ICPC 亚洲区上海站 A - An Easy Physics Problem (计算几何)","url":"/2019/10/24/2015-ACM-ICPC-亚洲区上海站-A-An-Easy-Physics-Problem-计算几何/"},{"title":"2016 ICPC Mid-Central USA Region J. Windy Path (贪心)","url":"/2019/08/13/2016-ICPC-Mid-Central-USA-Region-J-Windy-Path-贪心/"},{"title":"2018 ECNA Regional Contest J. Watch Where You Step","url":"/2019/08/11/2018-ECNA-Regional-Contest-J-Watch-Where-You-Step/"},{"title":"2019 ACM-ICPC 南京 现场赛 K. Triangle (二分)","url":"/2019/10/28/2019-ACM-ICPC-南京-现场赛-K-Triangle-二分/"},{"title":"2018 ICPC Asia Singapore Regional A. Largest Triangle (计算几何)","url":"/2019/10/05/2018-ICPC-Asia-Singapore-Regional-A-Largest-Triangle-计算几何/"},{"title":"2019 ACM-ICPC 上海网络赛 B. Light bulbs (差分)","url":"/2019/09/15/2019-ACM-ICPC-上海网络赛-B-Light-bulbs-差分/"},{"title":"2019 ACM-ICPC 南京 现场赛 H. Prince and Princess","url":"/2019/10/27/2019-ACM-ICPC-南京站-H-Prince-and-Princess/"},{"title":"2019 年百度之星·程序设计大赛 - 初赛四 1001 Strassen","url":"/2019/08/25/2019-年百度之星·程序设计大赛-初赛四-1001-Strassen/"},{"title":"2019 杭电多校 第一场","url":"/2019/08/29/2019-杭电多校-第一场/"},{"title":"2019 杭电多校 第七场","url":"/2019/08/29/2019-杭电多校-第七场/"},{"title":"2019 杭电多校 第二场","url":"/2019/08/29/2019-杭电多校-第二场/"},{"title":"2019 杭电多校 第三场","url":"/2019/08/29/2019-杭电多校-第三场/"},{"title":"2019 杭电多校 第九场","url":"/2019/08/29/2019-杭电多校-第九场/"},{"title":"2019 杭电多校 第八场","url":"/2019/08/29/2019-杭电多校-第八场/"},{"title":"2019 杭电多校 第五场","url":"/2019/08/29/2019-杭电多校-第五场/"},{"title":"2019 杭电多校 第六场","url":"/2019/08/29/2019-杭电多校-第六场/"},{"title":"2019 杭电多校 第十场","url":"/2019/08/29/2019-杭电多校-第十场/"},{"title":"2019 杭电多校 第四场","url":"/2019/08/29/2019-杭电多校-第四场/"},{"title":"ACM-ICPC 比赛环境的使用","url":"/2019/10/25/ACM-ICPC-比赛环境的使用/"},{"title":"ACM 中的对拍程序","url":"/2019/10/26/ACM-中的对拍程序/"},{"title":"C++ STL rope 可持久化平衡树 (可持久化数组)","url":"/2019/10/02/C-STL-rope-可持久化平衡树-可持久化数组/"},{"title":"ACM 数学基础知识总结","url":"/2019/08/08/ACM-数学基础知识总结/"},{"title":"BZOJ 2460 & 洛谷 P4570 [BJWC2011]元素 (线性基 贪心)","url":"/2019/09/02/BZOJ-2460-洛谷-P4570-BJWC2011-元素-线性基-贪心/"},{"title":"C++ bitset的使用","url":"/2019/11/23/C-bitset的使用/"},{"title":"C++ 常见的cin的错误处理","url":"/2019/11/07/C-常见的cin的错误处理/"},{"title":"CH1201 最大子序和 (单调队列)","url":"/2019/09/08/CH1201-最大子序和-单调队列/"},{"title":"Codeforces 1119E Pavel and Triangles (贪心)","url":"/2019/09/27/Codeforces-1119E-Pavel-and-Triangles-贪心/"},{"title":"Codeforces 1195E OpenStreetMap (单调队列)","url":"/2019/10/06/Codeforces-1195E-OpenStreetMap-单调队列/"},{"title":"Codeforces 166B - Polygon (判断凸包位置关系)","url":"/2019/08/27/Codeforces-166B-Polygon-判断凸包位置关系/"},{"title":"Codeforces 340B - Maximal Area Quadrilateral (计算几何)","url":"/2019/09/01/Codeforces-340B-Maximal-Area-Quadrilateral-计算几何/"},{"title":"CTFHUB Pwn ret2shellcode Writeup","url":"/2020/11/01/CTFHUB-Pwn-ret2shellcode-Writeup/"},{"title":"Codeforces 388C Fox and Card Game (贪心博弈)","url":"/2019/10/20/Codeforces-388C-Fox-and-Card-Game-贪心博弈/"},{"title":"Codeforces 578B \"Or\" Game (前缀和 + 贪心)","url":"/2019/10/01/Codeforces-578B-Or-Game-前缀和-贪心/"},{"title":"Codeforces 743C - Vladik and fractions (构造)","url":"/2019/09/03/Codeforces-743C-Vladik-and-fractions-构造/"},{"title":"Codeforces Round #572 (Div. 2)","url":"/2019/08/31/Codeforces-Round-572-Div-2/"},{"title":"Codeforces Round #589 (Div. 2)","url":"/2019/10/09/Codeforces-Round-589-Div-2/"},{"title":"Codeforces Round #596 (Div. 2, based on Technocup 2020 Elimination Round 2)","url":"/2019/11/02/Codeforces-Round-596-Div-2-based-on-Technocup-2020-Elimination-Round-2/"},{"title":"EOJ 1058. 挤模具 (多边形面积)","url":"/2019/10/16/EOJ-1058-挤模具-多边形面积/"},{"title":"EOJ 1127. 多边形面积（计算几何）","url":"/2019/10/16/EOJ-1127-多边形面积（计算几何）/"},{"title":"Educational Codeforces Round 73 (Rated for Div. 2)","url":"/2019/09/26/Educational-Codeforces-Round-73-Rated-for-Div-2/"},{"title":"Google Kick Start Round A 2020","url":"/2020/03/24/Google-Kick-Start-Round-A-2020/"},{"title":"HDU 1028 Ignatius and the Princess III (动态规划)","url":"/2019/11/04/HDU-1028-Ignatius-and-the-Princess-III-动态规划/"},{"title":"HDU 1028 Ignatius and the Princess III (生成函数/母函数)","url":"/2019/11/10/HDU-1028-Ignatius-and-the-Princess-III-生成函数-母函数/"},{"title":"HDU 1205 吃糖果 (鸽巢原理)","url":"/2019/11/05/HDU-1205-吃糖果-鸽巢原理/"},{"title":"HDU 1269 迷宫城堡 (Kosaraju)","url":"/2019/11/21/HDU-1269-迷宫城堡-Kosaraju/"},{"title":"HDU 1392 Surround the Trees (凸包周长)","url":"/2019/08/16/HDU-1392-Surround-the-Trees-凸包周长/"},{"title":"HDU 1575 Tr A (矩阵快速幂)","url":"/2019/08/27/HDU-1575-Tr-A-矩阵快速幂/"},{"title":"HDU 1548 A strange lift (BFS)","url":"/2019/08/06/HDU-1548-A-strange-lift-BFS/"},{"title":"HDU 1686 Oulipo (KMP)","url":"/2019/10/30/HDU-1686-Oulipo-KMP/"},{"title":"HDU 1700 Points on Cycle (坐标旋转)","url":"/2019/09/28/HDU-1700-Points-on-Cycle-坐标旋转/"},{"title":"HDU 1711 Number Sequence (KMP)","url":"/2019/10/29/HDU-1711-Number-Sequence-KMP/"},{"title":"HDU 1724 Ellipse (自适应辛普森积分)","url":"/2019/10/23/HDU-1724-Ellipse-自适应辛普森积分/"},{"title":"HDU 1847 Good Luck in CET-4 Everybody!  (巴什博弈)","url":"/2019/10/07/HDU-1847-Good-Luck-in-CET-4-Everybody-巴什博弈/"},{"title":"Codeforces 993E Nikita and Order Statistics (FFT)","url":"/2019/09/22/Codeforces-993E-Nikita-and-Order-Statistics-FFT/"},{"title":"HDU 1875 畅通工程再续 (Prim)","url":"/2019/10/18/HDU-1875-畅通工程再续-Prim/"},{"title":"HDU 1879 继续畅通工程 (最小生成树)","url":"/2019/09/20/HDU-1879-继续畅通工程-最小生成树/"},{"title":"HDU 2063 过山车 (匈牙利算法)","url":"/2019/11/18/HDU-2063-过山车-匈牙利算法/"},{"title":"HDU 2087 剪花布条 (KMP)","url":"/2019/11/01/HDU-2087-剪花布条-KMP/"},{"title":"HDU 2512 一卡通大冒险 (第二类斯特林数)","url":"/2019/11/17/HDU-2512-一卡通大冒险-第二类斯特林数/"},{"title":"HDU 2266 How Many Equations Can You Find (DFS)","url":"/2019/08/06/HDU-2266-How-Many-Equations-Can-You-Find-DFS/"},{"title":"HDU 2553 N皇后问题 (DFS)","url":"/2019/08/14/HDU-2553-N皇后问题-DFS/"},{"title":"HDU 2899 Strange fuction (模拟退火)","url":"/2019/10/31/HDU-2899-Strange-fuction-模拟退火/"},{"title":"HDU 3746 Cyclic Nacklace (KMP找循环节)","url":"/2019/11/03/HDU-3746-Cyclic-Nacklace-KMP找循环节/"},{"title":"HDU 3949 XOR (线性基)","url":"/2019/08/28/HDU-3949-XOR-线性基/"},{"title":"HDU 4513 吉哥系列故事——完美队形II (Manacher)","url":"/2019/11/15/HDU-4513-吉哥系列故事——完美队形II-Manacher/"},{"title":"HDU 5119 Happy Matt Friends (背包DP + 滚动数组)","url":"/2019/09/13/HDU-5119-Happy-Matt-Friends-背包DP-滚动数组/"},{"title":"HDU 5183 Negative and Positive (NP)  (手写哈希)","url":"/2019/11/08/HDU-5183-Negative-and-Positive-NP-手写哈希/"},{"title":"HDU 5443 The Water Problem (ST算法)","url":"/2019/09/04/HDU-5443-The-Water-Problem-ST算法/"},{"title":"HDU 5251 矩形面积 (旋转卡壳)","url":"/2019/08/30/HDU-5251-矩形面积-旋转卡壳/"},{"title":"HDU 6590 Code (判断凸包相交)","url":"/2019/08/21/HDU-6590-Code-判断凸包相交/"},{"title":"HDU 6627 equation (分类讨论)","url":"/2019/08/15/HDU-6627-equation-分类讨论/"},{"title":"HDU 6628 permutation 1 (暴力)","url":"/2019/08/14/HDU-6628-permutation-1-暴力/"},{"title":"HDU 6651 Final Exam (思维)","url":"/2019/08/12/HDU-6651-Final-Exam-思维/"},{"title":"HDU 6656 Kejin Player (期望DP 逆元)","url":"/2019/08/13/HDU-6656-Kejin-Player-期望DP-逆元/"},{"title":"HDU 6659 Acesrc and Good Numbers (数学 思维)","url":"/2019/08/19/HDU-6659-Acesrc-and-Good-Numbers-数学-思维/"},{"title":"HDU 6665 Calabash and Landlord (分类讨论)","url":"/2019/08/14/HDU-6665-Calabash-and-Landlord-分类讨论/"},{"title":"HDU 6667 Roundgod and Milk Tea (思维)","url":"/2019/08/14/HDU-6667-Roundgod-and-Milk-Tea-思维/"},{"title":"HDU 6693 Valentine's Day (概率)","url":"/2019/08/22/HDU-6693-Valentine-s-Day-概率/"},{"title":"HDU 6685 Rikka with Coin (枚举 思维)","url":"/2019/08/20/HDU-6685-Rikka-with-Coin-枚举-思维/"},{"title":"HDU 6695 Welcome Party (贪心)","url":"/2019/08/23/HDU-6695-Welcome-Party-贪心/"},{"title":"HDU 6697 Closest Pair of Segments (计算几何 暴力)","url":"/2019/08/24/HDU-6697-Closest-Pair-of-Segments-计算几何-暴力/"},{"title":"ICPC Asia Nanning 2017 F. The Chosen One (高精度运算)","url":"/2019/08/15/ICPC-Asia-Nanning-2017-F-The-Chosen-One-高精度运算/"},{"title":"ICPC Asia Nanning 2017 I. Rake It In (DFS+贪心 或 对抗搜索+Alpha-Beta剪枝)","url":"/2019/08/15/ICPC-Asia-Nanning-2017-I-Rake-It-In-DFS-贪心-对抗搜索-alpha-beta剪枝/"},{"title":"ICPC Asia Nanning 2017 L. Twice Equation (规律 高精度运算)","url":"/2019/08/15/ICPC-Asia-Nanning-2017-L-Twice-Equation-规律-高精度运算/"},{"title":"LOJ #103. 子串查找 (Hash)","url":"/2019/10/10/LOJ-103-子串查找-Hash/"},{"title":"LOJ #113. 最大异或和 (线性基)","url":"/2019/08/28/LOJ-113-最大异或和-线性基/"},{"title":"LightOJ 1027 A Dangerous Maze (期望)","url":"/2019/10/13/LightOJ-1027-A-Dangerous-Maze-期望/"},{"title":"LightOJ 1030 Discovering Gold (概率/期望DP)","url":"/2019/10/13/LightOJ-1030-Discovering-Gold-概率-期望DP/"},{"title":"LightOJ 1203 Guarding Bananas (凸包最小顶角)","url":"/2019/08/16/LightOJ-1203-Guarding-Bananas-凸包最小顶角/"},{"title":"LightOJ 1248 Dice (III) (期望DP / 几何分布)","url":"/2019/10/21/LightOJ-1248-Dice-III-期望DP-几何分布/"},{"title":"LightOJ 1418 Trees on My Island (Pick定理)","url":"/2019/11/12/LightOJ-1418-Trees-on-My-Island-Pick定理/"},{"title":"P2216 [HAOI2007]理想的正方形 (单调队列)","url":"/2019/09/09/P2216-HAOI2007-理想的正方形-单调队列/"},{"title":"POJ 1066 Treasure Hunt (线段相交)","url":"/2019/10/17/POJ-1066-Treasure-Hunt-线段相交/"},{"title":"Lilac Pwn stack4-stack_pivoting Writeup","url":"/2020/11/01/Lilac-Pwn-stack4-stack-pivoting-Writeup/"},{"title":"Lilac Pwn stack3-rop Writeup","url":"/2020/11/01/Lilac-Pwn-stack3-rop-Writeup/"},{"title":"POJ 1269 Intersecting Lines (判断直线位置关系)","url":"/2019/08/27/POJ-1269-Intersecting-Lines-判断直线位置关系/"},{"title":"POJ 1113 Wall (凸包)","url":"/2019/08/17/POJ-1113-Wall-凸包/"},{"title":"POJ 1265 Area (Pick定理 & 多边形面积)","url":"/2019/09/05/POJ-1265-Area-Pick定理-多边形面积/"},{"title":"POJ 1279 Art Gallery (半平面交)","url":"/2019/09/11/POJ-1279-Art-Gallery-半平面交/"},{"title":"POJ 1410 Intersection (计算几何)","url":"/2019/11/11/POJ-1410-Intersection-计算几何/"},{"title":"POJ 1474 Video Surveillance (半平面交)","url":"/2019/09/14/POJ-1474-Video-Surveillance-半平面交/"},{"title":"POJ 1679 The Unique MST (次小生成树)","url":"/2019/10/14/POJ-1679-The-Unique-MST-次小生成树/"},{"title":"POJ 1753 Flip Game (DFS)","url":"/2019/08/14/POJ-1753-Flip-Game-DFS/"},{"title":"POJ 1789 Truck History (Kruskal)","url":"/2019/10/15/POJ-1789-Truck-History-Kruskal/"},{"title":"POJ 1797 Heavy Transportation (Dijkstra)","url":"/2019/10/12/POJ-1797-Heavy-Transportation-Dijkstra/"},{"title":"POJ 1797 Heavy Transportation (最大生成树)","url":"/2019/10/12/POJ-1797-Heavy-Transportation-最大生成树/"},{"title":"POJ 1860 Currency Exchange (Bellman-Ford)","url":"/2019/11/09/POJ-1860-Currency-Exchange-Bellman-Ford/"},{"title":"POJ 1873 UVA 811 The Fortified Forest (凸包 + 状态压缩枚举)","url":"/2019/08/18/POJ-1873-UVA-811-The-Fortified-Forest-凸包-状态压缩枚举/"},{"title":"POJ 1995 Raising Modulo Numbers (快速幂)","url":"/2019/08/06/POJ-1995-Raising-Modulo-Numbers-快速幂/"},{"title":"POJ 2251 Dungeon Master (BFS)","url":"/2019/08/14/POJ-2251-Dungeon-Master-BFS/"},{"title":"POJ 2187 Beauty Contest (凸包 旋转卡壳)","url":"/2019/08/20/POJ-2187-Beauty-Contest-凸包-旋转卡壳/"},{"title":"POJ 2001 Shortest Prefixes (Trie)","url":"/2019/10/03/POJ-2001-Shortest-Prefixes-Trie/"},{"title":"POJ 2253 Frogger","url":"/2019/10/11/POJ-2253-Frogger/"},{"title":"POJ 2254 Globetrotter (计算几何 - 球面最短距离)","url":"/2019/10/19/POJ-2254-Globetrotter-计算几何-球面最短距离/"},{"title":"POJ 2287 Tian Ji -- The Horse Racing (贪心)","url":"/2019/11/06/POJ-2287-Tian-Ji-The-Horse-Racing-贪心/"},{"title":"POJ 2318 TOYS (二分 叉积)","url":"/2019/08/25/POJ-2318-TOYS-二分-叉积/"},{"title":"POJ 2387 Til the Cows Come Home (Dijkstra)","url":"/2019/10/11/POJ-2387-Til-the-Cows-Come-Home-Dijkstra/"},{"title":"POJ 2398 Toy Storage (二分 叉积)","url":"/2019/08/25/POJ-2398-Toy-Storage-二分-叉积/"},{"title":"POJ 2823 Sliding Window (单调队列)","url":"/2019/09/07/POJ-2823-Sliding-Window-单调队列/"},{"title":"POJ 3070 Fibonacci  (矩阵快速幂)","url":"/2019/08/27/POJ-3070-Fibonacci-矩阵快速幂/"},{"title":"POJ 2451 Uyuw's Concert (半平面交)","url":"/2019/09/11/POJ-2451-Uyuw-s-Concert-半平面交/"},{"title":"POJ 3130 How I Mathematician Wonder What You Are! (半平面交)","url":"/2019/09/11/POJ-3130-How-I-Mathematician-Wonder-What-You-Are-半平面交/"},{"title":"POJ 3090 Visible Lattice Points (欧拉函数)","url":"/2019/09/19/POJ-3090-Visible-Lattice-Points-欧拉函数/"},{"title":"POJ 3264 Balanced Lineup (ST算法)","url":"/2019/09/04/POJ-3264-Balanced-Lineup-ST算法/"},{"title":"POJ 3268 Silver Cow Party (Dijkstra)","url":"/2019/10/13/POJ-3268-Silver-Cow-Party-Dijkstra/"},{"title":"POJ 3304 Segments (判断直线与线段相交)","url":"/2019/08/26/POJ-3304-Segments-判断直线与线段相交/"},{"title":"POJ 3348 Cows (凸包面积)","url":"/2019/08/17/POJ-3348-Cows-凸包面积/"},{"title":"POJ 3468 A Simple Problem with Integers (分块)","url":"/2019/08/12/POJ-3468-A-Simple-Problem-with-Integers-分块/"},{"title":"POJ 3641 Pseudoprime numbers (数论+快速幂)","url":"/2019/08/06/POJ-3641-Pseudoprime-numbers-数论-快速幂/"},{"title":"POJ 3805 Separate Points (判断凸包相交)","url":"/2019/08/21/POJ-3805-Separate-Points-判断凸包相交/"},{"title":"PTA 1067 Sort with Swap(0, i) (贪心)","url":"/2019/11/16/PTA-1067-Sort-with-Swap-0-i-贪心/"},{"title":"POJ 3974 Palindrome (Manacher)","url":"/2019/11/14/POJ-3974-Palindrome-Manacher/"},{"title":"PTA 1121 Damn Single","url":"/2019/11/22/PTA-1121-Damn-Single/"},{"title":"PTA 1154 Vertex Coloring","url":"/2019/11/20/PTA-1154-Vertex-Coloring/"},{"title":"PTA 1155 Heap Paths (DFS)","url":"/2019/11/19/PTA-1155-Heap-Paths-DFS/"},{"title":"SPOJ MAXMATCH - Maximum Self-Matching (FFT)","url":"/2019/09/24/SPOJ-MAXMATCH-Maximum-Self-Matching-FFT/"},{"title":"SPOJ VFMUL - Very Fast Multiplication (FFT)","url":"/2019/09/18/SPOJ-VFMUL-Very-Fast-Multiplication-FFT/"},{"title":"UVA 11178 Morley's Theorem (坐标旋转)","url":"/2019/09/29/UVA-11178-Morley-s-Theorem-坐标旋转/"},{"title":"UVA 10256 The Great Divide (判断凸包相交)","url":"/2019/08/21/UVA-10256-The-Great-Divide-判断凸包相交/"},{"title":"Visual Studio Code 修改字体","url":"/2019/10/12/Visual-Studio-Code-修改字体/"},{"title":"华东交通大学2018年ACM“双基”程序设计竞赛 C. 公式题 (2) (矩阵快速幂)","url":"/2019/08/27/华东交通大学2018年ACM“双基”程序设计竞赛-C-公式题-2-矩阵快速幂/"},{"title":"函数调用过程与栈帧结构","url":"/2020/10/29/函数调用过程与栈帧结构/"},{"title":"大数运算之 Java BigInteger 的基本用法","url":"/2019/08/15/大数运算之-Java-BigInteger-的基本用法/"},{"title":"最长回文子串 —— Manacher (马拉车) 算法","url":"/2019/11/13/最长回文子串-——-Manacher-马拉车-算法/"},{"title":"快速幂取模算法","url":"/2019/08/05/快速幂取模算法/"},{"title":"洛谷 P1613 跑路 (倍增 + DP + 最短路)","url":"/2019/09/12/洛谷-P1613-跑路-倍增-DP-最短路/"},{"title":"洛谷 P1742 最小圆覆盖 (随机增量)","url":"/2019/10/04/洛谷-P1742-最小圆覆盖-随机增量/"},{"title":"洛谷 P1919 【模板】A*B Problem升级版（FFT快速傅里叶）","url":"/2019/09/16/洛谷-P1919-【模板】A-B-Problem升级版（FFT快速傅里叶）/"},{"title":"洛谷 P3187 BZOJ 1185 [HNOI2007]最小矩形覆盖 (旋转卡壳)","url":"/2019/08/30/洛谷-P3187-BZOJ-1185-HNOI2007-最小矩形覆盖-旋转卡壳/"},{"title":"洛谷 P2756 飞行员配对方案问题 (二分图匹配)","url":"/2019/09/21/洛谷-P2756-飞行员配对方案问题-二分图匹配/"},{"title":"洛谷 P3369 【模板】普通平衡树 (Treap)","url":"/2019/09/25/洛谷-P3369-【模板】普通平衡树-Treap/"},{"title":"洛谷 P3455 [POI2007]ZAP-Queries (莫比乌斯函数)","url":"/2019/10/08/洛谷-P3455-POI2007-ZAP-Queries-莫比乌斯函数/"},{"title":"洛谷 P3803 【模板】多项式乘法（FFT）","url":"/2019/09/17/洛谷-P3803-【模板】多项式乘法（FFT）/"},{"title":"洛谷 P4173 残缺的字符串 (FFT)","url":"/2019/09/23/洛谷-P4173-残缺的字符串-FFT/"},{"title":"牛客 14505 轰炸区最优选取 (二维前缀和)","url":"/2019/08/15/牛客-14505-轰炸区最优选取-二维前缀和/"},{"title":"洛谷 P4196 [CQOI2006]凸多边形 (半平面交)","url":"/2019/09/10/洛谷-P4196-CQOI2006-凸多边形-半平面交/"},{"title":"牛客 Fruit Ninja 2018 ACM 上海大都会赛 (随机化算法)","url":"/2019/09/30/牛客-Fruit-Ninja-2018-上海大都会赛-随机化算法/"},{"title":"计算几何模板整理","url":"/2019/09/06/计算几何模板整理/"},{"title":"线性回归及Python实现","url":"/2020/06/21/线性回归及Python实现/"},{"title":"设置 Quartus II 的仿真时间大于 1us","url":"/2019/10/22/设置-Quartus-II-的仿真时间大于-1us/"}]