<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u013496346的专栏]]></title><description><![CDATA[野心有多大，梦想就有多大。梦想有多大，努力就得多大。]]></description><link>https://blog.youkuaiyun.com/u013496346</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u013496346]]></copyright><item><title><![CDATA[GT and sequence]]></title><link>https://blog.youkuaiyun.com/u013496346/article/details/49386617</link><guid>https://blog.youkuaiyun.com/u013496346/article/details/49386617</guid><author>u013496346</author><pubDate>Sat, 24 Oct 2015 17:35:27 +0800</pubDate><description><![CDATA[题目：


GT and sequence
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1489    Accepted Submission(s): 349



Problem Description

Yo]]></description><category></category></item><item><title><![CDATA[maxsum]]></title><link>https://blog.youkuaiyun.com/u013496346/article/details/46849461</link><guid>https://blog.youkuaiyun.com/u013496346/article/details/46849461</guid><author>u013496346</author><pubDate>Sun, 12 Jul 2015 14:16:12 +0800</pubDate><description><![CDATA[Max Sum

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 174541 Accepted Submission(s): 40618


Problem Description
Given a sequence a[1],a]]></description><category></category></item><item><title><![CDATA[文章标题]]></title><link>https://blog.youkuaiyun.com/u013496346/article/details/45465223</link><guid>https://blog.youkuaiyun.com/u013496346/article/details/45465223</guid><author>u013496346</author><pubDate>Mon, 04 May 2015 00:13:04 +0800</pubDate><description><![CDATA[上海邀请赛选拔赛落榜我还是个acmer吗？一年前我肯定坚定的说是，可现在我居然有点犹豫，两年前我第一次接触了acm，被它吸引，对它着迷，晚上睡不着满脑子都是题目，一年前我进入了校队，和队里最牛的人组队，不知是因为女生而被青睐还是什么原因。总之，我从此过上了安逸的日子，每次比赛只需要读几道题目，完全不用加入思考的行列，两位学长非常给力，每一次我们都可以第一个开题，每一次都可以在学校的比赛中拿到第一，]]></description><category></category></item><item><title><![CDATA[Tempter of the Bone]]></title><link>https://blog.youkuaiyun.com/u013496346/article/details/25338457</link><guid>https://blog.youkuaiyun.com/u013496346/article/details/25338457</guid><author>u013496346</author><pubDate>Thu, 08 May 2014 21:50:56 +0800</pubDate><description><![CDATA[题目：]]></description><category></category></item><item><title><![CDATA[N皇后]]></title><link>https://blog.youkuaiyun.com/u013496346/article/details/25337055</link><guid>https://blog.youkuaiyun.com/u013496346/article/details/25337055</guid><author>u013496346</author><pubDate>Thu, 08 May 2014 21:33:35 +0800</pubDate><description><![CDATA[题目：]]></description><category></category></item><item><title><![CDATA[近似回文词]]></title><link>https://blog.youkuaiyun.com/u013496346/article/details/22827665</link><guid>https://blog.youkuaiyun.com/u013496346/article/details/22827665</guid><author>u013496346</author><pubDate>Wed, 02 Apr 2014 23:06:16 +0800</pubDate><description><![CDATA[好久没写博客了。。。开学来了学校后总是烦于总结，最近看大家都开始写了，自己才又拾起来。。。
题目：
Description
输入一行文本，输出最长近似回文词连续子串。所谓近似回文词是指满足以下条件的字符串： 
1. S 以字母开头，字母结尾 
2. a(S)和 b(S)最多有 2k 个位置不同，其中 a(S)是 S 删除所有非字母字符并且把所有字母转化成小写之后
得到的串，b(S)是 ]]></description><category></category></item><item><title><![CDATA[Prime Cryptarithm]]></title><link>https://blog.youkuaiyun.com/u013496346/article/details/18909051</link><guid>https://blog.youkuaiyun.com/u013496346/article/details/18909051</guid><author>u013496346</author><pubDate>Mon, 03 Feb 2014 13:01:34 +0800</pubDate><description><![CDATA[题目：
Prime Cryptarithm
The following cryptarithm is a multiplication problem that can be solved by substituting digits from a specified set of N digits into the positions marked with *. If the set of]]></description><category></category></item><item><title><![CDATA[Calf Flac]]></title><link>https://blog.youkuaiyun.com/u013496346/article/details/18908967</link><guid>https://blog.youkuaiyun.com/u013496346/article/details/18908967</guid><author>u013496346</author><pubDate>Mon, 03 Feb 2014 12:43:19 +0800</pubDate><description><![CDATA[题目：
Calf Flac
It is said that if you give an infinite number of cows an infinite number of heavy-duty laptops (with very large keys), that they will ultimately produce all the world's great palindro]]></description><category></category></item><item><title><![CDATA[broken necklace]]></title><link>https://blog.youkuaiyun.com/u013496346/article/details/18778137</link><guid>https://blog.youkuaiyun.com/u013496346/article/details/18778137</guid><author>u013496346</author><pubDate>Sat, 25 Jan 2014 23:03:27 +0800</pubDate><description><![CDATA[题目：
Broken Necklace

You have a necklace of N red, white, or blue beads (3

1 2 1 2
r b b r b r r b
r b b b
r r b r
r r w r
b r w w
b b r r
b b b b
b b r b
r r b r
b r r r
b r r r
r r]]></description><category></category></item><item><title><![CDATA[friday]]></title><link>https://blog.youkuaiyun.com/u013496346/article/details/18773485</link><guid>https://blog.youkuaiyun.com/u013496346/article/details/18773485</guid><author>u013496346</author><pubDate>Sat, 25 Jan 2014 20:23:01 +0800</pubDate><description><![CDATA[题目：
Friday the Thirteenth
Is Friday the 13th really an unusual event?

That is, does the 13th of the month land on a Friday less often than on any other day of the week? To answer this question, w]]></description><category></category></item></channel></rss>