随笔分类 -  简单ACM题

摘要：MysteryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 141 Accepted Submission(s): 75 InputThe first line of input contains a single integer P, (1 <= P <= 1000), which is the number of data sets that follow. Each data set consists of severa 阅读全文

摘要：HDU 4442Physical Examination2012年金华赛区现场赛A题。水题，排序后解决。对于两个 a1,b1 和a2,b2；先1后2：a1+a2+a1*b2先2后1： a1+a2+b1*a2;1排在2前面的条件就是： a1*b2<b1*a2.所以按照这个条件排序，然后出结果就可以了。代码实现主要是要处理，会超出int的，最好用long long,或者乘之前强制转换下。代码：HDU 4442#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h& 阅读全文

摘要：Online JudgeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3389Accepted Submission(s): 1276Problem DescriptionIgnatius is building an Online Judge, now he has worked out all the problems except the Judge System. The system has to read data from co 阅读全文

摘要：Sum of divisorsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 82Accepted Submission(s): 35Problem Descriptionmmm is learning division, she's so proud of herself that she can figure out the sum of all the divisors of numbers no larger than 100 阅读全文

摘要：HuntersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21Accepted Submission(s): 17Problem DescriptionAlice and Bob are the topmost hunters in the forest, so no preys can escape from them. However, they both think that its hunting skill is better t 阅读全文

摘要：80ers' MemoryTime Limit: 1 Second Memory Limit: 32768 KBI guess most of us are so called 80ers, which means that we were born in the 1980's. This group of people shared a lot of common memories. For example, the Saint Seiya, the YoYo ball, the Super Mario, and so on. Do you still remember th 阅读全文

摘要：Max FactorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2238Accepted Submission(s): 684Problem DescriptionTo improve the organization of his farm, Farmer John labels each of his N (1 <= N <= 5,000) cows with a distinct serial number in the 阅读全文

摘要：Intelligent IMETime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 399Accepted Submission(s): 207Problem Description We all use cell phone today. And we must be familiar with the intelligent English input method on the cell phone. To be specific, the . 阅读全文

摘要：Faulty OdometerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 312Accepted Submission(s): 228Problem Description You are given a car odometer which displays the miles traveled as an integer. The odometer has a defect, however: it proceeds from the. 阅读全文

摘要：Integer InquiryTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6755Accepted Submission(s): 1723Problem DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 阅读全文

摘要：Ball bearingsTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40Accepted Submission(s): 20Problem DescriptionThe Swedish company SKF makes ball bearings. As explained by Britannica Online, a ball bearing is “one of the two types of rolling, or anti 阅读全文

摘要：Easier Done Than Said?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3965Accepted Submission(s): 1999Problem DescriptionPassword security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords a 阅读全文

摘要：Biker's Trip OdometerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2098Accepted Submission(s): 1410Problem DescriptionMost bicycle speedometers work by using a Hall Effect sensor fastened to the front fork of the bicycle. A magnet is attached 阅读全文

摘要：EdgeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 886Accepted Submission(s): 576Problem DescriptionFor products that are wrapped in small packings it is necessary that the sheet of paper containing the directions for use is folded until its size 阅读全文

摘要：A sequence of numbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1129Accepted Submission(s): 359Problem DescriptionXinlv wrote some sequences on the paper a long time ago, they might be arithmetic or geometric sequences. The numbers are not ver 阅读全文

摘要：Climbing WormTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7047Accepted Submission(s): 4455Problem DescriptionAn inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minut 阅读全文

摘要：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 阅读全文

摘要：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 阅读全文