acm
文章平均质量分 86
martinue
攻城狮
展开
-
hdu 1159 最长公共子序列
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 e原创 2015-05-10 21:15:16 · 517 阅读 · 2 评论 -
hdu1285(图,拓扑排序)
Description有N个比赛队(1 Input输入有若干组,每组中的第一行为二个数N(1 Output给出一个符合要求的排名。输出时队伍号之间有空格,最后一名后面没有空格。 其他说明:符合条件的排名可能不是唯一的,此时要求输出时编号小的队伍在前;输入数据保证是正确的,即输入数据确保一定能有一个符合要求的排名原创 2015-08-18 19:01:48 · 509 阅读 · 0 评论 -
hdu1466(dp)
Problem Description平面上有n条直线,且无三线共点,问这些直线能有多少种不同交点数。比如,如果n=2,则可能的交点数量为0(平行)或者1(不平行)。 Input输入数据包含多个测试实例,每个测试实例占一行,每行包含一个正整数n(n Output每个测试实例对应一行输出,从小到大列出所有相交方案,其中每个数为可原创 2015-09-07 20:59:42 · 464 阅读 · 0 评论 -
hdu1003(简单dp)
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原创 2015-08-30 19:20:20 · 593 阅读 · 0 评论 -
cf(数学思维题)
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.Also Pasha has a number k and two sequences of leng原创 2015-11-09 14:03:34 · 1170 阅读 · 0 评论 -
hdu1422(简单dp)
Problem Description世界杯结束了,意大利人连本带利的收回了法国人6年前欠他们的债,捧起了大力神杯,成就了4星意大利.世界杯虽然结束了,但是这界世界杯给我们还是留下许多值得回忆的东西.比如我们听到了黄名嘴的3分钟激情解说,我们懂得了原来可以向同一个人出示3张黄牌,我们还看到了齐达内的头不仅能顶球还能顶人…………介于有这么多的精彩,xhd决定重温德国世界杯,当然只是去原创 2015-10-28 14:48:30 · 927 阅读 · 0 评论 -
hdu1244(dp)
Problem Description给定一个由n个正整数组成的整数序列a1 a2 a3 ... an求按先后次序在其中取m段长度分别为l1、l2、l3...lm的不交叠的连续整数的和的最大值。 Input第一行是一个整数n(0 ≤ n ≤ 1000),n = 0表示输入结束第二行的第一个数是m(1 ≤ m ≤ 20),第二行接下来有原创 2015-10-28 13:41:19 · 706 阅读 · 0 评论 -
cf(思维题)
B. Rebrandingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe name of one small but proud corporation c原创 2015-10-30 14:22:51 · 1040 阅读 · 0 评论 -
hdu1690(最短路floyd)
Problem DescriptionBecause of the huge population of China, public transportation is very important. Bus is an important transportation method in traditional public transportation system. And it’s原创 2015-10-15 19:59:14 · 389 阅读 · 0 评论 -
hdu 1208(记忆化搜索)
Problem DescriptionAn n x n game board is populated with integers, one nonnegative integer per square. The goal is to travel along any legitimate path from the upper left corner to the lower right原创 2015-05-10 21:21:34 · 529 阅读 · 0 评论 -
hdu1078 (记忆化搜索)
Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At e原创 2015-05-01 00:07:51 · 776 阅读 · 0 评论 -
hdu1421(纯dp)
Problem Description搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会很累,因为2*k也不小是一个不大于n的整数.幸运的是xhd根据多年的搬东西的经验发现每搬一次的疲劳度原创 2015-10-21 17:59:57 · 363 阅读 · 0 评论 -
cf(405A,B,C,D)
A. Gravity Fliptime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Chris is bored during his physics les原创 2015-11-14 18:30:38 · 668 阅读 · 0 评论 -
cf(思维,数学)
B. Duff in Lovetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuff is in love with lovely numbers! A posi原创 2015-10-31 16:04:27 · 466 阅读 · 0 评论 -
hdu 1165(找规律)
Problem DescriptionAs is known, Ackermann function plays an important role in the sphere of theoretical computer science. However, in the other hand, the dramatic fast increasing pace of the funct原创 2015-05-10 22:33:59 · 556 阅读 · 0 评论 -
hdu 1069 (最长上升子序列)
Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with s原创 2015-05-01 00:23:04 · 364 阅读 · 0 评论 -
hdu1025 (最长上升子序列n*logn)
Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of these cities are rich in resource (we call them ri原创 2015-04-27 21:11:12 · 600 阅读 · 0 评论 -
409(A,C,D)
A. The Great Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo teams meet in The Game World Champions原创 2015-11-24 13:59:19 · 500 阅读 · 0 评论 -
c407(A,B)408(A,B)
A. Triangletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is a right triangle with legs of length a原创 2015-11-16 18:56:15 · 629 阅读 · 0 评论 -
cf(412A,B,C)
A. Postertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe R1 company has recently bought a high rise bui原创 2015-11-26 20:31:49 · 650 阅读 · 0 评论 -
cf411(A,B,C)
A. Password Checktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have probably registered on Internet s原创 2015-11-24 17:57:54 · 410 阅读 · 0 评论 -
cf424(A,B,C)
A. Squatstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPasha has many hamsters and he makes them work out原创 2015-11-18 20:53:29 · 825 阅读 · 0 评论 -
cf(413A,B,C)
A. Data Recoverytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNot so long ago company R2 bought company R原创 2015-11-28 16:59:49 · 650 阅读 · 0 评论 -
BestCoder Round #64 (div.2)
第一次做出来第三题表示弱有点小兴奋!Numbers Accepts: 556 Submissions: 1486 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述给一个数N,如果N是2、3或者5的倍数,输出"Y原创 2015-11-28 20:49:14 · 489 阅读 · 0 评论 -
cf414(A)
A. Mashmokh and Numberstime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputIt's holiday. Mashmokh and his b原创 2015-11-30 20:43:33 · 402 阅读 · 0 评论 -
cf(415 A,B)
A. Mashmokh and Lightstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMashmokh works in a factory. At the e原创 2015-11-17 18:00:19 · 397 阅读 · 0 评论 -
cf(416 A,B,C,E)
A. Guess a number!time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA TV show called "Guess a number!" is gat原创 2015-11-18 20:03:42 · 911 阅读 · 0 评论 -
cf(417A,B,C)
A. Eliminationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe finalists of the "Russian Code Cup" compe原创 2015-12-05 17:09:30 · 732 阅读 · 0 评论 -
cf(420A)
A. Start Uptime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, a start up by two students of a state原创 2015-12-07 19:30:47 · 459 阅读 · 0 评论 -
二分第二弹
description 我们都知道,ACM比赛的排名认定是解题数目,和解题所需的总时间。现在,你们正在准备打一场比赛,已知题目总数n和每道题的难度a[i],(1 ps:ceil()表示向上取整 input 输入多组数据,每组数据第一行是一个整数n,(n output 对每组数据的每次询问,输出你所需的解题能力值x原创 2015-02-09 22:09:13 · 432 阅读 · 0 评论 -
二分~~
description给出一组0~100的实数(小数点后保留两位),表示学生成绩,学生个数不超过100000,求成绩位于区间[s1, s2]的学生人数k。input输入第一行是一个整数n,表示学生个数;接下来一行输入n个数表示n个学生的成绩;接下来输入多组数据,每组输入两个数s1, s2,输入占一行。(0<=s1 <原创 2015-02-09 21:38:03 · 609 阅读 · 0 评论 -
cf(贪心)
A. Duff and Meattime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuff is addicted to meat! Malek wants to ke原创 2015-10-31 15:40:25 · 438 阅读 · 0 评论 -
修理牛棚(贪心)
description 这是一个月黑风高的晚上, 狂风把小韩的牛棚摧毁了. 但幸运的是,有些牛在休假,所以牛棚不是满的。牛棚是一排的。 有的牛棚里有牛,有的没有。所有的牛棚都是相同的宽度(为一个单位)。现在小韩要最快的修理牛棚的门,需要弄些木板来封住出口,以免牛跑出去。木材提供商可以提供给他各种宽度的木板, 但是数量有限。 小韩没多少钱,希望把购买木板的钱尽量省一点,也原创 2015-02-16 21:48:18 · 2718 阅读 · 0 评论 -
数学题
description由于参加数学考试时你没有选对幸运楼层,数学肯定是挂了,现在你开始为开学前补考做准备。 现在你遇到了一个数学题,对于下面的这个方程,你要求出x(0 < x < 10^9)的所有整数解 x=b*S(x)^a+c 其中a,b,c是给定的值,函数S(x)求得是整数x上的所有数字之和。 现在,需要你来解决这道题。原创 2015-02-26 10:25:21 · 395 阅读 · 0 评论 -
素数问题
description现在给你一个正整数n(n<=10000),问你有多少组(p1,p2,p3)满足p1<=p2<=p3,p1,p2,p3都是素数,且p1+p2+p3=ninput输入只有一行,为n(n<=10000)output输出也只有一行,即所问有多少组(p原创 2015-02-27 00:09:13 · 587 阅读 · 0 评论 -
预测比赛
description现在有小胡,小孙,小苗三支足球队,他们总共会进行n场足球比赛,现在已经踢完k场比赛。你是一个足球迷,但是你错过了这k场比赛,所以你不知道这k场比赛的输赢。但是你朋友告诉你小胡和小孙的胜场局数差的绝对值为d1,小孙和小苗的胜场局数差的绝对值为d2。现在请问你,在进行完这n场比赛后,这三支足球队是否能有相同的胜场局数?由于你朋友不是acmer,对于数据原创 2015-02-27 00:11:00 · 829 阅读 · 0 评论 -
GPA
description我们都知道加权平均成绩是AVERAGE SCORE = ∑(Wi * SCORE[i]) / ∑(Wi) , 1<=i<=N这么算的,那么假如现在每门课的学分都为1,AVERAGE SCORE =∑(SCORE[i]) / N , 1<=i<=N。另外,SCORE[i]在60到100之间。在NEFU,除了加权平均成绩,我们还用绩原创 2015-02-27 00:20:40 · 654 阅读 · 0 评论 -
hdu3833(暴力)
YY's new problemTime Limit: 12000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5384 Accepted Submission(s): 1508Problem DescriptionGiven a原创 2016-03-12 17:23:40 · 522 阅读 · 0 评论 -
线段相交
description课件中屌丝学长关于线段相交可是讲的很清楚很彻底了,这道线段相交的水题就当做是下道题的铺垫吧。input输入数据有多组,每组第一行有一个整数n,表示测试实例的数目,接下来有n行,每行8个数,分别表示2条线段的起点和终点:线段1:(x1,y1)(x2,y2)线段2: (x3,y3) (x4,y4)n=0表原创 2015-03-02 09:08:55 · 521 阅读 · 0 评论 -
hdu4310(贪心)
DescriptionWhen playing DotA with god-like rivals and pig-like team members, you have to face an embarrassing situation: All your teammates are killed, and you have to fight 1vN. There are two原创 2016-03-19 16:54:15 · 576 阅读 · 0 评论