<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[chlxyd的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/chlxyd</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chlxyd]]></copyright><item><title><![CDATA[Andrew Stankevich's Contest #10 Solution]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/9718539</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/9718539</guid><author>chlxyd</author><pubDate>Fri, 02 Aug 2013 16:28:44 +0800</pubDate><description><![CDATA[Andrew Stankevich's Contest #10
Solution
Problem A: Brackets
Problem B: Dividinga Chocolate
Problem C: ThermalDeath of the Universe
Problem D: EquationsSystem
Problem E: Fool'sGame
Problem F: L]]></description><category></category></item><item><title><![CDATA[Andrew Stankevich's Contest #5 Solution]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/9718041</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/9718041</guid><author>chlxyd</author><pubDate>Fri, 02 Aug 2013 15:54:24 +0800</pubDate><description><![CDATA[Andrew Stankevich's Contest #5
Solution
Problem A: UniqueAttack
Problem B: BurningBridges
Problem C: Circles
Problem D: LinearProgramming Dual
Problem E: DVD
Problem F: ThinkPositive
Problem G]]></description><category></category></item><item><title><![CDATA[Andrew Stankevich's Contest #2 Solution]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/9626109</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/9626109</guid><author>chlxyd</author><pubDate>Tue, 30 Jul 2013 12:05:37 +0800</pubDate><description><![CDATA[Andrew Stankevich's Contest #2
Solution
Problem A: NonAbsorbing DFA
Problem B: TheTowers of Hanoi Revisited
Problem C:Hyperhuffman
Problem D: LittleJumper
Problem E:Quantization Problem
Problem]]></description><category></category></item><item><title><![CDATA[Andrew Stankevich's Contest #8 Solution]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/9430189</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/9430189</guid><author>chlxyd</author><pubDate>Wed, 24 Jul 2013 00:01:36 +0800</pubDate><description><![CDATA[Andrew Stankevich's Contest #8
Solution
Problem A: NonptimalAssignments
Problem B: Cryptography
Problem C: FibonacciSubsequence
Problem D: Hexagonand Rhombic Dominoes
Problem E: StrangeLimit
Pr]]></description><category></category></item><item><title><![CDATA[Andrew Stankevich's Contest #1 Solution]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/9366065</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/9366065</guid><author>chlxyd</author><pubDate>Thu, 18 Jul 2013 12:51:11 +0800</pubDate><description><![CDATA[Andrew Stankevich's Contest #1
Solution
Problem A: ChineseGirls' Amusement
Problem B: ReactorCooling
Problem C: NewYear Bonus Grant
Problem D: MatrixMultiplication
Problem E: NicePatterns Strike]]></description><category></category></item><item><title><![CDATA[5th Southern Subregional Contest. Saratov 2002 Solution]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/9348377</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/9348377</guid><author>chlxyd</author><pubDate>Wed, 17 Jul 2013 00:01:07 +0800</pubDate><description><![CDATA[5th Southern Subregional Contest.

Saratov 2002
Solution
Problem A: Thesum
Problem B: Brokenline
Problem C: Shtirlits
Problem D: Boxes
Problem E: Telephonedirectory
Problem F: Snake
Problem]]></description><category></category></item><item><title><![CDATA[The 10th Zhejiang Provincial Collegiate  Programming Contest Solution]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/9017035</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/9017035</guid><author>chlxyd</author><pubDate>Mon, 03 Jun 2013 21:14:07 +0800</pubDate><description><![CDATA[The 10th Zhejiang Provincial Collegiate 
Programming Contest
Solution
Problem A: Applications
Problem B: BreakStandard Weight
Problem C: CalculatePrime S
Problem D: Densityof Power Network
Prob]]></description><category></category></item><item><title><![CDATA[JAG Practice Contest 2011 Solution]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/8860694</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/8860694</guid><author>chlxyd</author><pubDate>Sat, 27 Apr 2013 20:41:50 +0800</pubDate><description><![CDATA[JAG Practice Contest 2011
Japanese Alumni Group
Solution
Problem A: InfinityMaze
Problem B:Butterfly
Problem C:Chinese Classics
Problem D: Revengeof Champernowne Constant
Problem E: Full Text S]]></description><category></category></item><item><title><![CDATA[第二届华中区程序设计邀请赛暨武汉大学第十一届校赛 现场赛 解题报告]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/8839565</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/8839565</guid><author>chlxyd</author><pubDate>Tue, 23 Apr 2013 15:45:49 +0800</pubDate><description><![CDATA[The 11thWuhan University
The 2rdCentral China Invitation
ProgrammingContest
Solution
Problem A: All Your Bases
Problem B: Beautiful Cities
Problem C: Check the Identity
Problem D: Demon Tour
P]]></description><category></category></item><item><title><![CDATA[第二届华中区程序设计邀请赛暨武汉大学第十一届校赛 网络预选赛 解题报告]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/8800366</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/8800366</guid><author>chlxyd</author><pubDate>Sun, 14 Apr 2013 17:01:41 +0800</pubDate><description><![CDATA[2013WHUACM校赛网赛题目题解
一个人出一套题目略累。。不过还好数据啥的没出什么差错。

关于题目描述：附件中会有一份中文的题目，所以以下题解不再赘述题意。
E-easy N-normal H-hard VH-very hard
A – A problem on tree (N) 
Solution
Tag：贪心，结论。
我们首先来考虑一条链的情况：设第一个点的值是a，第二个]]></description><category></category></item><item><title><![CDATA[Woj 简易题解 Volume #2]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/8723074</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/8723074</guid><author>chlxyd</author><pubDate>Tue, 26 Mar 2013 18:07:01 +0800</pubDate><description><![CDATA[*1101 数据范围太扯淡了。。如果不考虑范围的话可以这样想，从一个点到另外一个点他们的哈密顿距离为他们的最短距离，那么这个距离的步数就是我需要的最少步数，假设从一个点到另外一个点要走m步，那么首先从n个点里选m个出来保证能走到终点，然后这m步的时候水平走和竖直走是独立的，假设需要水平走x，竖直走y，那么这一步的方案数就是从m个点里选x个出来的方案数。然后讨论n-m步无用的步伐，因为已经到了终点，]]></description><category></category></item><item><title><![CDATA[CF practice #2 solution]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/8723021</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/8723021</guid><author>chlxyd</author><pubDate>Tue, 26 Mar 2013 17:55:15 +0800</pubDate><description><![CDATA[CF practice #2
 solution




题目链接


A：cf 152 div2 C



题意：有一个球，一个球门和一面墙，要把球射到墙上然后反弹到球门中，问是否可行，如果可行输出任意一个合法的与墙面接触的x坐标。球的位置和半径已知，球门横坐标为0，墙水平于x轴。

数据范围：所有坐标和数据的大小小于106。

 

Solution：易知]]></description><category></category></item><item><title><![CDATA[CF practice #1 solution]]></title><link>https://blog.youkuaiyun.com/chlxyd/article/details/8722983</link><guid>https://blog.youkuaiyun.com/chlxyd/article/details/8722983</guid><author>chlxyd</author><pubDate>Tue, 26 Mar 2013 17:51:40 +0800</pubDate><description><![CDATA[CF practice #1solution

题目链接
A：cf 144 div
题意：给出一种图的构造方式，d(1)和d(2)已知，d(n)的构造方式为把d(n-2)的所有节点编号加上|d(n-1)|,然后把d(n-2)的最小节点和d(n-1)的最大最小节点都连一条边，这样构造成了d(n)。然后给一个n，问你在d(n)中，两个节点a，b的最短路长度是多少。
数据范围：n5,a,b16]]></description><category></category></item></channel></rss>