<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ShallWe 's Blog]]></title><description><![CDATA[只是一只诲人不倦的小蒟蒻]]></description><link>https://blog.youkuaiyun.com/ShallWeisnow</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ShallWeisnow]]></copyright><item><title><![CDATA[搬家了：http://shallwe2000.cc]]></title><link>https://blog.youkuaiyun.com/ShallWeisnow/article/details/52712518</link><guid>https://blog.youkuaiyun.com/ShallWeisnow/article/details/52712518</guid><author>ShallWeisnow</author><pubDate>Fri, 30 Sep 2016 17:00:31 +0800</pubDate><description><![CDATA[出于对新主题markdown恶心的支持， 
搬家：  
http://shallwe2000.coding.me; 
https://shallwe2000.github.io;]]></description><category></category></item><item><title><![CDATA[测试]]></title><link>https://blog.youkuaiyun.com/ShallWeisnow/article/details/52177363</link><guid>https://blog.youkuaiyun.com/ShallWeisnow/article/details/52177363</guid><author>ShallWeisnow</author><pubDate>Wed, 10 Aug 2016 23:41:47 +0800</pubDate><description><![CDATA[测试Σk=1→nΣd|kμ(d)∗kd\Sigma_{k=1 \to n} \Sigma_{d|k}{\mu(d) * \frac{k}{d}} 
Σi=1→nΣj=1→mi∗jgcd(i,j)\Sigma_{i=1 \to n} \Sigma_{j=1 \to m} \frac{i*j}{gcd(i,j)}测试这个主题的markdown能不能用公式]]></description><category></category></item><item><title><![CDATA[Bzoj 1566: [NOI2009]管道取珠（动态规划->神题）]]></title><link>https://blog.youkuaiyun.com/ShallWeisnow/article/details/52177241</link><guid>https://blog.youkuaiyun.com/ShallWeisnow/article/details/52177241</guid><author>ShallWeisnow</author><pubDate>Wed, 10 Aug 2016 23:22:58 +0800</pubDate><description><![CDATA[以下内容来自[ShallWe's Blog](http://blog.youkuaiyun.com/ShallWeisnow/article/details/52177241)
题目题目链接 
Description
Input第一行包含两个整数n, m，分别表示上下两个管道中球的数目。
第二行为一个AB字符串，长度为n，表示上管道中从左到右球的类型。其中A表示浅色球，B表示深色球。
第三行为一个AB字符串，长]]></description><category></category></item><item><title><![CDATA[Bzoj 4422: [Cerc2015]Cow Confinement(线段树+扫描线）]]></title><link>https://blog.youkuaiyun.com/ShallWeisnow/article/details/52175103</link><guid>https://blog.youkuaiyun.com/ShallWeisnow/article/details/52175103</guid><author>ShallWeisnow</author><pubDate>Wed, 10 Aug 2016 18:30:03 +0800</pubDate><description><![CDATA[bzoj 4422: [Cerc2015]Cow Confinement
题目题目链接
 Description一个10^6行10^6列的网格图，上面有一些牛、花和一些矩形围栏，围栏在格子的边界上，牛和花在格子里，牛只能向下或向右走，牛也不能穿过围栏和地图边界，求每头牛它能到达的花的数量。注意栅栏不会相交
Input第一行一个数f表示矩形围栏的数量]]></description><category></category></item></channel></rss>