kuangbin - 博客园

HDU 1086 You can Solve a Geometry Problem too（水题，判断线段相交）

摘要： You can Solve a Geometry Problem tooTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3077Accepted Submission(s): 1452Problem DescriptionMany geometry（几何）problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this fina 阅读全文

posted @ 2011-11-01 01:12 kuangbin 阅读(1799) 评论(0) 推荐(0)

HDU 1088 Write a simple HTML Browser（水题）

摘要： Write a simple HTML BrowserTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3398Accepted Submission(s): 890Problem DescriptionIf you ever tried to read a html document on a Macintosh, you know how hard it is if no Netscape is installed. Now, who can 阅读全文

posted @ 2011-11-01 00:50 kuangbin 阅读(2116) 评论(0) 推荐(0)

Lottery hdu1099

摘要： LotteryTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1108Accepted Submission(s): 544Problem DescriptionEddy's company publishes a kind of lottery.This set of lottery which are numbered 1 to n, and a set of one of each is required for a prize 阅读全文

posted @ 2011-10-30 01:33 kuangbin 阅读(1140) 评论(0) 推荐(0)

卡特兰数 ACM 数论

摘要：维基百科资料:卡塔兰数卡塔兰数是组合数学中一个常出现在各种计数问题中出现的数列。由以比利时的数学家欧仁·查理·卡塔兰(1814–1894)命名。卡塔兰数的一般项公式为另类递归式： h(n)=((4*n-2)/(n+1))*h(n-1);前几项为（OEIS中的数列A000108）: 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 477638700, 1767263190, 6564120420, 2 阅读全文

posted @ 2011-10-13 22:32 kuangbin 阅读(2025) 评论(0) 推荐(0)

Random Sequence 2011ACM福州赛区网络赛

摘要： Random SequenceTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 202Accepted Submission(s): 124Problem DescriptionThere is a random sequence L whose element are all random numbers either -1 or 1 with the same possibility. Now we define MAVS, the abbr 阅读全文

posted @ 2011-10-13 22:30 kuangbin 阅读(739) 评论(1) 推荐(0)

2011ACM福州网络赛第一题 A Card Game（水题）

摘要： A Card GameTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4Accepted Submission(s): 3Problem DescriptionThere are N cards on the table, whose front side is writen one integer number from 1 to M. We call one card "a type k card" if its num 阅读全文

posted @ 2011-10-07 14:24 kuangbin 阅读(1013) 评论(0) 推荐(0)

HDU 4011 Working in Beijing

摘要： Working in BeijingTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 659Accepted Submission(s): 333Problem DescriptionMr. M is an undergraduate student of FDU. He finds an intern position in Beijing, so that he cannot attend all the college activities 阅读全文

posted @ 2011-10-04 14:34 kuangbin 阅读(632) 评论(0) 推荐(0)

hdu 4018 Parsing URL（水题）

摘要： Parsing URLTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 520Accepted Submission(s): 321Problem DescriptionIn computing, a Uniform Resource Locator or Universal Resource Locator (URL) is a character string that specifies where a known resource is 阅读全文

posted @ 2011-10-04 14:33 kuangbin 阅读(810) 评论(0) 推荐(0)

HDU 4015 Mario and Mushrooms

摘要： Mario and MushroomsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 265Accepted Submission(s): 220Problem DescriptionMario usually relaxes himself by walking along the shady track near the Mushroom Kingdom. The evil King Koopa noticed that and place 阅读全文

posted @ 2011-10-04 14:31 kuangbin 阅读(805) 评论(0) 推荐(1)

HDU 4020 Ads Proposal（排序，暴力）

摘要： Ads ProposalTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1063Accepted Submission(s): 410Problem DescriptionThere are N customers set their M different advertisements on Baidu. Each advertisement is owned by single customer. The ads system of Ba 阅读全文

posted @ 2011-10-04 13:29 kuangbin 阅读(562) 评论(0) 推荐(0)