摘要：
1001 1000 阅读全文
摘要：
Student[] stAry ={ new Student("张三","男",18), new Student("小明","男",18), new Student("丽丽","女",18), new Student("小菊","女",18), new Student("张四","男",18), n 阅读全文
摘要：
Uniform Generator Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25041 Accepted Submission(s): 9 阅读全文
摘要：
N! Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 73503 Accepted Submission(s): 21308 Problem 阅读全文
摘要：
Digital Roots Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 68194 Accepted Submission(s): 21324 阅读全文
摘要：
u Calculate e Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40905 Accepted Submission(s): 18610 阅读全文
摘要：
Starship Troopers Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16467 Accepted Submission(s): 阅读全文
摘要：
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 102587 Accepted Submission(s) 阅读全文
摘要：
FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 63732 Accepted Submission(s): 215 阅读全文
摘要：
Catching Dogs Description Diao Yang keeps many dogs. But today his dogs all run away. Diao Yang has to catch them. To simplify the problem, we assume 阅读全文