<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[阳光下的泡沫]]></title><description><![CDATA[我用双手成就我的梦想]]></description><link>https://blog.youkuaiyun.com/Fun_Zero</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Fun_Zero]]></copyright><item><title><![CDATA[hdu 5667 BestCoder Round #80 矩阵快速幂]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51187786</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51187786</guid><author>Fun_Zero</author><pubDate>Tue, 19 Apr 2016 09:55:50 +0800</pubDate><description><![CDATA[Sequence
 
 Accepts: 59
 
 Submissions: 650

 Time Limit: 2000/1000 MS (Java/Others)
 
 Memory Limit: 65536/65536 K (Java/Others)





Problem Description

\
 \ \ \    Holion
 August]]></description><category></category></item><item><title><![CDATA[南京理工大学第八届程序设计大赛(校外镜像)]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51175010</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51175010</guid><author>Fun_Zero</author><pubDate>Sun, 17 Apr 2016 22:11:52 +0800</pubDate><description><![CDATA[偷吃糖果
Time Limit: 1000Ms
Memory Limit: 65536KB




Description

小鱼喜欢吃糖果。他有两盒糖果，两盒糖果分别仅由小写字母组成的字符串s和字符串t构成。其中'a'到'z'表示具体的某种糖果类别。他原本打算送给他喜欢的女生，但是要送给女孩子的话两盒糖果不能有差别(即字符串s和t完全相同)。所以，他决定偷吃几块，他吃糖果的策略]]></description><category></category></item><item><title><![CDATA[CodeForces346  C. Number Transformation II]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170748</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170748</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 22:33:28 +0800</pubDate><description><![CDATA[You are given a sequence of positive integers x1, x2, ..., xn and two non-negative integers a and b. Your task is to transform a into b.
 To do that, you can perform the following moves:

subtract]]></description><category></category></item><item><title><![CDATA[hdu 3436 线段树 一顿操作]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170722</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170722</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 22:28:39 +0800</pubDate><description><![CDATA[Queue-jumpers
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3348    Accepted Submission(s): 904



Problem Description

Ponyo and Gar]]></description><category></category></item><item><title><![CDATA[hdu 4630 查询[L,R]区间内任意两个数的最大公约数]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170700</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170700</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 22:25:34 +0800</pubDate><description><![CDATA[No Pain No Game
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2000    Accepted Submission(s): 851



Problem Description

Life is a g]]></description><category></category></item><item><title><![CDATA[hdu 4638 树状数组 区间内连续区间的个数(尽可能长)]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170681</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170681</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 22:23:19 +0800</pubDate><description><![CDATA[Group
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1959    Accepted Submission(s): 1006



Problem Description

There are n men ,eve]]></description><category></category></item><item><title><![CDATA[hdu 3397 线段树双标记]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170660</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170660</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 22:19:52 +0800</pubDate><description><![CDATA[Sequence operation
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7502    Accepted Submission(s): 2233



Problem Description

lxhgww]]></description><category></category></item><item><title><![CDATA[hdu 4578 线段树(标记处理)]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170637</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170637</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 22:17:09 +0800</pubDate><description><![CDATA[Transformation
Time Limit: 15000/8000 MS (Java/Others)    Memory Limit: 65535/65536 K (Java/Others)
Total Submission(s): 4095    Accepted Submission(s): 1008



Problem Description

Yuanfang i]]></description><category></category></item><item><title><![CDATA[hdu 4533 线段树(问题转化+)]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170626</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170626</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 22:14:58 +0800</pubDate><description><![CDATA[威威猫系列故事——晒被子
Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 1592    Accepted Submission(s): 444



Problem Description

　　因为马拉松初赛中吃鸡腿的]]></description><category></category></item><item><title><![CDATA[hdu 2871 线段树(各种操作)]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170600</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170600</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 22:13:07 +0800</pubDate><description><![CDATA[Memory Control
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5913    Accepted Submission(s): 1380



Problem Description

Memory unit]]></description><category></category></item><item><title><![CDATA[hdu 3433 A Task Process 二分+dp]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170586</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170586</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 22:08:19 +0800</pubDate><description><![CDATA[A Task Process
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1332    Accepted Submission(s): 656



Problem Description

There are tw]]></description><category></category></item><item><title><![CDATA[扩展Lucas定理]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170414</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170414</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 21:45:25 +0800</pubDate><description><![CDATA[（1）Lucas定理：p为素数，则有:







（2）证明： n=(ak...a2,a1,a0)p = (ak...a2,a1)p*p + a0 =  [n/p]*p+a0，m=[m/p]*p+b0其次，我们知道，对任意质数p有(1+x)^p=1+(x^p)(mod p) 。我们只要证明这个式子：C(n,m)=C([n/p],[m/p]) * C(a0,b0)(mod p)，]]></description><category></category></item><item><title><![CDATA[2015 ICL, Finals, Div. 1 Ceizenpok’s formula（组合数取模，扩展lucas定理）]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170382</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170382</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 21:42:44 +0800</pubDate><description><![CDATA[J. Ceizenpok’s formula


time limit per test
 2 seconds


memory limit per test
 256 megabytes


input
 standard input


output
 standard output



Dr. Ceizenp'ok from planet i1c5l]]></description><category></category></item><item><title><![CDATA[hdu5666  BestCoder Round #80]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170339</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51170339</guid><author>Fun_Zero</author><pubDate>Sat, 16 Apr 2016 21:39:28 +0800</pubDate><description><![CDATA[Segment
 
 Accepts: 418
 
 Submissions: 2020

 Time Limit: 2000/1000 MS (Java/Others)
 
 Memory Limit: 65536/65536 K (Java/Others)



问题描述
\ \ \ \    Rivendell非常神,喜欢研究奇怪的问题.

\ \ \ \    今]]></description><category></category></item><item><title><![CDATA[hdu5558  后缀数组]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51079337</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51079337</guid><author>Fun_Zero</author><pubDate>Wed, 06 Apr 2016 22:33:47 +0800</pubDate><description><![CDATA[Alice's Classified Message
Time Limit: 16000/8000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 308    Accepted Submission(s): 118



Problem Description
]]></description><category></category></item><item><title><![CDATA[算法合集之《后缀数组——处理字符串的有力工具》]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51045886</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51045886</guid><author>Fun_Zero</author><pubDate>Wed, 06 Apr 2016 22:25:49 +0800</pubDate><description><![CDATA[后缀数组：
sa[i]:表示排名第i个的首字母位置
Rank[i]:第i个数的排名
Height[i]:sa[i]和sa[i-1]的最长公共前缀



1.不可重叠最长重复子串（pku1743）
给你一串数字，求它们最长的重复(公差相同)子序列，且两个子序列不相交

我们可以向二分枚举ans长度,如果能找到两个height>=ans,而且通过sa判断两个的间接>=ans,则说明]]></description><category></category></item><item><title><![CDATA[poj2406 连续重复子串]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51079195</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51079195</guid><author>Fun_Zero</author><pubDate>Wed, 06 Apr 2016 22:18:49 +0800</pubDate><description><![CDATA[Power Strings




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 41110
 
Accepted: 17099





Description

Given two strings a and b we define a*b to be their conca]]></description><category></category></item><item><title><![CDATA[poj 3693 后缀数组 重复次数最多的连续重复子串]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51079169</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51079169</guid><author>Fun_Zero</author><pubDate>Wed, 06 Apr 2016 22:16:00 +0800</pubDate><description><![CDATA[Maximum repetition substring




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 8669
 
Accepted: 2637





Description

The repetition number of a string is defined]]></description><category></category></item><item><title><![CDATA[SPOJ PHRASES 每个字符串至少出现两次且不重叠的最长子串]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51079127</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51079127</guid><author>Fun_Zero</author><pubDate>Wed, 06 Apr 2016 22:13:27 +0800</pubDate><description><![CDATA[Description


You are the King of Byteland. Your agents have just intercepted a batch of encrypted enemy messages concerning the date of the planned attack on your island. You immedietaly send for ]]></description><category></category></item><item><title><![CDATA[POJ 3294 n个串中至少一半的串共享的最长公共子串]]></title><link>https://blog.youkuaiyun.com/Fun_Zero/article/details/51079100</link><guid>https://blog.youkuaiyun.com/Fun_Zero/article/details/51079100</guid><author>Fun_Zero</author><pubDate>Wed, 06 Apr 2016 22:10:26 +0800</pubDate><description><![CDATA[Life Forms




Time Limit: 5000MS
 
Memory Limit: 65536K


Total Submissions: 12484
 
Accepted: 3502





Description

You may have wondered why most extraterrestrial life forms re]]></description><category></category></item></channel></rss>