ACM（HOJ）题目解题报告 - 随笔分类(第27页) - kuangbin

ACM HDU 1008 Elevator

摘要：ElevatorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16549Accepted Submission(s): 8795Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floor 阅读全文

posted @ 2011-07-27 17:57 kuangbin 阅读(2818) 评论(0) 推荐(0) 编辑

ACM HDU 1010 Tempter of the Bone

摘要：Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23769Accepted Submission(s): 6538Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, a 阅读全文

posted @ 2011-07-27 12:32 kuangbin 阅读(1777) 评论(1) 推荐(2) 编辑

ACM HDU 1005 Number Sequence

摘要：Number SequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41179Accepted Submission(s): 8827Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to 阅读全文

posted @ 2011-07-26 16:35 kuangbin 阅读(4483) 评论(3) 推荐(0) 编辑

ACM HDU 1004 Let the Balloon Rise

摘要：Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30662Accepted Submission(s): 10048Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time 阅读全文

posted @ 2011-07-26 15:04 kuangbin 阅读(2597) 评论(2) 推荐(2) 编辑

ACM HDU1001Sum Problem

摘要：Sum ProblemTime Limit: 1000/500 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 113869Accepted Submission(s): 26069Problem DescriptionHey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.In 阅读全文

posted @ 2011-07-26 14:28 kuangbin 阅读(274) 评论(0) 推荐(0) 编辑

ACM HDU1000A + B Problem

摘要：A + B ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 150787Accepted Submission(s): 47736Problem DescriptionCalculate A + B.InputEach line will contain two integers A and B. Process to end of file.OutputFor each case, output A + B in one lin 阅读全文

posted @ 2011-07-26 14:27 kuangbin 阅读(293) 评论(0) 推荐(0) 编辑

ACM HDU 1068 Girls and Boys

摘要：Girls and BoysTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3019Accepted Submission(s): 1294Problem Descriptionthe second year of the university somebody started a study on the romantic relations between the students. The relation “romantically 阅读全文

posted @ 2011-07-26 13:58 kuangbin 阅读(2073) 评论(0) 推荐(0) 编辑

ACM HDU 1385Minimum Transport Cost

摘要：Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2369Accepted Submission(s): 584Problem DescriptionThese are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is so 阅读全文

posted @ 2011-07-25 22:26 kuangbin 阅读(542) 评论(0) 推荐(1) 编辑

ACM HDU1465 不容易系列之一

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1465不容易系列之一Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6471Accepted Submission(s): 2684Problem Description大家常常感慨，要做好一件事情真的不容易，确实，失败比成功容易多了！做好“一件”事情尚且不易，若想永远成功而总从不失败，那更是难上加难了，就像花钱总是比挣钱容易的道理一样。话虽这样说，我还是要告阅读全文

posted @ 2011-07-24 13:12 kuangbin 阅读(898) 评论(0) 推荐(0) 编辑

ACM HDU1284 钱币兑换问题

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1284钱币兑换问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2064Accepted Submission(s): 1095Problem Description在一个国家仅有1分，2分，3分硬币，将钱N兑换成硬币有很多种兑法。请你编程序计算出共有多少种兑法。Input每行只有一个正整数N，N小于32768。Output对应每个输入，输出兑换方法数。Sa 阅读全文

posted @ 2011-07-24 13:10 kuangbin 阅读(856) 评论(0) 推荐(2) 编辑

ACM HDU2442 ACM(Array Complicated Manipulation)

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=2441ACM(Array Complicated Manipulation)Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 258Accepted Submission(s): 60Problem DescriptionGiven an infinite array of integers 2,3,.... Now do some operations on 阅读全文

posted @ 2011-07-23 23:40 kuangbin 阅读(567) 评论(0) 推荐(1) 编辑

ACM HOJ 2087 剪花布条(简单题)

摘要：剪花布条Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2814Accepted Submission(s): 1881Problem Description一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？Input输入中含有一些数据，分别是成对出现的花布条和小饰条，其布条都是用可见ASCII字符表示的，可见的ASCII字符有多少个，布条的花纹也有多少阅读全文

posted @ 2011-07-23 18:47 kuangbin 阅读(1478) 评论(0) 推荐(1) 编辑

ACM HOJ 1018 Big Number

摘要：Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10639Accepted Submission(s): 4780Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, 阅读全文

posted @ 2011-07-23 18:06 kuangbin 阅读(1228) 评论(0) 推荐(1) 编辑

ACM :HOJ1215 七夕节

摘要：七夕节Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13540Accepted Submission(s): 3831Problem Description七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!"人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下:数字N的因子就是所有比N小又能被N整除的所有正整数,如12的因子有1,2 阅读全文

posted @ 2011-07-23 18:01 kuangbin 阅读(2764) 评论(0) 推荐(0) 编辑

随笔分类 - ACM（HOJ）题目解题报告