摘要： SafecrackerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3713Accepted Submission(s): 1919Problem Description=== Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. Kle 阅读全文

摘要： 本文根据经典的TC教程完善和改编。TopCoder：http://www.topcoder.com/基本规则TopCoder的比赛类型很多，最常见的是周赛SRM（Single Round Match），另外还有TCHS SRM（TopCoder High School SRM，题目和SRM一样，仅限中学生参加，参赛者水平较低，据说涨rating很容易），马拉松（Marathon Matchs），还有TCOpen（每年两次的大比赛）之类的比赛。因为大多数人都在做SRM，所以本文介绍的TC比赛即为SRM。SRM的规则总结起来就是一句话：75分钟做完3道难度递增的题。TC的每个用户（handle）都 阅读全文

摘要： Train Problem ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9012Accepted Submission(s): 3310Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because 阅读全文

摘要： 还是A+BTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9799Accepted Submission(s): 4814Problem Description读入两个小于10000的正整数A和B，计算A+B。需要注意的是：如果A和B的末尾K（不超过8）位数字相同，请直接输出-1。Input测试输入包含若干测试用例，每个测试用例占一行，格式为"A B K"，相邻两数字有一个空格间隔。当A和B同时为0时输入结束，相应的结果不要 阅读全文

摘要： A + BTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7615Accepted Submission(s): 4307Problem Description读入两个小于100的正整数A和B,计算A+B.需要注意的是:A和B的每一位数字由对应的英文单词给出.Input测试输入包含若干测试用例,每个测试用例占一行,格式为"A + B =",相邻两字符串有一个空格间隔.当A和B同时为0时输入结束,相应的结果不要输出.Outpu 阅读全文

摘要： Starship TroopersTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4118Accepted Submission(s): 1076Problem DescriptionYou, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge 阅读全文

摘要： http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=1176水了一道比较有意思的题目。其实就是给了很多的数。问最多可以搭配出多少种三个不同的数的组合，并且输出。第1行，包含一个整数n(1≤n≤100000) — 雪球的数量。第2行，包含n个整数 — 雪球的半径r1, r2, ..., rn (1≤ri≤1000000000)给的数比较多，也比较大，所以用map 来存。map 来记录个数。然后用优先队列。把各个数的个数入队列。先取个数最多的三个数，个数减一后要再入队。直到队列为空。map 阅读全文

摘要： FatMouse' TradeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20968Accepted Submission(s): 6501Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBea 阅读全文

摘要： 题目很明显，答案就是最小点对距离的一半。最小点对的算法就是分治，把所以点分成两部分，然后合起来，重点是怎么样合起来。算法思想不再赘述，记得有很多资料说这个的。大致思想就是按照x坐标排序，分成左右两部分，求左半部分的最小距离，右半部分的最小距离，d=min(d1,d2)。还有就是分界线两侧小于d的点的距离可能是最小点对。代码如下：（套用的是吉林大学的模板，套用模板果然容易出错，一不小心就打错，多理解）#include<stdio.h>#include<iostream>#include<stdlib.h>#include<string.h>#inc 阅读全文

摘要： E. Phone Talkstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputCool J has recently become a businessman Mr. Jackson, and he has to make a lot of phone calls now. Today he has n calls planned. For each call we know the moment ti (in seconds since t 阅读全文