From b22169d66e6cacb4fadafd76843de7fc393ea911 Mon Sep 17 00:00:00 2001
From: 1AoB <2453468739@qq.com>
Date: Sat, 27 Apr 2024 01:54:48 +0800
Subject: [PATCH] c++

---
 .../content/post/给个offer/index.zh-cn.md     | 182 ++++++++++++------
 .../post/给个offer/图片/1714141505536.png     | Bin 0 -> 4995 bytes
 2 files changed, 127 insertions(+), 55 deletions(-)
 create mode 100644 exampleSite/content/post/给个offer/图片/1714141505536.png

diff --git a/exampleSite/content/post/给个offer/index.zh-cn.md b/exampleSite/content/post/给个offer/index.zh-cn.md
index 1af3854..b672968 100644
--- a/exampleSite/content/post/给个offer/index.zh-cn.md
+++ b/exampleSite/content/post/给个offer/index.zh-cn.md
@@ -17,6 +17,8 @@ This article offers a sample of basic Markdown.
 
 # 正文开始
 
+如果考到数论的题,会做你就做,不会做你就说你对数论这块不太熟悉,数论这个面算法工程师考的比较多,做开发的话链表比较多
+
 ## 1.41. 包含min函数的栈
 
 ```cpp
@@ -799,24 +801,146 @@ public:
 
 
 
-## 28.67.数字在排序数组中出现的次数
+## 
 
 ## 29.37. 树的子结构
 
+```cpp
+以根为开始,开始进行p1与p2的匹配:
+需要另写一个函数进行匹配,函数的参数是以p1,p2为根节点的一段小树
+函数内部实现:
+1.p2为空.说明之前的匹配好了,直接return true;
+2.p1为空 或者 p1和p2的值不匹配,直接return false;
+3.没有被条件1和2直接return,说明当前的节点是匹配的,我们接着
+匹配左左和右右,是且的关系
+class Solution {
+public:
+    bool dfs(TreeNode* p1, TreeNode* p2)
+    {
+        if(!p2)return true;
+        if(!p1 || p1->val != p2->val)return false;
+        //此时,当前节点是匹配的
+        return dfs(p1->left,p2->left) && dfs(p1->right,p2->right);//左边匹配且右边匹配
+    }
+    bool hasSubtree(TreeNode* pRoot1, TreeNode* pRoot2) {
+        if(!pRoot1 || !pRoot2)return false;
+        if(dfs(pRoot1,pRoot2))return true;//遍历当前节点
+        return hasSubtree(pRoot1->left,pRoot2) || hasSubtree(pRoot1->right,pRoot2);//下一个节点
+    }
+};
+```
+
+
+
 ## 30.46. 二叉搜索树的后序遍历序列
 
+```cpp
+//和那个重建二叉树思路有一点点类似
+//画图确定范围
+class Solution {
+public:
+//1.搞一个全局变量
+    vector<int> seq;
+
+    bool verifySequenceOfBST(vector<int> sequence) {
+        seq = sequence;
+        return dfs(0, seq.size() - 1);//dfs的是范围
+    }
+    
+    //dfs的是范围
+    bool dfs(int l, int r) {
+        if (l >= r) return true; // 1.如果子序列为空或只有一个节点，它必然是BST的后序遍历结果
+        int root = seq[r]; // 2.根节点 子序列的最后一个节点是当前子树的根节点
+        int k = l;//左右子树的分界线(找到右子树的第一个元素)
+        while (k < r && seq[k] < root) k++; // 找到左子树和右子树的分界点
+        for (int i = k; i < r; i++)//遍历右子树,如果右子树中,有元素小于根节点就不满足二叉搜索树
+            if (seq[i] < root)
+                return false; // 如果在右子树中找到比根节点小的值，则不是合法的BST后序遍历
+        return dfs(l, k - 1) && dfs(k, r - 1); // 递归检查左子树和右子树
+    }
+};
+
+```
+
+![1714141505536](图片/1714141505536.png)
+
 ## 31.26. 二进制中1的个数
 
+```cpp
+//记住就好, x与-x的与
+int lowbit(int x){
+    return x&(-x);
+}//可以得到最后一个1
+```
+
+
+
 ## 32. 49. 二叉搜索树与双向链表
-## 33.62. 丑数
+
+
+
+
+
 ## 34.32. 调整数组顺序使奇数位于偶数前面
+
+```cpp
+维护两个指针,一个从头一个从尾
+使得:前指针前面都是奇数,后指针都是偶数
+
+前指针遇到偶数就停下来,遇到奇数就前进
+后指针遇到奇数就停下来,遇到偶数就前进
+
+如何前指针的下标和后指针的下标不同,就交换两个数
+while(i < j)
+{
+    while()
+    while()
+}
+class Solution {
+public:
+    void reOrderArray(vector<int> &array) {
+         int i = 0 ,j =array.size()-1;
+         while(i < j)
+         {
+             while(i<j && array[i] % 2 == 1)i++;
+             while(i<j && array[j] % 2 == 0)j--;
+             if(i<j)swap(array[i],array[j]);
+         }
+    }
+};
+```
+
+
+
 ## 35.60. 礼物的最大价值
 
+
+
 ## 36.63. 字符串中第一个只出现一次的字符
 
+
+
 ## 37.85. 不用加减乘除做加法
+
+
+
 ## 38.47. 二叉树中和为某一值的路径
 ## 39.82. 圆圈中最后剩下的数字
+
+```cpp
+编号: 旧 = (新+m)%n
+f(n,m) = (f(n-1,m)+m)%n;
+class Solution {
+public:
+    int lastRemaining(int n, int m){
+        if(n == 1)return 0;
+        return (lastRemaining(n-1,m)+m)%n;
+    }
+};
+```
+
+
+
 ## 40.39. 对称的二叉树
 ## 41.58. 把数组排成最小的数
 ## 42.38. 二叉树的镜像
@@ -839,60 +963,8 @@ public:
 ## 51. 数字排列
 ------
 
-|      | #    | 标题                                                         | 来源            | 显示算法 | 通过率 | 难度     |
-| :--- | :--- | :----------------------------------------------------------- | :-------------- | :------- | :----- | :------- |
-|      | 51   | [数字排列](https://www.acwing.com/problem/content/47/)       | 剑指Offer       |          | 59.28% | **中等** |
-|      | 80   | [骰子的点数](https://www.acwing.com/problem/content/76/)     | 剑指Offer       |          | 58.04% | **简单** |
-|      | 69   | [数组中数值和下标相等的元素](https://www.acwing.com/problem/content/65/) | 剑指Offer       |          | 61.16% | **简单** |
-|      | 83   | [股票的最大利润](https://www.acwing.com/problem/content/79/) | 剑指Offer       |          | 53.68% | **简单** |
-|      | 40   | [顺时针打印矩阵](https://www.acwing.com/problem/content/39/) | 剑指Offer       |          | 44.71% | **中等** |
-|      | 88   | [树中两个结点的最低公共祖先](https://www.acwing.com/problem/content/84/) | 剑指Offer       |          | 70.16% | **中等** |
-|      | 20   | [用两个栈实现队列](https://www.acwing.com/problem/content/36/) | 剑指Offer       |          | 62.31% | **简单** |
-|      | 25   | [剪绳子](https://www.acwing.com/problem/content/24/)         | 剑指Offer       |          | 47.73% | **简单** |
-|      | 73   | [数组中只出现一次的两个数字](https://www.acwing.com/problem/content/69/) | 剑指Offer       |          | 70.44% | **中等** |
-|      | 24   | [机器人的运动范围](https://www.acwing.com/problem/content/22/) | 剑指Offer       |          | 36.96% | **简单** |
-|      | 61   | [最长不含重复字符的子字符串](https://www.acwing.com/problem/content/57/) | 剑指Offer       |          | 44.64% | **简单** |
-|      | 17   | [从尾到头打印链表](https://www.acwing.com/problem/content/18/) | 剑指Offer       |          | 67.50% | **简单** |
-|      | 44   | [分行从上往下打印二叉树](https://www.acwing.com/problem/content/42/) | 剑指Offer       |          | 70.24% | **中等** |
-|      | 43   | [不分行从上往下打印二叉树](https://www.acwing.com/problem/content/41/) | 剑指Offer       |          | 66.09% | **简单** |
-|      | 45   | [之字形打印二叉树](https://www.acwing.com/problem/content/43/) | 剑指Offer       |          | 58.99% | **中等** |
-|      | 81   | [扑克牌的顺子](https://www.acwing.com/problem/content/77/)   | 剑指Offer       |          | 35.89% | **简单** |
-|      | 38   | [二叉树的镜像](https://www.acwing.com/problem/content/37/)   | 剑指Offer       |          | 75.86% | **简单** |
-|      | 63   | [字符串中第一个只出现一次的字符](https://www.acwing.com/problem/content/59/) | 剑指Offer       |          | 50.63% | **简单** |
-|      |      |                                                              |                 |          |        |          |
-|      |      |                                                              |                 |          |        |          |
-|      | 49   | [二叉搜索树与双向链表](https://www.acwing.com/problem/content/87/) | 剑指Offer       |          | 64.51% | **中等** |
-|      |      |                                                              |                 |          |        |          |
-|      | 60   | [礼物的最大价值](https://www.acwing.com/problem/content/56/) | 剑指Offer       |          | 65.53% | **中等** |
-|      |      |                                                              |                 |          |        |          |
-|      | 22   | [旋转数组的最小数字](https://www.acwing.com/problem/content/20/) | 剑指Offer       |          | 42.79% | **中等** |
-|      | 76   | [和为S的连续正数序列](https://www.acwing.com/problem/content/72/) | 剑指Offer       |          | 72.69% | 中等     |
-|      |      |                                                              |                 |          |        |          |
 
 
-
-
-
-26号任务：
-
-|      | 39   | [对称的二叉树](https://www.acwing.com/problem/content/38/)   | 剑指Offer       |          | 57.04% | **简单** |
-|      | 82   | [圆圈中最后剩下的数字](https://www.acwing.com/problem/content/78/) | 剑指Offer       |          | 71.01% | **简单** |
-|      | 52   | [数组中出现次数超过一半的数字](https://www.acwing.com/problem/content/48/) | 剑指Offer       |          | 70.20% | **中等** |
-|      | 32   | [调整数组顺序使奇数位于偶数前面](https://www.acwing.com/problem/content/30/) | 剑指Offer       |          | 65.33% | **简单** |
-|      | 47   | [二叉树中和为某一值的路径](https://www.acwing.com/problem/content/45/) | 剑指Offer       |          | 58.08% | **中等** |
-|      | 26   | [二进制中1的个数](https://www.acwing.com/problem/content/25/) | 剑指Offer       |          | 62.66% | **简单** |
-|      | 56   | [从1到n整数中1出现的次数](https://www.acwing.com/problem/content/51/) | 剑指Offer       |          | 44.62% | **困难** |
-|      | 58   | [把数组排成最小的数](https://www.acwing.com/problem/content/54/) | 剑指Offer       |          | 60.41% | **中等** |
-|      | 62   | [丑数](https://www.acwing.com/problem/content/58/)           | 剑指Offer       |          | 61.20% | **中等** |
-|      | 27   | [数值的整数次方](https://www.acwing.com/problem/content/26/) | 剑指Offer       |          | 33.62% | **中等** |
-|      | 29   | [删除链表中重复的节点](https://www.acwing.com/problem/content/27/) | 剑指Offer语法题 |          | 48.48% | **中等** |
-|      | 16   | [替换空格](https://www.acwing.com/problem/content/17/)       | 剑指Offer语法题 |          | 61.84% | **简单** |
-|      | 37   | [树的子结构](https://www.acwing.com/problem/content/35/)     | 剑指Offer       |          | 49.06% | **简单** |
-|      | 46   | [二叉搜索树的后序遍历序列](https://www.acwing.com/problem/content/44/) | 剑指Offer       |          | 46.18% | **简单** |
-|      | 68   | [0到n-1中缺失的数字](https://www.acwing.com/problem/content/64/) | 剑指Offer       |          | 41.01% | **简单** |
-|      | 86   | [构建乘积数组](https://www.acwing.com/problem/content/82/)   | 剑指Offer       |          | 64.71% | **中等** |
-|      | 57   | [数字序列中某一位的数字](https://www.acwing.com/problem/content/52/) | 剑指Offer       |          | 34.88% | **简单** |
-|      | 48   | [复杂链表的复刻](https://www.acwing.com/problem/content/89/) | 剑指Offer       |          | 61.44% | **中等** |
-|      | 70   | [二叉搜索树的第k个结点](https://www.acwing.com/problem/content/66/) | 剑指Offer       |          | 67.42% | **简单** |
+ 
 
 
diff --git a/exampleSite/content/post/给个offer/图片/1714141505536.png b/exampleSite/content/post/给个offer/图片/1714141505536.png
new file mode 100644
index 0000000000000000000000000000000000000000..08ccb5f6700217f9b3b6a45ec5e6b78286d0d5f1
GIT binary patch
literal 4995
zcmds5c|4Ts+rMW_7)vtNM1>)zrVvF4WrQ@0mXoQ}wAhN%Az8{YX&afy(jb+gvb7N>
zqM~D%G-{NT8cSh}eHvs-y!Yc&XZf7>{r&O&^}c`2eD3FZuIsw5>w7KVCx-0eATOgK
z0|1bBawKjBKw={RsLRrl@I<IX9tA*YqZ4u6*3ioXEo(PxQdDU#)0K9}JSF?gsg_}B
zQ3ClAN|#69C%=s|dXf}-`sBemuVs|g$;WGr$(il>GL5d&!ZnIY%Tb$!#7%<ElraG}
zi@;q8m4}Ke?km7w)}d240Bm)V;eT8v27n9FdH~Rf1}FgV>#+bVR)ijb7&00F$N!U}
zJ|1q${)^BLkt_OmP?&DYr>R*c$W^Y8nF42{b^QPNTC^vHjpko)FbZ<dbS^x*=QrWl
zT@>QK2u5Y=4Fj1IM7>Q=vpOb$coF&2y^5#fCYAYmUWhpW`9h7@GWTOr-@<yVHqo*d
zj|eU24(7(fn6g5w(upmI1CMkPeWH;QGa`<J#C#;$G0O>Nfc8Sk$&_TUs#0nJ0Fwd_
zKGX*K2(1@8vrR}QZux1xI8Yh6%lW0`-_keIyzi@ZWqs(W6RWX*$!Ok&nrcv9bbTHT
zIkw0nI2U4UAqH%D@@ovvOtr~}re9oBOfqO>pGC|$8=&N9wX$F<{PQU*wonhf_wuc}
zO#k&*8ol6vI$&aNXp}aA_XWJp>M&WbTWKTEU6KesgsjI>*+d+;rJuaCD@($sA)6~Y
zm-XvoG|lYcp)W8IOj|U~29YjIHC?6R)Th5wN1kRq4<6KyDChMUNYL`JH)JR;&_QlW
z!fdOxfh#a9(J5SIC1G`t`?R;xj0;f5mAB5KG*5@wg7WBihymqLqr`sQIiM+nj8>nw
z1rKu1kn?G>N-SB`r0YjThG?*QNivXxMX=q>|6JBQ5-8B+pOlcR(_u18q<L);pw%m@
zcnNoqc4y~R)3lYSN-vny4LXM0BS})=jfopt{ig;!;LaoZDhxhFM|hTDz+vR{!NZRd
zw*2OYnX)jMhK2Z4@F9(iUaS*25VwR0Yz<Hs=z0KN@7CU*7J~iy$zc5Xkn=$ll>x;M
z#pr>WjsIS8n`Qk<WC3V_Z~R+<=Ivb_2%2_Nm=NJWS2uaIm^7|zujomcv<ZhWGtVqO
z>mSX*`}$=E1P3WQICvXhDTyEe;OA^GkVoL2*L{ljJ>XT8`dp`-H6XE<p{nFp)Ag2g
z$=S>ojOrvWEuh~hnXY<Tx2VH`$nLb$yfZazn%&@A8i!iC>e2bWcLXo7_VkW`Brod>
zPWWJ*L_rL!j7oCp5lgS(RF{n1Q9WXPFGWT1Jl6)_hm(UH{^1WwBd4c34_UQjEU-ZB
zOcM@2bB*6~M^|Uxka48VSaW1dQlHSIp|fvGbB5(GczDCW<D;FRE5#uo)cA<;`a`|$
z$Gq3<NvYd!9dB;#Ze6jd<Cb|$pZR%_V4G%1upg+RW??R-b6TDgbo9kxjqlZHkF?n9
zEFRSvR<Mr}**!}VFk}?ZU|nNZh`8A)W4pC3AQ_P~()XD8Jf7A~0{M%RS^I{|g~BBL
zjG3W+#gmH@%MM3QgzT!*X&-4Tc(2CNV79Ki5!urCRo%7X@X)*xv7j?dSBhtdYD}$(
zQsbqYvg0|aE>SZv9DY)1X&k*lBn~>-uRpg^@)T}skMLf3?c2ivpG~57AMXEEg(KL;
zmBOZ*ka{2YysI59a<b7{IJ0p5+4!VVI%Si!<~ck~o^nh|<<fMBlJT1JQKWM;$vVUM
z_D+j^D}BE>f-?>V>$YWk2L!H-jn9}V>`*>Qz4SVup=kWL@$Ko+RmC{l-=Nif3sXuI
zb8_}{ENZ|@+TxEkj}YP>PtoJs*7ix0)iN<Ese7i?6coihz0H$R$6WD8TdcChKRu2p
zkH5L!TT_yHY`%lNqJwusD#T6!+iPyY-5$@W5GC<Pexs`MV3%=*!>wb!_+lsg=O^nl
z@5*04Tbl0D5i!}@Vb{XJ95)Z2=Ja#+6Ez*!rYm^AbZA?%b6mMIhawq#L$!dl>Fl1d
z!@nq#Ei*C4(>SKBoSehL0L@_){s}`5mQ{0g&}8`U6<-5!Z;R-3r|^ifu~wzv&C2$~
ztz&_d1XIkS_PZC$TU%<L<J<SIFzC)b+t*hb*DxM*bh=l+bHItn=8WSLeQ4z9M})R_
zYv~;-9hn^+9p)9!_AIN?|JZ+%z)f*~pW@j2;N)<rA+K$GbX)V?nblyKv>t8YPIlr`
z)TF1cN)7i_Z2I_@Zhaju@sx~Uk$AjU{#m^ETCLrI5u|qxEO1^g>(e@Pj=?vNq0@Qd
zfoZF``!u|(opy0Jp;6&e$9g>2JbLuxyU%l}Ab-~xsru^^9rur9EfV`2x6*)^HJVqx
ziMc6>7W}+puuI7B306GopdkLr&&g;j8i@<W>d{c*I$Zs-;qp?-ZfCRdxTLDSjEV_$
z@wj@tqWJAZm?nEKdyLLER8Vvs{uC+S>(!%GS?O0M=SoKTr?<6C9qaN5)X2$6O5GG0
zG4u7y+0xR|nDPwKLIyv!^r{D^y0$IAcS36wY@nc+sxh;cIMth_Am%kjG`B^?H&mz0
zwP7E?1spLu-}BDx@-El*k-o9erH@Wtm_%HgY}i_BiuK`74XuuxqK}7KP-g6;qN;_d
z)&1@G$86#FbkL&h!itKm^LrP=_IuES5QAq$G?d0Fh(#4+0iSt7_l%8F0n?)4a9>qX
zhr9O6#c-I}R>gHpO<Bdo&rBr+Ou2?%A+kR^X@(iaNFp}5Tl5<6ESpI7fPkW@62++!
z-VM-DEQ+l%h+DBgKLw^7t&UB=jBp8e3?tdXoG+yoHt{!eL;)5t^mq1`HB|$G^iy+F
z#^8i&&gP$%C~oi3_EI#S7@roZ&F!e_@x8o(opbYMDCJ7XubSJ(T*W;@D;Dauf1L>P
zyBDYsye;_`L$usgIDGv$uPkW^M%&P|=g_YcCL}a%V0PrfN`dpO>2>Cvp2QmwMhmlF
zGfu?dDxbbqG}Xb@RC`}FHge04QIf9Ld*K8Mw3Of|U5qMw5hep#VY_ci7phQqg?G)D
za2A2wQ?g6I88$Iba)m1G&XKEVT1gt5(e~1CPe_URw!!6|Z}|+mmqGES^u=hZ51d?0
z+(7*Dt2_dCNbpuihGxCe4NX1FUC@;5Ie~NFR!GvUjor|!;8=GY35=X3qp9BZZnq+|
ze$TH>#43RZZK$C(-*M@=eF78b*gfe4RJ|G;{kLz&UKfxwhsJbvA0A!I1l=n$F_kr{
zO4p7iBu9OH)293F=x3&`kB9m4sHm1UZ6?bm+-1Hl6x{G;&dZE!hu93t=cz>Z=t2I0
zjdFHyD;mFMv%G}Q9vXJy?oo2CCrxxoGR~9HA4uDXo2QFz()GHTg6EX*)w4==kT5Uv
z$Cjg7E|?uWVGQ@Bsjk~3jo|Y+0vkAQyDgxdjeWcIcQ)F!9G;Wl9z81HeaR<Ls88X%
zjT(8wJ<v8eVPotR9Z9(?75?*l2`Im8P2ecyU`fnTHIEfFthIgFPJNLIh-0BQ&N)6?
z{eX3kWIhthTV@A02=~0+lueI6hur3G<DOPG72Qs8zWaqSd3hyK^xhhPGS7*$O#MdV
zT6Awo__Zn_QyYePvCeMM!4gsRi=ovY%BRE9t!yjCZ>=<i@qC8%oe=R;+@re&ELDam
zp2(toF|6;AWBEL1P;762V(hxYQ`x$ff-d7pD#*b+sTW%4=Jjd~`z@OL^<#Ch+zEJ;
zAc$o?9v};{WP2M+j-X$Y;CppLgTWr7Z-!l>vF{59gm?Rd^F!g@sh+kpq~tjFv2juF
z8Y$;btc4M!VQ3Pvj=d_8)#j}M^{SZ|TfJUJ+BW{FvE`Gjo8ecfzs)Yae!m~U()1y|
z54t%tmG;ToZXrC9V5u^PLA^J;%6ph5>kKz{XndAH&^A7>l&_ozNyS0!RM2e#)!tCG
zYzec*(yWnQ^Cz>oSkyU}_86Y^`-^wI8WL6GKm@Y&G`Ull6)l=4w2>7Y5vLk*x&4F^
z3911SCJKS0xCxA0`A$$Qi^{cto!+-~sj}5iMXs{`JEtN4#3P`LFwoB{O;1rY?Z104
zOM`M5-b|n_^L>|IeLuADmX-*pLqz?P9MK*TuI@zBw7)YXsyDa1?cE%O*^_<}9%Y0i
z_X-vd&cN-iK*cb94pk2N{GaHSU)}u=fPqxwvVB;ZG29ye5~lz3@;^nJcFfYB`mB2d
zzBMNIN1XntXNTv0X;9XU(2Gj*<>=Z$3J6Ldqges=Zqj&Q@%)t~(9lZ+-LO(@_Y+}m
zklwI^!rbZqJ6ZX(Bbv3{>KexOHU>U9kcF}JM?_#2a*;<o1R^WByyY=?FuBP9MaC+@
zn6RPBQT;@qt^td0_x*SJnqYE0jFVXde7NBoe*Pe!{nz1`CTX6_`g98iPC_Qvw3EU#
ze1ZXXaGc~a+|hqv0p|>mN?--Tupvl#y&g8KZ>R*5FbCviknJp*ZO)M4k}bFBfk|ko
zUb+x7AbxieY1<k_bUihH5Cj9oa`U8IT7jw$gIW9;uJ2{g^?Hp$%=1r_S<xK=^jz8s
z2+Lv@XlE6aa)I?41R=^YVdGwNgtGT_p{ve~YP(y1!`P}p6k2e~nZPF<0kJ3L&16Wd
z9(WJ0&}~|XX%vS=!vO+<Uv*Y9V=ciY2>$Ll(BC8onMd02wR2GMb~X->AR_v2z0eX(
zkBC%Yqij7{Lx#G8U;T_neaRc%VCSZ6C|Y+Y*74fX*>2QSogceaEIB|S;*j3KD%q91
z&MdXvh{%Nesi0^Dp=4**{0;dCL2il>1k0t}2!Ra2)3{L4NiGc;E(`kJZ!X_PsJJEr
z`6%^3FcvFv*yjh63O<mo+V5i^ym$8NLFJBYC&tC^r3jX#=^J|?6t<0yuW^AH{dCR|
z4eO{9mw@5HTLDF5hU3uYU9+Y^;vb}Xps&ibwwR8z7+S(1lf?Tm8F$WVR?X6PcD@15
zCI~U0URajxlto9f47R!`zYGb6-l*qU`+WfZ-|G=Tu7-Dag?1T?F~uht-}4R_ba_px
z33Tj_uN%61FJaPuv;uWh1HLKl#~o%rjYz(@XW4WWF+2YwCh7+ltNf6fT4?z9#=xMT
z|EuoV{-%!Q4pNW&u=i)rtCUu@e>tjcdv}%;gWMG8*Kz&-RlWZkOZ<M(KMnu0`u|^j
f@%e8)WKGya3$)I@<qUK}v;rr47vi1u)ad^L>Kby~

literal 0
HcmV?d00001