https://blog.youkuaiyun.com/eapinkzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/eapink/article/details/19410295https://blog.youkuaiyun.com/eapink/article/details/19410295eapinkTue, 18 Feb 2014 14:57:17 +0800https://blog.youkuaiyun.com/eapink/article/details/18035367https://blog.youkuaiyun.com/eapink/article/details/18035367eapinkThu, 09 Jan 2014 10:38:11 +0800https://blog.youkuaiyun.com/eapink/article/details/18005257https://blog.youkuaiyun.com/eapink/article/details/18005257eapinkWed, 08 Jan 2014 17:05:35 +0800https://blog.youkuaiyun.com/eapink/article/details/17915585https://blog.youkuaiyun.com/eapink/article/details/17915585eapinkMon, 06 Jan 2014 13:14:19 +0800https://blog.youkuaiyun.com/eapink/article/details/17913813https://blog.youkuaiyun.com/eapink/article/details/17913813eapinkMon, 06 Jan 2014 11:10:54 +0800https://blog.youkuaiyun.com/eapink/article/details/11537811https://blog.youkuaiyun.com/eapink/article/details/11537811eapinkTue, 10 Sep 2013 20:25:49 +0800 infoIds = new ArrayList>(map.entrySet()); //排序前 for (int i = 0; i < infoIds.size(); i++) { ]]>https://blog.youkuaiyun.com/eapink/article/details/11519941https://blog.youkuaiyun.com/eapink/article/details/11519941eapinkTue, 10 Sep 2013 11:05:47 +0800https://blog.youkuaiyun.com/eapink/article/details/11495175https://blog.youkuaiyun.com/eapink/article/details/11495175eapinkMon, 09 Sep 2013 22:37:42 +0800https://blog.youkuaiyun.com/eapink/article/details/11477249https://blog.youkuaiyun.com/eapink/article/details/11477249eapinkMon, 09 Sep 2013 14:41:36 +0800https://blog.youkuaiyun.com/eapink/article/details/11220783https://blog.youkuaiyun.com/eapink/article/details/11220783eapinkFri, 06 Sep 2013 14:51:23 +0800https://blog.youkuaiyun.com/eapink/article/details/11206207https://blog.youkuaiyun.com/eapink/article/details/11206207eapinkFri, 06 Sep 2013 11:42:04 +0800https://blog.youkuaiyun.com/eapink/article/details/11197617https://blog.youkuaiyun.com/eapink/article/details/11197617eapinkFri, 06 Sep 2013 10:30:48 +0800https://blog.youkuaiyun.com/eapink/article/details/10989613https://blog.youkuaiyun.com/eapink/article/details/10989613eapinkTue, 03 Sep 2013 15:31:54 +0800https://blog.youkuaiyun.com/eapink/article/details/6459052https://blog.youkuaiyun.com/eapink/article/details/6459052eapinkWed, 01 Jun 2011 13:11:00 +0800 Factoring Large Numbers
memory limit: 65536KB time limit: 500MS
accept: 17 submit: 48
Description
One of the central idea behind much cryptography is that factoring large numbers is computationally intensive. In this context one ]]>https://blog.youkuaiyun.com/eapink/article/details/6459036https://blog.youkuaiyun.com/eapink/article/details/6459036eapinkWed, 01 Jun 2011 13:04:00 +0800Substitution Cypher
memory limit: 65536KB time limit: 500MS
accept: 19 submit: 32
Description
Substitution cyphers are the simplest of cyphers where the letters of one alphabet are substituted for the letters of another alphabet. ]]>https://blog.youkuaiyun.com/eapink/article/details/6459025https://blog.youkuaiyun.com/eapink/article/details/6459025eapinkWed, 01 Jun 2011 12:59:00 +0800Fibonacci Numbers
memory limit: 65536KB time limit: 500MS
accept: 22 submit: 29
Description
A Fibonacci sequence is calculated by adding the previous two members of the sequence, with the first two members being both 1.
f(1)]]>https://blog.youkuaiyun.com/eapink/article/details/6433458https://blog.youkuaiyun.com/eapink/article/details/6433458eapinkThu, 19 May 2011 23:56:00 +0800zt ACM的算法（觉得很好，有层次感）
OJ上的一些水题(可用来练手和增加自信)
(poj3299,poj2159,poj2739,poj1083,poj2262,poj1503,poj3006,poj2255,poj3094)
初期:
一.基本算法:
     (1)枚举. (poj1753,poj2965)
     (2)贪心(poj1328,poj2109,poj2586)
     (3)递归和分治法. <]]>https://blog.youkuaiyun.com/eapink/article/details/6430911https://blog.youkuaiyun.com/eapink/article/details/6430911eapinkWed, 18 May 2011 23:29:00 +0800Basic
memory limit: 65536KB time limit: 500MS
Description
The programming language Ada has integer constants that look like this: 123, 8#123#, 16#abc#. These constants represent the integers 123, 83 (123 base 8) and 2748 (abc base 16).]]>https://blog.youkuaiyun.com/eapink/article/details/6427601https://blog.youkuaiyun.com/eapink/article/details/6427601eapinkTue, 17 May 2011 18:50:00 +0800DNA Sorting
Description
One measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequence ``DAABEC'', this measure is 5, since D is greater]]>https://blog.youkuaiyun.com/eapink/article/details/6427597https://blog.youkuaiyun.com/eapink/article/details/6427597eapinkTue, 17 May 2011 18:49:00 +0800Biorhythms
Time Limit: 1000MS Memory Limit: 10000K
题目描述：
Description
人生来就有三个生理周期，分别为体力、感情和智力周期，它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天，人会在相应的方面表现出色。例如，智力周期的高峰，人会思维敏捷，精力容易高度集中。因为三个周期的周长不同，所以通常三个周期的高峰不会落在同一天。对于每个人，我们想知道何时三个高峰落在同一天。对于]]>