不慌不忙、不急不躁

The New Villa Mr. Black recently bought a villa in the countryside. Only one thing bothers him: although there are light switches in most rooms, the lights they control are often in ot

The Most Distant StateInput: standard inputOutput: standard output The 8-puzzle is a square tray in which eight square tiles are placed. The remaining ninth square is uncovered. Each tile has

Dancing DigitsDigits like to dance. One day, 1, 2, 3, 4, 5, 6, 7 and 8 stand in a line to have a wonderful party. Each time, a male digit can ask a female digit to dance with him, or a female

L-system A D0L (Deterministic Lindenmayer system without interaction) system consists of a finite set  of symbols (the alphabet), a finite set P of productions and a starting string

Fans and GemsInput: Standard InputOutput: Standard OutputTomy's fond of a game called 'Fans and Gems' (also known as Gravnic). In the game, he can use fans to collect gems, but he's sati

题目链接：zoj 3814 Sawtooth Puzzle题目大意：给定一个9宫拼图，每次可以挑选一个位置顺时针旋转，和普通拼图不一样的是每块拼图周围可能有齿转动一个可能导致全部拼图转变。解题思路：隐式图搜索，9块拼图最多49个状态，对于每个状态枚举转动的位置，考虑转动的状态。一开始转移是用bfs写的，但是由于频繁申请队列，然后时间爆了#include #include #

FILL There are three jugs with a volume of a, b and c liters. (a, b, and c are positive integers not greater than 200). The first and the second jug are initially empty, while the thirdis co

题目链接：hdu 5012 Dice题目大意：给出一个立方体6个面的值，问说最少经过次旋转得到目标状态。解题思路：隐式图搜索，直接将一个状态映射成一个整数，然后对应BFS。#include #include #include #include using namespace std;typedef int Mat[10];const int maxn = 100

题目链接：uva 810 - A Dicey Problem在bfs的基础上记录色子的状态。#include #include #include #include #include using namespace std;typedef pair pii;const int maxn = 105;const int dir[4][2] = {{-1, 0}