ACM题解 - 随笔分类(第8页) - 铁树银花

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 铁树银花阅读(337) 评论(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) 编辑

Logarithms (数学)

摘要：LogarithmsTime Limit:1000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVA 11666DescriptionProblemALogarithmsInput:Standard InputOutput:Standard OutputFrom time immemorial different series has been an integrated part of mathematics. Series is very important for finding values 阅读全文

posted @ 2012-08-20 21:30 铁树银花阅读(284) 评论(0) 推荐(0) 编辑

取石子游戏（威佐夫博奕）

摘要：取石子游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2009Accepted Submission(s): 950Problem Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目，如果轮到你先取，假设双方都采取最好的策略，问最后你是胜者还是阅读全文

posted @ 2012-08-19 20:35 铁树银花阅读(349) 评论(0) 推荐(0) 编辑

What Are You Talking About（字典树）

摘要：What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 7547Accepted Submission(s): 2335Problem DescriptionIgnatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian 阅读全文

posted @ 2012-08-15 11:31 铁树银花阅读(503) 评论(0) 推荐(0) 编辑

<cf>Solitaire(DFS or DP)

摘要：B. Solitairetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA boy named Vasya wants to play an old Russian solitaire called "Accordion". In this solitaire, the player must observe the following rules:A deck ofncards is carefully shuffle 阅读全文

posted @ 2012-07-29 10:31 铁树银花阅读(311) 评论(0) 推荐(0) 编辑

HDUOJ 2544 最短路

摘要：最短路Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11062Accepted Submission(s): 4709Problem Description在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候，却是非常累的！所以现在他们想要寻找最短的从商店到赛场的路线，你可以帮助他们吗？Input输入包括多组数据。每组数据第一行是两个整数N、M（N<=100，M 阅读全文

posted @ 2012-04-12 18:45 铁树银花阅读(275) 评论(0) 推荐(0) 编辑

HDUOJ 1233 还是畅通工程(最小生成树基础)

摘要：还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12154Accepted Submission(s): 5565Problem Description某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input测试输入包含若干测试用例。每个测试用阅读全文

posted @ 2012-04-06 17:21 铁树银花阅读(209) 评论(0) 推荐(0) 编辑

随笔分类 - ACM题解