关闭

CodeForce 811 B Vladik and Complicated Book

题目链接:点击打开链接 B. Vladik and Complicated Book time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Vladik had ...
阅读(356) 评论(0)

CodeForce 416 (Div. 2) A. Vladik and Courtesy

题目链接:点击打开链接 A. Vladik and Courtesy time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output At regula...
阅读(202) 评论(0)

POJ 1328 Radar Installation

Radar Installation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 86974 Accepted: 19482 Description Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in ...
阅读(102) 评论(0)

HDU 4864 Task

Task Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7206 Accepted Submission(s): 1897 Problem Description Today the company has m tasks to complete. The ith task need xi minutes to complete. ...
阅读(177) 评论(0)

HDU 1051 Wooden Sticks

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 21402 Accepted Submission(s): 8636 Problem Description There is a pile of n wooden sticks. The length and weight of each stick are...
阅读(315) 评论(0)

HDU 1050 POJ 1083 Moving Tables

Moving Tables Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 35472 Accepted Submission(s): 11681 Problem Description The famous ACM (Advanced Computer Maker) Company has rented a floor of a b...
阅读(123) 评论(0)

贪心专题

最近做了一套贪心专题,是时候总结一下了,下面附上题目和思路,具体实现附上链接。 题目地址:贪心1 点击打开链接      密码:LDUACM         贪心2点击打开链接     密码:lduacm A题  51nod 1449 题目链接:点击打开链接 1449 砝码称重 题目来源: CodeForces 基准时间限制:1 秒 空间限制:131...
阅读(303) 评论(0)

51nod 1625 夹克爷发红包

51nod 1625 夹克爷发红包 基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 在公司年会上,做为互联网巨头51nod掌门人的夹克老爷当然不会放过任何发红包的机会。 现场有n排m列观众,夹克老爷会为每一名观众送出普通现金红包,每个红包内金额随机。 接下来,夹克老爷又送出最多k组高级红包,每组高级红包会同时给一排或一列的人派发 ,每个高级红包的金额皆为x。 派发高级红包时,普通红包将会强制收回。同时,每个人只能得到一个高级红包。(好小气!) 现在求一种派发...
阅读(310) 评论(0)

HDU 1022 Train Problem I

Train Problem I Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 36011 Accepted Submission(s): 13576 Problem Description As the new term comes, the Ignatius Train Station is very busy nowadays. ...
阅读(106) 评论(0)

codeforce B. Cutting Carrot

Igor the analyst has adopted n little bunnies. As we all know, bunnies love carrots. Thus, Igor has bought a carrot to be shared between his bunnies. Igor wants to treat a...
阅读(307) 评论(0)

codeforce A. Bank Robbery

题目链接:点击打开链接 A robber has attempted to rob a bank but failed to complete his task. However, he had managed to open all the safes. Oleg the bank client loves money (who doesn't), and decides t...
阅读(290) 评论(0)

C. Naming Company

Oleg the client and Igor the analyst are good friends. However, sometimes they argue over little things. Recently, they started a new company, but they are having trouble finding a...
阅读(325) 评论(0)

HDU 1020 Encoding

题目链接:点击打开链接 开始以为这题给出的字符没有顺序,WA几次,又用set写,还是错,最后用最简单的方法写,就这么A到,生活处处充满惊喜。 思路是求出连续相同字符个数,输出个数加字符,1不用输出。 做了这些题之后,慢慢学会了在示例输入时进行操作,这样会使某些题目变得很简单,但也会碰到超时的情况,看人品吧。 代码实现: #include #include #include us...
阅读(149) 评论(0)

HDU 1019 Least Common Multiple

题目链接:点击打开链接 题目要求求n个数的最小公约数,可以依次求出每个数的最大公倍数,然后两数相乘再除以gcd。 开始是数组接受后遍历,莫名其秒WA两次,又放在输入中直接求的,就过了,可能有小细节没处理好。 有用到欧几里得算法。 下面是大神对欧几里得算法以及扩展欧几里得的解释。点击打开链接 代码实现: #include #include #include using name...
阅读(106) 评论(0)

HDU 1017 A Mathematical Curiosity

题目链接:点击打开链接 这真不是一道水题,真的,真的,我WA五次,是因为case后面的那个数,还有,要不停的输入m,n,两层while循环 看好我的分类,这题并不会在水题里面,他一点不水,如果是比赛,提交时间要120分钟左右了。 记录个数的sum=0在第二层循环内,记录个数的在第一层循环内。 还有,格式,最后有空行。 我能怎么样,我也是很绝望啊。 现在看,这题还水吗? #in...
阅读(160) 评论(0)
24条 共2页1 2 下一页 尾页
    个人资料
    • 访问:35759次
    • 积分:1617
    • 等级:
    • 排名:千里之外
    • 原创:129篇
    • 转载:1篇
    • 译文:0篇
    • 评论:13条
    联系方式
    欢迎谈论交流:1245985209
    博客专栏
    最新评论