2012年8月24日

The Great Team（好题）

摘要： The Great TeamTime Limit:500MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1779DescriptionWhen a few students of the Ural State University finished their sport career, the university encountered a lot of problems in team composition. Veterans of sports programming de 阅读全文

posted @ 2012-08-24 21:40 铁树银花 阅读(179) 评论(0) 推荐(0) 编辑

Anindilyakwa（简单）

摘要： AnindilyakwaTime Limit:500MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1777DescriptionThe language of Australian aborigines anindilyakwa has no numerals. No anindilyakwa can say: “I've hooked eight fishes”. Instead, he says: “I've hooked as many fishes as m 阅读全文

posted @ 2012-08-24 16:51 铁树银花 阅读(252) 评论(0) 推荐(0) 编辑

ACMer（数学，有意思）

摘要： ACMerTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2634Accepted Submission(s): 1190Problem DescriptionThere are at least P% and at most Q% students of HDU are ACMers, now I want to know how many students HDU have at least?InputThe input contains 阅读全文

posted @ 2012-08-24 11:56 铁树银花 阅读(344) 评论(0) 推荐(0) 编辑

{A} + {B}

摘要： {A} + {B}Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7266Accepted Submission(s): 2948Problem Description给你两个集合，要求{A} + {B}.注:同一个集合中不会有两个相同的元素.Input每组输入数据分为三行,第一行有两个数字n,m(0<n,m<=10000),分别表示集合A和集合B的元素个数.后两行分别表示集合A和集合B.每个元素为不超出int范围的整数,每个元素 阅读全文

posted @ 2012-08-24 10:28 铁树银花 阅读(246) 评论(0) 推荐(0) 编辑

导航