<![CDATA[Alex]]>

<![CDATA[Alex]]>https://blog.csdn.net/Guard_Minezh-cnhttps://blog.csdn.net/<![CDATA[Good Bye 2015 (One University One Question) Round III]]>https://blog.csdn.net/Guard_Mine/article/details/50642838https://blog.csdn.net/Guard_Mine/article/details/50642838Guard_MineSun, 07 Feb 2016 13:58:35 +08000)(> 0)分析：首先可以得到kk个人里的最大值MM，设现在剩下的钱是RR，那么首先要成为手气王，就必须得到至少M+1M+1，但是最多是]]><![CDATA[LightOJ1021---Painful Bases (状压dp)]]>https://blog.csdn.net/Guard_Mine/article/details/46431199https://blog.csdn.net/Guard_Mine/article/details/46431199Guard_MineTue, 09 Jun 2015 20:24:36 +0800<![CDATA[LightOJ1020(博弈)]]>https://blog.csdn.net/Guard_Mine/article/details/46430435https://blog.csdn.net/Guard_Mine/article/details/46430435Guard_MineTue, 09 Jun 2015 19:03:30 +0800<![CDATA[LightOJ1017---Brush (III) (dp)]]>https://blog.csdn.net/Guard_Mine/article/details/46416931https://blog.csdn.net/Guard_Mine/article/details/46416931Guard_MineMon, 08 Jun 2015 19:56:52 +0800<![CDATA[LightOJ1016---Brush (II) (贪心)]]>https://blog.csdn.net/Guard_Mine/article/details/46416193https://blog.csdn.net/Guard_Mine/article/details/46416193Guard_MineMon, 08 Jun 2015 18:23:47 +0800<![CDATA[LightOJ1010---Knights in Chessboard (规律题)]]>https://blog.csdn.net/Guard_Mine/article/details/46413251https://blog.csdn.net/Guard_Mine/article/details/46413251Guard_MineMon, 08 Jun 2015 15:25:15 +0800<![CDATA[LightOJ1013---Love Calculator (dp)]]>https://blog.csdn.net/Guard_Mine/article/details/46404913https://blog.csdn.net/Guard_Mine/article/details/46404913Guard_MineSun, 07 Jun 2015 22:10:52 +0800<![CDATA[LightOJ1012---Guilty Prince (并查集)]]>https://blog.csdn.net/Guard_Mine/article/details/46402609https://blog.csdn.net/Guard_Mine/article/details/46402609Guard_MineSun, 07 Jun 2015 18:09:02 +0800<![CDATA[LightOJ1011---Marriage Ceremonies (状压dp)]]>https://blog.csdn.net/Guard_Mine/article/details/46386421https://blog.csdn.net/Guard_Mine/article/details/46386421Guard_MineSat, 06 Jun 2015 11:08:45 +0800<![CDATA[Codeforces Round #306 (Div. 2)]]>https://blog.csdn.net/Guard_Mine/article/details/46382319https://blog.csdn.net/Guard_Mine/article/details/46382319Guard_MineFri, 05 Jun 2015 22:14:21 +0800 File]]><![CDATA[LightOJ1009---Back to Underworld (bfs染色)]]>https://blog.csdn.net/Guard_Mine/article/details/46375485https://blog.csdn.net/Guard_Mine/article/details/46375485Guard_MineFri, 05 Jun 2015 13:00:35 +0800<![CDATA[LightOJ1008---Fibsieve`s Fantabulous Birthday (规律)]]>https://blog.csdn.net/Guard_Mine/article/details/46375293https://blog.csdn.net/Guard_Mine/article/details/46375293Guard_MineFri, 05 Jun 2015 12:25:32 +0800<![CDATA[POJ2407---Relatives(求单个数的欧拉函数)]]>https://blog.csdn.net/Guard_Mine/article/details/46365413https://blog.csdn.net/Guard_Mine/article/details/46365413Guard_MineThu, 04 Jun 2015 18:24:27 +0800 1, y > 0, z > 0 such t]]><![CDATA[POJ1284---Primitive Roots(求原根个数, 欧拉函数)]]>https://blog.csdn.net/Guard_Mine/article/details/46365225https://blog.csdn.net/Guard_Mine/article/details/46365225Guard_MineThu, 04 Jun 2015 18:04:35 +0800<![CDATA[LightOJ1007---Mathematically Hard (欧拉函数)]]>https://blog.csdn.net/Guard_Mine/article/details/46365189https://blog.csdn.net/Guard_Mine/article/details/46365189Guard_MineThu, 04 Jun 2015 17:59:16 +0800<![CDATA[LightOJ1006---Hex-a-bonacci(矩阵快速幂)]]>https://blog.csdn.net/Guard_Mine/article/details/46351929https://blog.csdn.net/Guard_Mine/article/details/46351929Guard_MineWed, 03 Jun 2015 21:47:34 +0800<![CDATA[LightOJ1005---Rooks(简单组合数学)]]>https://blog.csdn.net/Guard_Mine/article/details/46351445https://blog.csdn.net/Guard_Mine/article/details/46351445Guard_MineWed, 03 Jun 2015 21:10:37 +0800<![CDATA[LightOJ1003---Drunk(拓扑排序判环)]]>https://blog.csdn.net/Guard_Mine/article/details/46341927https://blog.csdn.net/Guard_Mine/article/details/46341927Guard_MineWed, 03 Jun 2015 10:38:57 +0800<![CDATA[LightOJ1002---Country Roads (最短路变形)]]>https://blog.csdn.net/Guard_Mine/article/details/46334657https://blog.csdn.net/Guard_Mine/article/details/46334657Guard_MineTue, 02 Jun 2015 20:27:40 +0800<![CDATA[hdu2227---Find the nondecreasing subsequences(dp+树状数组)]]>https://blog.csdn.net/Guard_Mine/article/details/46333689https://blog.csdn.net/Guard_Mine/article/details/46333689Guard_MineTue, 02 Jun 2015 18:52:33 +0800