杭电
文章平均质量分 71
小鸡炖蘑菇_
stay hungry,stay foolish.
展开
-
POJ 1458/HDU 1159 最长公共子序列 (动态规划)
题目链接:poj && hdu求最长公共子序列的方法:http://blog.csdn.net/qq_21120027/article/details/47732257代码#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>using namespace std;const int M = 10原创 2015-11-28 11:52:45 · 422 阅读 · 0 评论 -
HDU-1114-Piggy-Bank(完全背包)
Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The ide原创 2016-01-05 10:23:12 · 287 阅读 · 0 评论 -
HDU-2191-悼念512汶川大地震遇难同胞——珍惜现在,感恩生活(多重背包)
Problem Description急!灾区的食物依然短缺! 为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大米都是袋装产品,其价格不等,并且只能整袋购买。 请问:你用有限的资金最多能采购多少公斤粮食呢?后记: 人生是一个充满了变数的生命过程,天灾、人祸、病痛是我们生命历程中不可预知的威胁。 月有阴晴圆缺,人有旦夕祸福原创 2016-01-05 10:18:32 · 299 阅读 · 0 评论 -
HDU-2844-Coins
Problem DescriptionWhuacmers use coins.They have coins of value A1,A2,A3…An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a nearb原创 2016-01-05 12:22:06 · 359 阅读 · 0 评论 -
HDU-1712-ACboy needs your help(分组背包)
Problem DescriptionACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arran原创 2016-01-05 15:08:33 · 443 阅读 · 0 评论 -
HDU-3496-Watch The Movie(二维01背包问题)
Problem DescriptionNew semester is coming, and DuoDuo has to go to school tomorrow. She decides to have fun tonight and will be very busy after tonight. She like watch cartoon very much. So she wants h原创 2016-01-05 19:29:00 · 846 阅读 · 0 评论 -
HDU-3466-Proud Merchants(01背包问题)
Problem DescriptionRecently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in this country are still very pro原创 2016-01-05 21:49:45 · 416 阅读 · 0 评论 -
hud-2821-Pusher
Problem DescriptionPusherBoy is an online game http://www.hacker.org/push . There is an R * C grid, and there are piles of blocks on some positions. The goal is to clear the blocks by pushing into them原创 2016-01-22 17:26:03 · 304 阅读 · 0 评论 -
hdu-2094-产生冠军(map&拓扑)
Problem Description有一群人,打乒乓球比赛,两两捉对撕杀,每两个人之间最多打一场比赛。 球赛的规则如下: 如果A打败了B,B又打败了C,而A与C之间没有进行过比赛,那么就认定,A一定能打败C。 如果A打败了B,B又打败了C,而且,C又打败了A,那么A、B、C三者都不可能成为冠军。 根据这个规则,无需循环较量,或许就能确定冠军。你的任务就是面对一群比赛选手,在经过了若干场撕杀原创 2016-01-22 21:42:06 · 403 阅读 · 0 评论 -
hdu-3038-How Many Answers Are Wrong(并查集)
Problem DescriptionTT and FF are … friends. Uh… very very good friends -__-bFF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT s原创 2016-01-22 23:11:40 · 271 阅读 · 0 评论 -
hdu-1069-Monkey and Banana(动态规划)
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 some b原创 2016-01-04 17:11:47 · 748 阅读 · 0 评论 -
HDU-2610 && HDU-2610 (dfs)
Sequence oneProblem DescriptionSearch is important in the acm algorithm. When you want to solve a problem by using the search method, try to cut is very important. Now give you a number sequence, incl原创 2016-01-20 22:08:31 · 366 阅读 · 0 评论 -
hdu-2364-Escape(bfs)
Problem DescriptionYou find yourself trapped in a large rectangular room, made up of large square tiles; some are accessible, others are blocked by obstacles or walls. With a single step, you can move原创 2016-01-17 16:43:11 · 525 阅读 · 0 评论 -
HDU-1252 || ZOJ-1103 || POJ-2415 Hike on a Graph(bfs)
Problem Description“Hike on a Graph” is a game that is played on a board on which an undirected graph is drawn. The graph is complete and has all loops, i.e. for any two locations there is exactly one原创 2016-01-18 10:44:04 · 371 阅读 · 0 评论 -
HDU-1016- Prime Ring Problem
Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note原创 2016-01-18 11:00:47 · 273 阅读 · 0 评论 -
hdu1995--汉诺塔V
linkProblem Description用1,2,…,n表示n个盘子,称为1号盘,2号盘,…。号数大盘子就大。经典的汉诺塔问 题经常作为一个递归的经典例题存在。可能有人并不知道汉诺塔问题的典故。汉诺塔来源于 印度传说的一个故事,上帝创造世界时作了三根金刚石柱子,在一根柱子上从下往上按大小 顺序摞着64片黄金圆盘。上帝命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱 子上。并且规定原创 2015-11-29 17:32:44 · 364 阅读 · 0 评论 -
hdu1396--Counting Triangles
linkProblem DescriptionGiven an equilateral triangle with n the length of its side, program to count how many triangles in it. InputThe length n (n <= 500) of the equilateral triangle’s side, one per原创 2015-11-29 17:21:56 · 637 阅读 · 0 评论 -
hdu-1251-统计难题(字典树)
Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一个提问,每个原创 2015-12-18 09:39:11 · 374 阅读 · 0 评论 -
HDU-1671-Phone List(字典树)
Problem DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers: 1. Emergency 9原创 2015-12-18 10:49:46 · 636 阅读 · 0 评论 -
HDU-1075-What Are You Talking About(字典树&map)
Problem DescriptionIgnatius is so lucky that he met a Martian yesterday. But he didn’t know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves.原创 2015-12-18 19:00:05 · 486 阅读 · 0 评论 -
hdu3466-Proud Merchants
linkProblem DescriptionRecently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in this country are still very原创 2015-12-02 16:31:16 · 531 阅读 · 0 评论 -
hdu-1598-find the most comfortable road( 并查集&贪心)
Problem DescriptionXX星有许多城市,城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure—超级空中漫游结构)进行交流,每条SARS都对行驶在上面的Flycar限制了固定的Speed,同时XX星人对 Flycar的“舒适度”有特殊要求,即乘坐过程中最高速度与最低速度的差越小乘坐越舒服 ,(理解为SARS的限速要求,flycar必须瞬间提速/降速,原创 2016-01-23 09:37:41 · 301 阅读 · 0 评论 -
hdu-1198-Farm Irrigation(并查集)
Problem DescriptionBenny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has a原创 2016-01-23 10:53:27 · 373 阅读 · 0 评论 -
HDU 1116 Play on Words
HDU 1116 Play on Words Problem Description Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other wa原创 2015-08-12 19:54:11 · 427 阅读 · 0 评论 -
hdu-1495-非常可乐(bfs)
Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,原创 2016-01-10 09:44:55 · 372 阅读 · 0 评论 -
hdu-1072-Nightmare(bfs)
Problem DescriptionIgnatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb expl原创 2016-01-10 11:20:19 · 344 阅读 · 0 评论 -
hdu-2795-Billboard(线段树)
Problem DescriptionAt the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcements are原创 2016-01-27 13:04:02 · 262 阅读 · 0 评论 -
hdu-1426-Sudoku Killer(dfs)
Problem Description自从2006年3月10日至11日的首届数独世界锦标赛以后,数独这项游戏越来越受到人们的喜爱和重视。 据说,在2008北京奥运会上,会将数独列为一个单独的项目进行比赛,冠军将有可能获得的一份巨大的奖品———HDU免费七日游外加lcy亲笔签名以及同hdu acm team合影留念的机会。 所以全球人民前仆后继,为了奖品日夜训练茶饭不思。当然也包括初学者linle原创 2016-01-11 09:05:14 · 292 阅读 · 0 评论 -
hdu-1053-Entropy && poj-1521-Entropy (哈夫曼编码)
DescriptionAn entropy encoder is a data encoding method that achieves lossless data compression by encoding a message with “wasted” or “extra” information removed. In other words, entropy encoding remo原创 2016-01-27 23:01:53 · 452 阅读 · 0 评论 -
HDU-3625-Examining the Rooms
Problem DescriptionA murder happened in the hotel. As the best detective in the town, you should examine all the N rooms of the hotel immediately. However, all the doors of the rooms are locked, and th原创 2015-12-27 15:27:56 · 529 阅读 · 0 评论 -
HDU-2138-How many prime numbers(米勒拉宾素数测试)
Problem DescriptionGive you a lot of positive integers, just to find out how many prime numbers there are. InputThere are a lot of cases. In each case, there is an integer N representing the number of原创 2015-12-22 21:04:54 · 415 阅读 · 0 评论 -
Lucas定理---组合数取模
A、B是非负整数,p是质数。AB写成p进制:A=a[n]a[n-1]…a[0],B=b[n]b[n-1]…b[0]。 则组合数C(A,B)与C(a[n],b[n])C(a[n-1],b[n-1])…*C(a[0],b[0]) modp同余 即:Lucas(n,m,p)=c(n%p,m%p)*Lucas(n/p,m/p,p) 然而如果p很大c(n%p,m%p)也是会溢出的,这里要用到m!(n原创 2016-04-14 13:58:35 · 514 阅读 · 3 评论 -
poj-2352 && HDU-1541 --Stars(树状数组)
DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not h原创 2016-01-26 18:54:41 · 330 阅读 · 0 评论 -
HDU-1018-Big Number
Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are giv原创 2015-12-25 14:58:14 · 264 阅读 · 0 评论 -
hdu-1394-Minimum Inversion Number(线段树 || 树状数组)
Problem DescriptionThe inversion number of a given number sequence a1, a2, …, an is the number of pairs (ai, aj) that satisfy i < j and ai > aj. For a given sequence of numbers a1, a2, …, an, if we mo原创 2016-01-25 22:30:18 · 281 阅读 · 0 评论 -
hud3108--Ant Trip
Ant Trip 根据图中顶点的度数来确定欧拉路和欧拉回路。 题目要求的是有多少笔画能画完,图不一定是完全连通的,可以利用这一点将图进行“分块”。 如果这个分块中所有顶点的度数均为偶数,可以形成一个欧拉回路,则能有一笔画搞定。 然后是寻找欧拉路,一条欧拉路需要一笔,由欧拉路的性质得。在图中的所有奇度数顶点都是欧拉路产生的。 每两个奇度数结点都会产生一条欧拉路。所以算出图中的所有奇度数结点的原创 2015-12-04 19:51:45 · 441 阅读 · 0 评论 -
hdu-1558-Segment set(计算几何&并查集)
Problem DescriptionA segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of segments in it. The problem is to find the size of some segme原创 2016-01-23 16:03:45 · 515 阅读 · 0 评论 -
HDU1286-找新朋友(欧拉函数)
Problem Description新年快到了,“猪头帮协会”准备搞一个聚会,已经知道现有会员N人,把会员从1到N编号,其中会长的号码是N号,凡是和会长是老朋友的,那么该会员的号码肯定和N有大于1的公约数,否则都是新朋友,现在会长想知道究竟有几个新朋友?请你编程序帮会长计算出来。Input第一行是测试数据的组数CN(Case number,1<CN<10000),接着有CN行正整数N(1<n<32原创 2015-12-22 19:53:22 · 352 阅读 · 0 评论 -
HDU-1060-Leftmost Digit
Problem DescriptionGiven a positive integer N, you should output the leftmost digit of N^N.InputThe input contains several test cases. The first line of the input is a single integer T which is the num原创 2015-12-22 22:05:00 · 318 阅读 · 0 评论 -
HDU-1271-整数对
Problem DescriptionGardon和小希玩了一个游戏,Gardon随便想了一个数A(首位不能为0),把它去掉一个数字以后得到另外一个数B,他把A和B的和N告诉了小希,让小希猜想他原来想的数字。不过为了公平起见,如果小希回答的数虽然不是A,但同样能达到那个条件(去掉其中的一个数字得到B,A和B之和是N),一样算小希胜利。而且小希如果能答出多个符合条件的数字,就可以得到额外的糖果。 所原创 2015-12-23 10:42:49 · 631 阅读 · 0 评论