可笑痴狂 - 博客园

2013年4月29日

摘要： FruitTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2296Accepted Submission(s): 1277Problem Description转眼到了收获的季节，由于有TT的专业指导，Lele获得了大丰收。特别是水果，Lele一共种了N种水果，有苹果，梨子，香蕉，西瓜……不但味道好吃，样子更是好看。于是，很多人们慕名而来，找Lele买水果。甚至连大名鼎鼎的HDU ACM总教头 lcy 也来了。lcy抛出一打百元大钞，" 阅读全文

posted @ 2013-04-29 19:44 可笑痴狂阅读(303) 评论(0) 推荐(0)

HDOJ-2069Coin Change（母函数加强）

摘要： Coin ChangeTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9939Accepted Submission(s): 3343Problem DescriptionSuppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given am 阅读全文

posted @ 2013-04-29 19:02 可笑痴狂阅读(332) 评论(0) 推荐(0)

2013年4月28日

HDOJ-1709 The Balance(母函数)

摘要： The BalanceTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4327Accepted Submission(s): 1739Problem 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 shou 阅读全文

posted @ 2013-04-28 12:29 可笑痴狂阅读(279) 评论(0) 推荐(0)

2013年4月27日

HDOJ-1171 Big Event in HDU（多重背包/母函数）

摘要： Big Event in HDUTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16449Accepted Submission(s): 5809Problem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College h 阅读全文

posted @ 2013-04-27 16:29 可笑痴狂阅读(336) 评论(0) 推荐(0)

HDOJ-1085Holding Bin-Laden Captive!(母函数做法)

摘要： Holding Bin-Laden Captive!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11107Accepted Submission(s): 4985Problem DescriptionWe all know that Bin-Laden is a notorious terrorist, and he has disappeared for a long time. But recently, it is reported 阅读全文

posted @ 2013-04-27 12:58 可笑痴狂阅读(245) 评论(0) 推荐(0)

HDOJ-1028Ignatius and the Princess III---（整数划分的母函数做法）

摘要： Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9077Accepted Submission(s): 6389Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says.& 阅读全文

posted @ 2013-04-27 10:57 可笑痴狂阅读(603) 评论(0) 推荐(0)

HDOJ-1398 Square Coins（母函数）

摘要： Square CoinsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6129Accepted Submission(s): 4135Problem DescriptionPeople in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of al 阅读全文

posted @ 2013-04-27 10:19 可笑痴狂阅读(469) 评论(0) 推荐(0)

2013年4月26日

HDOJ-1509 Windows Message Queue（优先队列）

摘要： Windows Message QueueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2264Accepted Submission(s): 884Problem DescriptionMessage queue is the basic fundamental of windows system. For each process, the system maintains a message queue. If something ha 阅读全文

posted @ 2013-04-26 20:49 可笑痴狂阅读(287) 评论(0) 推荐(0)

NYOJ-3 多边形重心问题

摘要：多边形重心问题时间限制：3000 ms | 内存限制：65535 KB难度：5描述在某个多边形上，取n个点，这n个点顺序给出，按照给出顺序将相邻的点用直线连接，（第一个和最后一个连接），所有线段不和其他线段相交，但是可以重合，可得到一个多边形或一条线段或一个多边形和一个线段的连接后的图形；如果是一条线段,我们定义面积为0，重心坐标为（0,0）.现在求给出的点集组成的图形的面积和重心横纵坐标的和；输入第一行有一个整数0<n<11,表示有n组数据；每组数据第一行有一个整数m<10000,表示有这个多边形有m个顶点；输出输出每个多边形的面积、重心横纵坐标的和，小数点后保留阅读全文

posted @ 2013-04-26 18:56 可笑痴狂阅读(1828) 评论(0) 推荐(0)

HDOJ-2036 改革春风吹满地

摘要：改革春风吹满地Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13613Accepted Submission(s): 6874Problem Description“ 改革春风吹满地,不会AC没关系;实在不行回老家，还有一亩三分地。谢谢!（乐队奏乐）”话说部分学生心态极好，每天就知道游戏，这次考试如此简单的题目，也是云里雾里，而且，还竟然来这么几句打油诗。好呀，老师的责任就是帮你解决问题，既然想种田，那就分你一块。这块田位于浙江省温州市苍南县阅读全文

posted @ 2013-04-26 13:37 可笑痴狂阅读(412) 评论(0) 推荐(0)