<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[fo0Old的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/fo0Old</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fo0Old]]></copyright><item><title><![CDATA[小程序前端代码/素材提取]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/125003101</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/125003101</guid><author>fo0Old</author><pubDate>Fri, 27 May 2022 15:42:16 +0800</pubDate><description><![CDATA[小程序前端代码提取
准备

提取Android端小程序(微信、支付宝):
a. 一部已经root的Android手机, 打开开发者模式USB调试
b. 安装adb (官方下载链接: https://developer.android.com/studio/releases/platform-tools)
c. python运行环境 (本人使用WSL)
d. 安装微信或支付宝
提取PC端(微信):
a. python、python3(含pip3)运行环境 (本人使用WSL)
b. 安装PC端微信

微信小程序]]></description><category></category></item><item><title><![CDATA[Messiel Lahmer 质数筛法]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/108760354</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/108760354</guid><author>fo0Old</author><pubDate>Wed, 23 Sep 2020 20:32:10 +0800</pubDate><description><![CDATA[目的: 求111到nnn的质数和
本文设定: n=20n=20n=20


求出⌊ni⌋\lfloor\frac{n}{i}\rfloor⌊in​⌋的所有取值
⌊20i⌋=1,2,3,4,5,6,10,20\lfloor\frac{20}{i}\rfloor={1,2,3,4,5,6,10,20}⌊i20​⌋=1,2,3,4,5,6,10,20


排除数字111, 并假设所有数字都是质数


求出⌊n⌋\lfloor\sqrt{n}\rfloor⌊n​⌋以内的所有质数
444以内的质数有数字222和333]]></description><category></category></item><item><title><![CDATA[2-3树 叶子节点删除]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/105601322</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/105601322</guid><author>fo0Old</author><pubDate>Sat, 18 Apr 2020 21:10:35 +0800</pubDate><description><![CDATA[本文不再阐述关于2-3树的定义、节点的插入以及将删除的非叶子节点转换为叶子节点的方法
注意: 本文仅对2-3树 叶子节点的 删除操作 进行分类与讨论
定义:

2-节点: 如果某个节点包含1个权值, 那么我们称之为2-节点, 如果该节点并非叶子节点, 那么它一定包含2个非空子树
3-节点: 如果某个节点包含2个权值, 那么我们称之为3-节点, 如果该节点并非叶子节点, 那么它一定包含3个非空子树
...]]></description><category></category></item><item><title><![CDATA[高维标记]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/89736925</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/89736925</guid><author>fo0Old</author><pubDate>Wed, 01 May 2019 12:32:09 +0800</pubDate><description><![CDATA[ll md(ll x)
{
    if(0&lt;=x)
    {
        if(x&lt;mod)return x;
        if(x&lt;(mod&lt;&lt;1))return x-mod;
        return x%mod;
    }
    if(x&lt;=-mod)x%=mod;
    return x+mod;
}

struct Matrix
...]]></description><category></category></item><item><title><![CDATA[差分与树状数组]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/88094715</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/88094715</guid><author>fo0Old</author><pubDate>Sun, 03 Mar 2019 21:45:32 +0800</pubDate><description><![CDATA[一维树状数组
长度为nnn的序列: a1,a2,⋯&amp;amp;amp;amp;ThinSpace;,ana_1,a_2,\cdots,a_na1​,a2​,⋯,an​
一阶差分与前缀和
一阶差分数组: di=ai−ai−1(a0=0)d_i=a_i-a_{i-1}\qquad(a_0=0)di​=ai​−ai−1​(a0​=0)
考虑序列aaa第mmm项:
am=∑i=1mdia_m=\sum\limits_{i=...]]></description><category></category></item><item><title><![CDATA[拉格朗日插值]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/83155072</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/83155072</guid><author>fo0Old</author><pubDate>Thu, 18 Oct 2018 23:48:57 +0800</pubDate><description><![CDATA[给出n+1n+1n+1个xxx互不相同点(xi,yi)(x_i,y_i)(xi​,yi​), 可以唯一确定一个nnn次多项式
即: f(x)=∑i=0nai⋅xif(x)=\sum\limits_{i=0}^{n}a_i\cdotp x^if(x)=i=0∑n​ai​⋅xi 的系数a0,a1,a2,⋯&amp;amp;amp;amp;ThinSpace;,ana_0,a_1,a_2,\cdots,a_na0​,a1​,a...]]></description><category></category></item><item><title><![CDATA[差分]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/82497462</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/82497462</guid><author>fo0Old</author><pubDate>Fri, 07 Sep 2018 15:30:47 +0800</pubDate><description><![CDATA[给定一个离散序列: a0,a2,⋯,an,⋯a0,a2,⋯,an,⋯a_0,a_2,\cdots,a_n,\cdots

零阶差分(原序列): Δ0hn=anΔ0hn=an\Delta^0h_n=a_n

一阶差分: Δ1hn=an+1−anΔ1hn=an+1−an\Delta^1 h_n=a_{n+1}-a_n

二阶差分: Δ2hn=Δ1hn+1−Δ1hn=an+2−2⋅an+1+anΔ2hn...]]></description><category></category></item><item><title><![CDATA[杜教筛]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/82152479</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/82152479</guid><author>fo0Old</author><pubDate>Tue, 28 Aug 2018 18:25:34 +0800</pubDate><description><![CDATA[作用: 在低于线性复杂度内解决某一类函数的前缀和

求数论函数f(x)f(x)f(x)的前缀和s(n)s(n)s(n), 即: s(n)=∑i=1nf(i)s(n)=∑i=1nf(i)s(n)=\sum\limits_{i=1}^n f(i)

找到一个数论函数g(x)g(x)g(x), 使得g(x)g(x)g(x)与f(x)f(x)f(x)的狄利克雷卷积(f×g)(n)=∑d|ng(d)⋅f(n...]]></description><category></category></item><item><title><![CDATA[gcd求和的几种方法]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/82020110</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/82020110</guid><author>fo0Old</author><pubDate>Fri, 24 Aug 2018 15:47:41 +0800</pubDate><description><![CDATA[最大公约数: Greatest Common Divisor, 简称: gcd 
定义符号: d|nd|nd|n: n%d=0n%d=0n\%d=0 
定义函数: φ(n)φ(n)\varphi(n): 欧拉函数 
定义函数: μ(n)μ(n)\mu(n): 莫比乌斯函数

一维形式: ∑i=1ngcd(n,i)∑i=1ngcd(n,i)\sum\limits_{i=1}^{n}gcd(n,i)
...]]></description><category></category></item><item><title><![CDATA[整除分块]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/81909652</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/81909652</guid><author>fo0Old</author><pubDate>Tue, 21 Aug 2018 16:17:27 +0800</pubDate><description><![CDATA[⌊ni⌋(0&amp;amp;lt;i≤n)⌊ni⌋(0&amp;amp;lt;i≤n)\lfloor\frac{n}{i}\rfloor\quad(0\lt i\le n)的不同取值不超过: 2n−−√2n2\sqrt n种

令: ⌊ni⌋=x⌊ni⌋=x\lfloor\frac{n}{i}\rfloor=x

那么: x⋅i≤n≤(x+1)⋅i−1x⋅i≤n≤(x+1)⋅i−1x\cdotp i\le n\le (x+1)...]]></description><category></category></item><item><title><![CDATA[狄利克雷卷积 与 莫比乌斯反演]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/81774576</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/81774576</guid><author>fo0Old</author><pubDate>Fri, 17 Aug 2018 11:18:23 +0800</pubDate><description><![CDATA[定义: f(n)f(n)f(n), g(n)g(n)g(n)是两个数论函数(定义域均为正整数)

定义卷积运算”××\times”: (f×g)(n)=∑i⋅j=nf(i)⋅g(j)=∑n%d=0f(d)⋅g(nd)(f×g)(n)=∑i⋅j=nf(i)⋅g(j)=∑n%d=0f(d)⋅g(nd)(f\times g)(n)=\sum\limits_{i\cdotp j=n}f(i)\cdotp ...]]></description><category></category></item><item><title><![CDATA[反演原理]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/81714033</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/81714033</guid><author>fo0Old</author><pubDate>Thu, 16 Aug 2018 00:54:07 +0800</pubDate><description><![CDATA[已知: f(n)=∑i=0nani⋅g(i)f(n)=∑i=0nani⋅g(i)f(n)=\sum\limits_{i=0}^na_{ni}\cdot g(i)

即: ⎧⎩⎨⎪⎪⎪⎪⎪⎪f(0)=a00⋅g(0)f(1)=a10⋅g(0)+a11⋅g(1)⋯f(n)=an0⋅g(0)+an1⋅g(1)+⋯+ann⋅g(n){f(0)=a00⋅g(0)f(1)=a10⋅g(0)+a11⋅g(1)⋯...]]></description><category></category></item><item><title><![CDATA[二项式反演]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/81677115</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/81677115</guid><author>fo0Old</author><pubDate>Wed, 15 Aug 2018 00:51:28 +0800</pubDate><description><![CDATA[已知f(n)=∑i=0nCin⋅g(i)f(n)=∑i=0nCni⋅g(i)f(n)=\sum\limits_{i=0}^n C_n^i\cdotp g(i), 求g(n)g(n)g(n)

二项式定理:

(a+b)n=∑i=0nCin⋅ai⋅bn−i(a+b)n=∑i=0nCni⋅ai⋅bn−i(a+b)^n=\sum\limits_{i=0}^nC_{n}^i \cdotp a^i\cdot...]]></description><category></category></item><item><title><![CDATA[辛普森公式]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/81449268</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/81449268</guid><author>fo0Old</author><pubDate>Mon, 06 Aug 2018 09:54:26 +0800</pubDate><description><![CDATA[已知一个初等函数f(x)f(x)f(x), 求解∫baf(x)∫abf(x)\int_a^bf(x) 
先将f(x)f(x)f(x)近似为某二次函数g(x)=A⋅x2+B⋅x+Cg(x)=A⋅x2+B⋅x+Cg(x)=A\cdotp x^2+B\cdotp x+C 
那么: 
∫bag(x)=(A3⋅x3+B2⋅x2+C⋅x+D)∣∣ba=A3⋅(b3−a3)+B2⋅(b2−a2)+C⋅(b−a)...]]></description><category></category></item><item><title><![CDATA[2018年成都信息工程大学第七届ACM程序设计竞赛 题解报告]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/80216004</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/80216004</guid><author>fo0Old</author><pubDate>Sun, 06 May 2018 16:57:38 +0800</pubDate><description><![CDATA[Problem A(读信)

签到题: 
把所有字母全部转换成大写(或小写), 然后判断一下是否是回文串(正着和倒着是否完全相等)就可以了 
时间复杂度:O(n)O(n)O(n)



Problem B(Anxdada的询问1)

签到题:



for(int i=1;i&amp;lt;n;++i)
    for(int j=i+1;j&amp;lt;=n;++j)
        if(a[i]+a[j]...]]></description><category></category></item><item><title><![CDATA[Anxdada的询问(two stack)]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/79594309</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/79594309</guid><author>fo0Old</author><pubDate>Sat, 17 Mar 2018 18:09:16 +0800</pubDate><description><![CDATA[很多人会很自然的想到用two pointer来维护区间乘积, 但是从区间[l,r][l,r][l,r]转移到[l+1,r][l+1,r][l+1,r]的时候, 如果a[l]a[l]a[l]在模ppp意义下的逆元不存在, 那么就无法转移



two stack:

用2个栈来维护区间[l,r][l,r][l,r]中数的乘积 
其中一个栈S1S1S_1维护的是区间[l,k](l≤k)[l,k](l≤...]]></description><category></category></item><item><title><![CDATA[fold的毒瘤题]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/79511512</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/79511512</guid><author>fo0Old</author><pubDate>Sat, 10 Mar 2018 20:51:02 +0800</pubDate><description><![CDATA[easy:做法1.可以仿照最小生成树的Kruskal做法, 将边权按照从小到大排序 
对于每个询问: 按边权从小到大依次连接各个边, 同时用并查集维护特殊点的连通性, 一旦某条边加入后, 遍历所有的特殊点发现它们属于同一集合, 那么答案就是这条边的边权 
复杂度: O(m⋅logm+q⋅m⋅n)O(m\cdotp logm+q\cdotp m\cdotp n)做法2.对于某个权值xx, 如果权值不超]]></description><category></category></item><item><title><![CDATA[分块]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/79274783</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/79274783</guid><author>fo0Old</author><pubDate>Tue, 06 Feb 2018 21:31:16 +0800</pubDate><description><![CDATA[1.区间加, 查询单点值struct block
{
    static const int __=50005;
    static const int _b_=300;
    ll a[__];int n,bsz,bel[__];
    ll ad[_b_];    ll operator[](int x){return a[x]+ad[bel[x]];}    void build()]]></description><category></category></item><item><title><![CDATA[线性同余方程组]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/79145746</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/79145746</guid><author>fo0Old</author><pubDate>Tue, 23 Jan 2018 22:48:09 +0800</pubDate><description><![CDATA[⎧⎩⎨⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪x1≡r1(%m1)x2≡r2(%m2)⋯xi≡ri(%mi)⋯xn≡rn(%mn)\begin{cases}  
x_1\equiv r_1(\%m_1)\\  
x_2\equiv r_2(\%m_2)\\  
\cdots\\  
x_i\equiv r_i(\%m_i)\\  
\cdots\\  
x_n\equiv r_n(\%m_n)\\  
\end]]></description><category></category></item><item><title><![CDATA[线性同余方程]]></title><link>https://blog.youkuaiyun.com/fo0Old/article/details/79145738</link><guid>https://blog.youkuaiyun.com/fo0Old/article/details/79145738</guid><author>fo0Old</author><pubDate>Tue, 23 Jan 2018 22:46:58 +0800</pubDate><description><![CDATA[线性同余方程求解:  a⋅x≡b(%p)a\cdot x\equiv b(\%p)设: a⋅x=p⋅(−y)+ba\cdot x=p\cdot (-y)+b得: a⋅x+p⋅y=ba\cdot x+p\cdot y=b根据拓展欧几里得: a⋅x+p⋅y=gcd(a,p)a\cdot x+p\cdot y=gcd(a,p)得到一个解为x′0x_0'那么: a⋅x+p⋅y=ba\cdot x+p\cdo]]></description><category></category></item></channel></rss>