-----搜索
文章平均质量分 69
chenchenT_
这个作者很懒,什么都没留下…
展开
-
-----hdu 2181 哈密顿绕行世界问题
一个规则的实心十二面体,它的 20个顶点标出世界著名的20个城市,你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input 前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m<=20,m>=1.m=0退出. Output 输出从第m个城市出发经过每个城市1次又回到m的所有路线,如有多条路线,按字典序输出,每行1条路线.每行首先输出是第几条路原创 2017-08-20 21:45:13 · 311 阅读 · 0 评论 -
-----FZU 2150-Fire Game
Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then they start原创 2017-08-20 00:22:52 · 403 阅读 · 0 评论 -
-----hdu 2612 Find a way
Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. Yifenfei’s home is at the co原创 2017-08-18 22:18:00 · 332 阅读 · 0 评论 -
----- UVA 11624-Fire!
Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s location in the原创 2017-08-04 19:44:34 · 256 阅读 · 0 评论 -
-----广搜 POJ 3278-Catch That Cow
Farmer 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 and the cow is at a point K (0 ≤ K ≤ 100,00原创 2017-08-03 20:19:46 · 323 阅读 · 0 评论 -
-----poj 1321 棋盘问题
棋盘问题在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。 Input 输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及摆放棋子的数目。 n <= 8 , k <= n原创 2017-04-15 18:03:49 · 486 阅读 · 0 评论 -
-----暴力dfs+回溯 hdu 1045-Fire Net
Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. A blockhouse is a small castle that原创 2017-07-02 17:10:52 · 368 阅读 · 0 评论 -
-----hdu 2553 N皇后问题
N皇后问题在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。 你的任务是,对于给定的N,求出有多少种合法的放置方法。Input共有若干行,每行一个正整数N≤10,表示棋盘和皇后的数量;如果N=0,表示结束。Output共有若干行,每行一个正整数,表示对应输入行的皇后的不同放置数量。Sample Input1 8原创 2017-04-15 16:25:01 · 409 阅读 · 0 评论 -
-----hdu 1312 dfs
深搜的一道基础题~Red and BlackThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjace原创 2017-03-25 18:00:15 · 337 阅读 · 0 评论 -
-----hdu 1241 dfs
Oil DepositsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 29278 Accepted Submission(s): 16894Problem DescriptionThe GeoSurvComp geologic survey原创 2017-03-25 18:02:15 · 330 阅读 · 0 评论 -
-----nefu 465 dfs
寻找豆豆Description 柯南是个神侦探,他认为世界上真相只有一个……现在他正在调查一个杀人事件,为了寻找争相,他必须在一个给定的正方形里寻找有几个豆豆,(或许豆豆的个数能给聪明的柯南一些线索哟)……现在他向你求救,你能帮助他吗? 柯南只能上下左右走 Input 多组数据。每组数据第一行是个整数N(N < 10),代表斜放着正方形的边长,接下来N行描述斜放着正方形的内容。原创 2017-03-26 10:03:35 · 385 阅读 · 0 评论 -
-----Lightoj 1337
The Crystal MazeYou are in a plane and you are about to be dropped with a parasuit in a crystal maze. As the name suggests, the maze is full of crystals. Your task is to collect as many crystals as pos原创 2017-03-25 19:16:14 · 351 阅读 · 0 评论 -
-----暴力搜索-hdu 5952 Counting Cliques
A clique is a complete graph, in which there is an edge between every pair of the vertices. Given a graph with N vertices and M edges, your task is to count the number of cliques with a specific size S原创 2017-10-06 21:13:29 · 460 阅读 · 0 评论