搜索
文章平均质量分 84
Misdom_Tian_Ya
这个作者很懒,什么都没留下…
展开
-
poj 3620 Avoid The Lakes
DescriptionFarmer John's farm was flooded in the most recent storm, a fact only aggravated by the information that his cows are deathly afraid of water. His insurance agency will only repay him, h原创 2014-09-13 21:08:24 · 637 阅读 · 0 评论 -
POJ 1753 Flip Game (BFS)
DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying原创 2015-08-20 19:45:26 · 394 阅读 · 0 评论 -
HDU 1026 Ignatius and the Princess I (BFS)
Problem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166's castle. The castle is a large labyrint原创 2015-08-21 11:28:44 · 360 阅读 · 0 评论 -
ZOJ 3816 Generalized Palindromic Number (DFS,暴力枚举)
A number that will be the same when it is written forwards or backwards is known as a palindromic number. For example, 1234321 is a palindromic number.We call a number generalized palindromic numb原创 2015-08-20 14:13:37 · 297 阅读 · 0 评论 -
HDU 4403 A very hard Aoshu problem (DFS)
Problem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for primary school students. Teacher Liu is an Aoshu teacher. H原创 2015-08-19 19:09:27 · 426 阅读 · 0 评论 -
POJ 1321 棋盘问题(DFS)
Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及摆放棋子的数目。 n原创 2015-08-19 14:05:24 · 399 阅读 · 0 评论 -
FZU 1686 神龙的难题 (DLX重复覆盖)
Problem Description这是个剑与魔法的世界.英雄和魔物同在,动荡和安定并存.但总的来说,库尔特王国是个安宁的国家,人民安居乐业,魔物也比较少.但是.总有一些魔物不时会进入城市附近,干扰人民的生活.就要有一些人出来守护居民们不被魔物侵害.魔法使艾米莉就是这样的一个人.她骑着她的坐骑,神龙米格拉一起消灭干扰人类生存的魔物,维护王国的安定.艾米莉希望能够在损伤最小的前提下完成原创 2015-08-24 20:58:03 · 514 阅读 · 0 评论 -
HUST 1017 Exact cover (DLX模板题)
DESCRIPTIONThere is an N*M matrix with only 0s and 1s, (1 INPUTThere are multiply test cases. First line: two integers N, M; The following N lines: Every line first comes an integer C(1 OUTPUT原创 2015-08-24 15:45:59 · 375 阅读 · 0 评论 -
POJ 3740 Easy Finding (DLX模板)
DescriptionGiven a M×N matrix A. Aij ∈ {0, 1} (0 ≤ i InputThere are multiple cases ended by EOF. Test case up to 500.The first line of input is M, N (M ≤ 16, N ≤ 300). The next M lines every原创 2015-08-24 11:34:08 · 390 阅读 · 0 评论 -
HDU 2295 Radar (二分+DLX,重复覆盖)
Problem DescriptionN cities of the Java Kingdom need to be covered by radars for being in a state of war. Since the kingdom has M radar stations but only K operators, we can at most operate K rada原创 2015-08-24 17:08:48 · 419 阅读 · 0 评论 -
ZOJ 3209 Treasure Map (DLX精确覆盖)
Your boss once had got many copies of a treasure map. Unfortunately, all the copies are now broken to many rectangular pieces, and what make it worse, he has lost some of the pieces. Luckily, it is原创 2015-08-22 20:31:12 · 497 阅读 · 0 评论 -
POJ 1088 滑雪 (记忆化搜索)
DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714 2原创 2015-08-22 15:53:34 · 328 阅读 · 0 评论 -
浙大第15届校赛 3361 Valid Pattern Lock (搜索)
Pattern lock security is generally used in Android handsets instead of a password. The pattern lock can be set by joining points on a 3 × 3 matrix in a chosen order. The points of the matrix are regis原创 2015-04-13 16:46:37 · 476 阅读 · 0 评论 -
UVA 10003 Cutting Sticks
You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery, Inc. (ACM), charges money according to the length of the stick being cut. Their procedure of work r原创 2014-10-09 18:46:42 · 381 阅读 · 0 评论 -
FZU 2092 收集水晶 (DFS, 记忆化搜索)
Problem Descriptionshadow来到一片神奇的土地,这片土地上不时会出现一些有价值的水晶,shadow想要收集一些水晶带回去,但是这项任务太繁杂了,于是shadow让自己的影子脱离自己并成为一个助手来帮助自己收集这些水晶。shadow把这片土地划分成n*m个小方格,某些格子会存在一些shadow和他的影子都无法穿越的障碍,比如巨石、树木、野兽等。shadow预先探测到原创 2015-08-22 15:13:04 · 466 阅读 · 0 评论