ACM题目
文章平均质量分 81
同学少年
没有什么不可能!
展开
-
[ACM]Shopping
题目描述Saya and Kudo go shopping together.You can assume the street as a straight line, while the shops are some points on the line.They park their car at the leftmost shop, visit all the s原创 2013-05-21 14:54:05 · 1853 阅读 · 0 评论 -
[ACM]Function Run Fun
Problem DescriptionWe all love recursion! Don't we?Consider a three-parameter recursive function w(a, b, c):if a 1if a > 20 or b > 20 or c > 20, then w(a, b, c) returns:w(20, 20, 2原创 2013-05-21 14:37:39 · 1927 阅读 · 0 评论 -
[ACM]A + B Problem (大数相加3种方法)
Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. InputThe first line of the input contains an integer原创 2013-05-22 22:00:00 · 2703 阅读 · 0 评论 -
[ACM]Identifiers
题目描述 Identifier is an important concept in the C programming language. Identifiers provide names for several language elements, such as functions, variables, labels, etc.An identifier is a sequenc原创 2013-05-26 12:16:19 · 1641 阅读 · 0 评论 -
[ACM]n a^o7 !
题目描述All brave and intelligent fighters, next you will step into a distinctive battleground which is full of sweet and happiness. If you want to win the battle, you must do warm-up according to m原创 2013-06-01 20:30:05 · 1881 阅读 · 0 评论 -
[ACM]The Best Seat in ACM Contest
题目描述Cainiao is a university student who loves ACM contest very much. It is a festival for him once when he attends ACM Asia Regional Contest because he always can find some famous ACMers there.原创 2013-06-01 20:43:54 · 1487 阅读 · 0 评论 -
[ACM]Common Subsequence
Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there exi原创 2013-06-03 14:29:18 · 1659 阅读 · 0 评论 -
[ACM]Max Sum
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +原创 2013-06-03 20:02:16 · 1735 阅读 · 0 评论 -
[ACM]躲猫猫
Description calmound一回来就突然离奇失踪了,后来发现原来是偷偷地躲在了妹子群中。你能不能找到他,把他抓回来做题呢?Input 输入包含多组数据,直到文件EOF结束。每组数据给你一个字符串,字符串长度Output 如果字符串中包含calmound则输出Yes,否则输出NoSample Inputacalmounddasddac原创 2013-06-17 22:19:18 · 2262 阅读 · 4 评论 -
[ACM]括号配对问题
Description现在有一种只包括左右小括号(“(”和“)”)和空格(” “)的字符串序列,请你判断括号是否匹配,如果匹配就输出Yes,不匹配输出No。Input输入数据第一行输入一个T(0≤T≤100),表示测试数据的组数。接下来有T行测试数据,每行有一个符合题意的字符串,字符串长度不超过500。Output每组测试数据,先输出一个”Case %d原创 2013-06-17 22:04:46 · 4859 阅读 · 0 评论 -
[ACM]某一天的n天后是几年几月几日
Description 小Q,2012年9月10日步入大学。刚刚步入大学的小Q,依旧怀念着以前的生活,所以他每天都会计算现在离刚刚开学过去了多少天。可是某一天,突发奇想,想问你,给你n天,让你计算2012年9月10日后的n天是几年几月几日,比如n=10,则日期是2012年9月20日。这里你要注意可能会出现闰年的情况Input 第一行一个整数T,表原创 2013-06-17 22:12:21 · 4411 阅读 · 1 评论 -
[ACM]吃糖果
Problem DescriptionHOHO,终于从Speakless手上赢走了所有的糖果,是Gardon吃糖果时有个特殊的癖好,就是不喜欢将一样的糖果放在一起吃,喜欢先吃一种,下一次吃另一种,这样;可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完?请你写个程序帮忙计算一下。Input第一行有一个整数T,接下来T组数据,每组数据占2行,第一行是一原创 2013-09-01 13:14:49 · 2320 阅读 · 0 评论 -
[ACM]18岁生日
Problem DescriptionGardon的18岁生日就要到了,他当然很开心,可是他突然想到一个问题,是不是每个人从出生开始,到达18岁生日时所经过的天数都是一样的呢?似乎并不全都是这样,所以他想请你帮忙计算一下他和他的几个朋友从出生到达18岁生日所经过的总天数,让他好来比较一下。Input一个数T,后面T行每行有一个日期,格式是YYYY-MM-DD。如我的生日原创 2013-09-01 13:34:33 · 2013 阅读 · 0 评论 -
[ACM]Let the Balloon Rise
Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest原创 2013-09-01 12:28:48 · 1708 阅读 · 0 评论 -
[ACM]Elevator
Problem 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 floors the elevator will stop, in specifie原创 2013-09-01 12:55:37 · 2321 阅读 · 0 评论 -
[ACM]u Calculate e
Problem DescriptionA simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.原创 2013-09-01 13:04:59 · 1594 阅读 · 0 评论 -
[ACM]Number Sequence
Problem 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 calculate the value of f(n).In原创 2013-09-01 12:48:11 · 1913 阅读 · 1 评论 -
[ACM]敌兵布阵
Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动,可能增加或减少若干人手,但这些都逃不过C国的监视原创 2013-09-09 18:05:35 · 1900 阅读 · 2 评论 -
[ACM]A Mathematical Curiosity
Problem DescriptionGiven two integers n and m, count the number of pairs of integers (a,b) such that 0 This problem contains multiple test cases!The first line of a multiple input is an in原创 2013-09-09 17:22:15 · 1763 阅读 · 0 评论 -
[ACM]The 3n + 1 problem
Problem DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property原创 2013-09-09 17:41:30 · 1996 阅读 · 0 评论 -
[ACM]今年暑假不AC(贪心)
Problem Description“今年暑假不AC?”“是的。”“那你干什么呢?”“看世界杯呀,笨蛋!”“@#$%^&*%...”确实如此,世界杯来了,球迷的节日也来了,估计很多ACMer也会抛开电脑,奔向电视了。作为球迷,一定想看尽量多的完整的比赛,当然,作为新时代的好青年,你一定还会看一些其它的节目,比如新闻联播(永远不要忘记关心国家大事)、非常6+7、原创 2013-10-15 08:30:13 · 1858 阅读 · 0 评论 -
[ACM]Flyer(长春网络赛1010)
FlyerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1140 Accepted Submission(s): 397Problem DescriptionThe new semester begins原创 2013-10-15 12:22:20 · 1976 阅读 · 0 评论 -
[ACM]人见人爱A^B
Problem Description求A^B的最后三位数表示的整数。说明:A^B的含义是“A的B次方” Input输入数据包含多个测试实例,每个实例占一行,由两个正整数A和B组成(1 Output对于每个测试实例,请输出A^B的最后三位表示的整数,每个输出占一行。 Sample Input2原创 2013-05-21 15:07:03 · 3412 阅读 · 2 评论 -
[ACM - 数论]Wolf and Rabbit
Wolf and Rabbit Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 7 Accepted Submission(s) : 5Font: Times New Roman | Verdana | GeorgiaF原创 2013-11-16 13:17:07 · 1543 阅读 · 0 评论 -
[ACM]Common Subsequence
Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18605 Accepted Submission(s): 7875Problem DescriptionA subs原创 2013-11-02 19:35:33 · 2381 阅读 · 0 评论 -
[ACM]最少拦截系统
最少拦截系统Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 75 Accepted Submission(s) : 27Font: Times New Roman | Verdana | GeorgiaFon原创 2013-11-02 19:51:38 · 3310 阅读 · 0 评论 -
[ACM - 数论]最简单的计算机
最简单的计算机Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 10 Accepted Submission(s) : 7Font: Times New Roman | Verdana | GeorgiaFon原创 2013-11-09 19:01:30 · 1702 阅读 · 0 评论 -
[ACM - 数论]Eddy's digital Roots(九余数定理)
Eddy's digital RootsTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 11 Accepted Submission(s) : 7Font: Times New Roman | Verdana | G原创 2013-11-09 19:29:29 · 2784 阅读 · 0 评论 -
[ACM - 数论]A hard puzzle
A hard puzzleTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 25 Accepted Submission(s) : 7Font: Times New Roman | Verdana | Georgia原创 2013-11-09 19:16:56 · 1626 阅读 · 0 评论 -
[ACM - 数论]Perfection
PerfectionTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 11 Accepted Submission(s) : 6Font: Times New Roman | Verdana | Georgia原创 2013-11-09 19:39:13 · 1826 阅读 · 0 评论 -
[ACM - 动规]数塔
Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的:有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少?已经告诉你了,这是个DP的题目,你能AC吗?Input输入数据首先包括一个整数C,表示测试实例的个数,每个测试实例的第一行是一个整数N(1 Ou原创 2013-11-24 19:08:22 · 1642 阅读 · 0 评论 -
[ACM - 深度优先搜索]Oil Deposits
Problem Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and create原创 2013-11-27 09:22:55 · 2961 阅读 · 0 评论 -
[ACM - 博弈]Rabbit and Grass(hdu1849) Brave Game(hdu1846)
Rabbit and GrassTime Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 2Font: Times New Roman | Verdana | Georgi原创 2013-12-08 16:58:17 · 1655 阅读 · 0 评论 -
[ACM] POJ 1852 Ants
AntsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7498 Accepted: 3457DescriptionAn army of ants walk on a horizontal pole of length l cm, each wit原创 2014-01-12 20:18:55 · 1706 阅读 · 0 评论 -
[ACM - 图论]还是畅通工程(最小生成树+并查集)
Problem Description某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 当原创 2013-11-18 15:04:19 · 4496 阅读 · 0 评论 -
[ACM] hud 还是畅通工程(重写)
还是畅通工程Problem Description某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input测试输入包含若干测试用例。每个测试用例的第1原创 2014-02-01 22:00:11 · 1769 阅读 · 0 评论 -
[ACM] hdu 1201 18岁生日
18岁生日 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 14 Accepted Submission(s) : 6Font: Times New Roman | Verdana | Georgia Font Size:原创 2014-03-08 18:40:25 · 1203 阅读 · 0 评论 -
[ACM] hdu 2025查找最大元素(水题)
Problem Description对于输入的每个字符串,查找其中的最大字母,在该字母后面插入字符串“(max)”。Input输入数据包括多个测试实例,每个实例由一行长度不超过100的字符串组成,字符串仅由大小写字母构成。Output对于每个测试实例输出一行字符串,输出的结果是插入字符串“(max)”后的结果,如果存在多个最大的字母,就在每一个最大字母后面都插入"(m原创 2014-02-24 15:56:13 · 1856 阅读 · 0 评论 -
[ACM] hdu 1022 Train Problem I(栈的使用)
Problem 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 the trains in the Ignatius Train Station is t原创 2014-02-24 15:46:52 · 1104 阅读 · 0 评论 -
[2010山东ACM省赛] Greatest Number(数的组合+二分搜索)
Greatest NumberTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Saya likes math, because she think math can make her cleverer.One day, Kudo invited a very simple game:Giv原创 2014-04-13 16:01:01 · 2281 阅读 · 0 评论