<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ç]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/mf_chris</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; mf_chris]]></copyright><item><title><![CDATA[717 Bubble Cup 9 - Finals [Online Mirror]]]></title><link>https://blog.youkuaiyun.com/mf_chris/article/details/98330875</link><guid>https://blog.youkuaiyun.com/mf_chris/article/details/98330875</guid><author>mf_chris</author><pubDate>Sat, 03 Aug 2019 13:45:04 +0800</pubDate><description><![CDATA[签到题：
C. Potions Homework
题意：n个人，n个任务，第i个人和第i个任务权值相同，现要求重新分配任务，令每个人和它做的任务的权值之积的和最小
直接最小和最大，次小和次大乘起来完事，微扰可证
#include&lt;cstdio&gt;
#include&lt;iostream&gt;
#include&lt;cstring&gt;
#include&lt;cstdlib&gt...]]></description><category></category></item><item><title><![CDATA[组合数学]]></title><link>https://blog.youkuaiyun.com/mf_chris/article/details/97765186</link><guid>https://blog.youkuaiyun.com/mf_chris/article/details/97765186</guid><author>mf_chris</author><pubDate>Tue, 30 Jul 2019 11:31:06 +0800</pubDate><description><![CDATA[斯特林数
(一)第一类斯特林数
s1(n,m)s1(n,m)s1(n,m)表示n个元素排成m个圆排列的个数，记作[nm]n \brack m[mn​]
a.递推公式与性质
​	[nm]=[n−1m−1]+[n−1m]∗(n−1){n\brack m}={n-1\brack m-1}+{n-1\brack m}*(n-1)[mn​]=[m−1n−1​]+[mn−1​]∗(n−1)
​	新来的元素既可...]]></description><category></category></item><item><title><![CDATA[708 AIM Tech Round 3 (Div. 1)]]></title><link>https://blog.youkuaiyun.com/mf_chris/article/details/97533301</link><guid>https://blog.youkuaiyun.com/mf_chris/article/details/97533301</guid><author>mf_chris</author><pubDate>Sat, 27 Jul 2019 17:35:07 +0800</pubDate><description><![CDATA[A. Letters Cyclic Shift
白痴。注意全是a要把最后一个变成z
证明我写了
#include&lt;cstdio&gt;
#include&lt;iostream&gt;
#include&lt;cstring&gt;
#include&lt;cstdlib&gt;
#include&lt;algorithm&gt;
#include&lt;cmath&gt;
using na...]]></description><category></category></item><item><title><![CDATA[704 Codeforces Round #366 (Div. 1)]]></title><link>https://blog.youkuaiyun.com/mf_chris/article/details/96480750</link><guid>https://blog.youkuaiyun.com/mf_chris/article/details/96480750</guid><author>mf_chris</author><pubDate>Fri, 19 Jul 2019 15:03:47 +0800</pubDate><description><![CDATA[Codeforces Round #366 (Div. 1)
A. Thor
这个题炸一看并不是很好做，但只要不想复杂了其实直接用两个链表+并查集维护没被删掉的即可
注意这里链表最好就不要偷懒了，容易出奇怪的错最后发现还是要老老实实俩个双向
十年没写并查集路径压缩都不会了。。
#include&lt;cstdio&gt;
#include&lt;iostream&gt;
#include&lt;c...]]></description><category></category></item><item><title><![CDATA[关于我]]></title><link>https://blog.youkuaiyun.com/mf_chris/article/details/91506455</link><guid>https://blog.youkuaiyun.com/mf_chris/article/details/91506455</guid><author>mf_chris</author><pubDate>Wed, 12 Jun 2019 13:22:51 +0800</pubDate><description><![CDATA[之前的博客不想用了 虽然这里很sb
就酱

]]></description><category></category></item></channel></rss>