loving coding

题目描述: 神秘的海洋，惊险的探险之路，打捞海底宝藏，激烈的海战，海盗劫富等等。加勒比海盗，你知道吧？杰克船长驾驶着自己的的战船黑珍珠1号要征服各个海岛的海盜，最后成为海盗王。 ...

题意：给定一个n*m的矩阵,'#'表示不能通过，每个方格只能走过一次且下一步只能走上下左右四个方向，问，能够组成最大连续的数字为多大？思路：最优性剪枝即当前所搜索到的结点的后续最优情况也不比当前最优情况好，就停止对当前结点的搜索，回溯到其父亲结点，搜索其它情况。这里用到了两个剪枝，一个是当前已搜索到的数字长度+后续能搜索到的数字长度小于最优值时，直接剪枝；另一个是长度相等时，判断字典序大小，前者较...

题意：给定n，s,k,分别表示树有n个结点，服务器位于s结点，只要客服端（叶节点为客户端）不超过服务器k距离，则都可以覆盖，问最少需要布置多少个服务器能够覆盖全部客户端思路：1：将无根树转为有根树，并将每层的叶节点关系保存          2：从第n-1个叶结点开始查找它的k级祖先，放置服务器在k级祖先处，并将距离k级祖先小于k距离的所有叶节点覆盖（方便下一次查找跳过）结：第一次用c++的vec...

On Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played on an ice game board on which a square mesh is mark

Children of the Candy CornTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14452 Accepted: 6233DescriptionThe cornfield maze is a popular H

A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 47516 Accepted: 16161DescriptionBackground The knight is getting bored

EscapeTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1182    Accepted Submission(s): 500Problem DescriptionYou find yourself trappe

The Pilots Brothers' refrigeratorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 27522 Accepted: 10625 Special JudgeDescriptionThe

Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 47766 Accepted: 20383DescriptionFlip game is played on a rectangular 4x4 field wi

#include#include#includeusing namespace std;#define N 210#define inf 0x3f3f3f3fchar map[N][N];int book[N][N],m,n,si,sj,ans;struct node{ int x,y,time;}q[N*N];int cmp(struct node a,stru

Problem Description穿过幽谷意味着离大魔王lemon已经无限接近了！可谁能想到，yifenfei在斩杀了一些虾兵蟹将后，却再次面临命运大迷宫的考验，这是魔王lemon设下的又一个机关。要知道，不论何人，若在迷宫中被困1小时以上，则必死无疑！可怜的yifenfei为了去救MM，义无返顾地跳进了迷宫。让我们一起帮帮执着的他吧！命运大迷宫可以看成是一个两维的方格阵列

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=465题意：输入整数n，把1...n的组成环，使得相邻两个整数之和均为素数。输出排列的方案环。思路：先生成一个素数数组，便于之后进行判断。我用的回溯法，有人说用dp哎  

N皇后问题Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25886    Accepted Submission(s): 11504Problem Description在N*N的方格棋盘放置了N个皇后，使得它

Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 46519 Accepted: 19915DescriptionFlip game is played on a rectangular 4x4 field wi

题目描述某地区发生了地震，灾区已经非常困难，灾民急需一些帐篷、衣物、食品和血浆等物资。可通往灾区的道路到处都是塌方，70%以上的路面损坏，桥梁全部被毁。国家立即启动应急预案，展开史上最大强度的非作战式的空运行动，准备向灾区投放急需物资。 一方有难，八方支援。现在已知有N个地方分别有A1，A2,….,An个物资可供调配。目前灾区需要物资数量为M。 现在，请你帮忙算一算，总共有

题目描述 给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。输入输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长度为d，花费为p。最后一行是两个数 s,t;起点s，终点t。n和m为0时输入结束。(1 

DescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg

As a basketball fan, Mike is also fond of collecting basketball player cards. But as a student, he can not always get the money to buy new cards, so sometimes he will exchange with his friends for car

RescueProblem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is: a

Farm IrrigationBenny 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

胜利大逃亡Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟

Catch That CowProblem DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line a

A strange liftProblem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two bu

Knight MovesProblem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of

Oil DepositsProblem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a t

A - Tempter of the Bone

问题 C: 迷宫问题题目描述小明置身于一个迷宫，请你帮小明找出从起点到终点的最短路程。小明只能向上下左右四个方向移动。输入输入包含多组测试数据。输入的第一行是一个整数T，表示有T组测试数据。每组输入的第一行是两个整数N和M（1接下来N行，每行输入M个字符，每个字符表示迷宫中的一个小方格。字符的含义如下：‘S’：起点‘E’：终点‘-’：空地，可以通

**Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square? The first line of input contains N, the number of test cases. Each test case begins with an integer

**Problem Description 自从2006年3月10日至11日的首届数独世界锦标赛以后，数独这项游戏越来越受到人们的喜爱和重视。 据说，在2008北京奥运会上，会将数独列为一个单独的项目进行比赛，冠军将有可能获得的一份巨大的奖品———HDU免费七日游外加lcy亲笔签名以及同hdu acm team合影留念的机会。 所以全球人民前仆后继，为了奖品日夜训练茶饭不思。当然也包括初学者l

题目描述 小明站在一个矩形房间里，这个房间的地面铺满了地砖，每块地砖的颜色或是红色或是黑色。小明一开始站在一块黑色地砖上，并且小明从一块地砖可以向上下左右四个方向移动到其他的地砖上，但是他不能移动到红色地砖上，只能移动到黑色地砖上。 请你编程计算小明可以走到的黑色地砖最多有多少块。 输入 输入包含多组测试数据。 每组输入首先是两个正整数W和H，分别表示地砖的列行数。（1<=W,H<=20）

“ `Oil Deposits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 30121 Accepted Submission(s): 17416Problem Description The GeoSurvComp