Hdoj search question mark I (a total of 100 questions)

DFS (depth first search)

Generally, hash is not used, so it is often called "brute force", that is, all the situations are exhausted. Generally, we can follow several questions of our oj dfs version to imitate it, because recursion is involved, it is best for beginners to draw a line between them and understand the true meaning.

DFS --- easy (15)

Tempter of Thebone

Safecracker

Prime ringproblem

Robot Motion

Fire net

It takes only 15 ms to guess the number.

Oil Deposits

Sum it up

Red and black

Shreddingcompany

Kryton factor

Rank

How manyequations can you find

Acceptedneck.pdf

Lotto

 

In general, DFS may sometimes add some DP ideas, so that it becomes a memory-based search. The principle is to record the previously calculated status, and the next access will not need to continue Recursive Computing, you can use it directly later.

DFS + dp --- easy (7)

Fatmouse andcheese Problem Solving report

A walk throughthe Forest

Pascal 'stravels

Solution report

Anniversaryparty

Unidirectionaltsp

Numbering paths

Dota all stars

 

DFS + dp --- normal (1)

Islands andbridges

 

DFS --- normal (16)

Sticks Problem Solving report

Transportation

Square Problem Solving report

Increasingsequences

Free candies

Anagrams bystack

Station balance

A puzzlingproblem

Vase collection

World problems with Hamilton Bypass

Necklacedecomposition

Barbarabennett's wild numbers

Sequence One

Islands

Pipes

No left turns

 

BFS (breadth first search)

Http://cache.baidu.com/C? M = bytes & P = 81759a41dc9601f201be9b7a5c40 & User = Baidu

 

BFS --- easy (17)

Ignatius andthe princess I

Nightmare

Weird stairs

Open the lock

Super Password

Asteroids!

Rescue

Hike on a graph

Shengli Great Escape

N-crediblemazes

Knight moves

Basic wall maze

A strange lift

Plan

Game III

Hiking trip

Hamburger magi

 

BFS --- normal (27)

Gap

Remainder

The proper key

Victory (continued)

The treasure

Bubble shooter

Copying DNA

Full tank?

Cheesy chess

Push box

Key task

Frogger

Prime path

Frogger

Escape fromenemy territory

Escape

Bus Pass

Marbles inthree baskets

Treasure of thechimp Island

Escape from the maze

Find thenearest Station

Dogs

Lode Runner

Tobo or nottobo

Sum of digits

Escape

An interestingmobile game

 

BFS + DFS --- easy (4)

Collect morejewels

Push box

Different digits

Kaitou kid-the phantom thief (2)

 

Doubledirebfs (3)

Solitaire

Magic Board

Bridged marblerings

 

 

BS (Binary Search) (5)

This type of question generally does not have only one algorithm, but is generally a binary +? (Maximum stream, binary matching, greedy, DP), etc. Here we only list the questions of the binary enumeration, that is, the answers of the binary enumeration, and then determine whether the results are feasible or not.

The balance

Equations

Cable master

Sum zero

Pie

 

Ida Star (4)

It is not difficult to deepen iteration, but it is hard to think about good pruning.

DNA sequence

The rotationgame

Booksort

Escape fromtetris

 

It looks like a search, but the search will show a list of TLE questions (1)

Arbitrage