<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[cR's Blog //+1s!]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ceerrep</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ceerrep]]></copyright><item><title><![CDATA[一个奇奇怪怪的数学问题]]></title><link>https://blog.youkuaiyun.com/ceerrep/article/details/52314635</link><guid>https://blog.youkuaiyun.com/ceerrep/article/details/52314635</guid><author>ceerrep</author><pubDate>Thu, 25 Aug 2016 15:02:36 +0800</pubDate><description><![CDATA[试从0 ~ N-1中取出X个数 , 使其和为C。
好吧这玩意是有一道CF的题乱搞不出来的副产品。 
题目传送门 http://codeforces.com/contest/709/problem/D  
题解传送门 http://blog.youkuaiyun.com/ceerrep/article/details/52314378好吧就是想不出来然后一通乱搞，
  a00=∑A[i]=0(d0[i−1])]]></description><category></category></item><item><title><![CDATA[CodeForces AIM Tech Round 3 (Div. 2) D]]></title><link>https://blog.youkuaiyun.com/ceerrep/article/details/52314378</link><guid>https://blog.youkuaiyun.com/ceerrep/article/details/52314378</guid><author>ceerrep</author><pubDate>Thu, 25 Aug 2016 14:41:26 +0800</pubDate><description><![CDATA[CodeForces AIM Tech Round 3 (Div. 2) D智障题，但就是没想出来。 
 
传送门，http://codeforces.com/contest/709/problem/D题目大意： 
给定四个数a00 , a01 , a10 , a11 , 请构造序列A , 使得其中有a00个{0,0}子序列 , a01个{0,1}自序列 , 等等。  
若不能构造输出 Imposs]]></description><category></category></item><item><title><![CDATA[奇奇怪怪的字符串循环同构问题]]></title><link>https://blog.youkuaiyun.com/ceerrep/article/details/52300152</link><guid>https://blog.youkuaiyun.com/ceerrep/article/details/52300152</guid><author>ceerrep</author><pubDate>Wed, 24 Aug 2016 14:24:58 +0800</pubDate><description><![CDATA[昨天看到篇奇怪的论文……讲最小表示法的比较的。有字符串S1、S2，|S1| = |S2|，请在O(N)时间内判断是否存在 i 使得
  S1[i...|S1|]+S1[1...i]＝S2S1[i ... |S1|]+S1[1...i] ＝ S2 。
显然朴素算法 O(N2)O(N^2)高级的话可以用KMP什么的模版串匹配算法，将S1复制一遍，在里面匹配S2就可以了。然后论文里有一种非常神奇的做法。显]]></description><category></category></item></channel></rss>