上一页 1 ··· 80 81 82 83 84 85 86 87 88 ··· 96 下一页
摘要: N! Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 73503 Accepted Submission(s): 21308 Problem 阅读全文
posted @ 2016-05-21 10:58 超级学渣渣 阅读(259) 评论(0) 推荐(0) 编辑
摘要: Digital Roots Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 68194 Accepted Submission(s): 21324 阅读全文
posted @ 2016-05-21 09:55 超级学渣渣 阅读(153) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2016-05-21 09:30 超级学渣渣 阅读(160) 评论(0) 推荐(0) 编辑
摘要: Starship Troopers Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16467 Accepted Submission(s): 阅读全文
posted @ 2016-05-20 22:13 超级学渣渣 阅读(129) 评论(0) 推荐(0) 编辑
摘要: 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) 阅读全文
posted @ 2016-05-19 11:11 超级学渣渣 阅读(149) 评论(0) 推荐(0) 编辑
摘要: FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 63732 Accepted Submission(s): 215 阅读全文
posted @ 2016-05-18 21:53 超级学渣渣 阅读(201) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2016-05-15 21:22 超级学渣渣 阅读(244) 评论(0) 推荐(0) 编辑
摘要: struct Node { long long a; long long b; long long c; long long num; int i; bool operator < (const Node& t)const { return ((num>t.num)|| (num==t.num&&a 阅读全文
posted @ 2016-05-15 21:03 超级学渣渣 阅读(1005) 评论(0) 推荐(0) 编辑
摘要: Problem C: The Same Color Description Diao Yang has many balls with different colors. Today he wants to divide his balls into two groups. But he does 阅读全文
posted @ 2016-05-15 20:54 超级学渣渣 阅读(218) 评论(0) 推荐(0) 编辑
摘要: Array C Description Giving two integers and and two arrays and both with length , you should construct an array also with length which satisfied: 1.0≤ 阅读全文
posted @ 2016-05-15 20:52 超级学渣渣 阅读(303) 评论(0) 推荐(0) 编辑
上一页 1 ··· 80 81 82 83 84 85 86 87 88 ··· 96 下一页