HDOJ
文章平均质量分 79
xxm137164869
一个大学生中的菜鸟
展开
-
HDOJ_1389 Square Coins(母函数) 解题报告
Problem DescriptionPeople in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of all square numbers up to 289 (=17^2), i.e.原创 2010-08-23 19:53:00 · 934 阅读 · 0 评论 -
HDOJ_1160 FatMouse's Speed 解题报告
Problem DescriptionFatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as p原创 2010-08-21 19:46:00 · 1090 阅读 · 0 评论 -
悼念512汶川大地震遇难同胞——老人是真饿了(杭电OJ2187)解题报告
水提,不讲太多,就是最基础的贪心算法代码如下:Code:#include #include #include using namespace std; typedef struct Node { int p; int h; }data; int Comp(const void *p1,const voi原创 2010-08-13 20:40:00 · 2074 阅读 · 0 评论 -
杭电oj 2047 阿牛的EOF牛肉串(递推方法)
Problem Description今年的ACM暑期集训队一共有18人,分为6支队伍。其中有一个叫做EOF的队伍,由04级的阿牛、XC以及05级的COY组成。在共同的集训生活中,大家建立了深厚的友谊,阿牛准备做点什么来纪念这段激情燃烧的岁月,想了一想,阿牛从家里拿来了一块上等的牛肉干,准备在上面刻下一个长度为n的只由"E" "O" "F"三种字符组成的字符串(可以只有其中一种或两种字符,原创 2010-08-18 00:21:00 · 1527 阅读 · 0 评论 -
hdu1425 sort 解题报告
Problem Description给你n个整数,请按从大到小的顺序输出其中前m大的数。 Input每组测试数据有两行,第一行有两个数n,m(0 Output对每组测试数据按从大到小的顺序输出前m大的数。 Sample Input5 3 3 -35 92 213 -644原创 2010-08-19 09:58:00 · 1403 阅读 · 3 评论 -
HDOJ_1050 Moving Tables 解题报告
Problem DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on the north sid原创 2010-08-19 15:47:00 · 1843 阅读 · 1 评论 -
HDOJ_1709 The Balance 解题报告
Problem DescriptionNow you are asked to measure a dose of medicine with a balance and a number of weights. Certainly it is not always achievable. So you should find out the qualities which cannot原创 2010-08-24 10:23:00 · 1093 阅读 · 0 评论 -
HDOJ_1238 Substrings 解题报告
Problem DescriptionYou are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of th原创 2010-08-26 22:06:00 · 1457 阅读 · 0 评论 -
1421 搬寝室 动态规划(DP)
Problem Description搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会很累,因为2*k也不小是一个不大于n的整数.幸运的是xhd根据多年的搬东西的经验发现每搬一次的疲劳度原创 2010-08-22 09:36:00 · 960 阅读 · 0 评论 -
HDOJ_2050 折线分割平面 解题报告
Problem Description我们看到过很多直线分割平面的题目,今天的这个题目稍微有些变化,我们要求的是n条折线分割平面的最大数目。比如,一条折线可以将平面分成两部分,两条折线最多可以将平面分成7部分,具体如下所示。 Input输入数据的第一行是一个整数C,表示测试实例的个数,然后是C 行数据,每行包含一个整数n(0 O原创 2010-08-19 20:08:00 · 1929 阅读 · 0 评论 -
HDOJ_1159 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 e原创 2010-08-21 19:53:00 · 901 阅读 · 0 评论 -
HDOJ__1058 Humble Numbers 解题报告
Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the fir原创 2010-08-24 16:12:00 · 1189 阅读 · 0 评论 -
HDPJ_1171 Big Event in HDU 解题报告
Problem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Softw原创 2010-08-23 19:58:00 · 1914 阅读 · 0 评论 -
Max Sum(杭电OJ1003)解题报告
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 i原创 2010-08-13 21:01:00 · 5982 阅读 · 2 评论