搬寝室
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15897 Accepted Submission(s): 5389
Problem Description
搬寝室是很累的,xhd深有体会.时间追述2006年...
分类：
其他好文 时间：
2014-05-25 22:46:00
阅读次数：
251
FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 40975 Accepted Submission(s): 13563
Problem Description
FatMouse pre...
分类：
其他好文 时间：
2014-05-25 21:58:33
阅读次数：
400
FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 40975 Accepted Submission(s): 13563
Problem Description
FatMouse pre...
分类：
其他好文 时间：
2014-05-25 21:54:02
阅读次数：
288
LeetCode Problem-- Triangle 路径求最小和
动态规划问题...
分类：
其他好文 时间：
2014-05-25 21:33:33
阅读次数：
246
Assertionsarecrucialduringmaintenanceofaprogram.Trytomakecodesimpleisthekeytowritecorrectcode.Aproblemthatseemsdifficultmayhaveasimple,unexpectedsolution.Sitbackandwaitforaninsightratherthanrushingforwardwiththeirfirstidea.Ifyouthinkyouareright,justproveit.
分类：
其他好文 时间：
2014-05-25 21:07:50
阅读次数：
278
Problem Description
用半径相等的两个圆覆盖一个w*h的矩形，要求两圆不相交且必须在矩形内。求覆盖面积最大时两圆半径。
Input
输入包含多组数据，EOF结束。
每组数据包含一行，分别是两个实数w和h代表矩形的长和宽。
0
Output
每组数据输出一行表示圆的半径，小数点后保留三位。
Sample Input
2.000 1....
分类：
其他好文 时间：
2014-05-25 18:26:55
阅读次数：
266
Problem Description
Some days ago, I learned the concept of LCM (least common multiple). I've played with it for several times and I want to make a big number with it.
But I also don't want to use...
分类：
其他好文 时间：
2014-05-25 16:39:53
阅读次数：
266
http://acdream.info/problem?pid=1093女神的正多面体Time
Limit:2000/1000 MS (Java/Others)Memory Limit:128000/64000 KB
(Java/Others)SubmitStatisticNext ProblemP...
分类：
其他好文 时间：
2014-05-25 12:27:58
阅读次数：
174
Problem Description
Teacher HU and his 40 students were trapped by the brigands. To show their power, the head of the brigands want to select one people to kill.
Teacher HU and his 40 students wil...
分类：
其他好文 时间：
2014-05-25 10:02:35
阅读次数：
309
Problem Description
We have a special convex that all points have the same distance to origin point.
As you know we can get N segments after linking the origin point and the points on the convex. ...
分类：
其他好文 时间：
2014-05-25 06:55:54
阅读次数：
188
