SSimpLe_Y的博客

给出三个数A,B,C，A，B代表两个容器，问是否能通过以下几种操作，把A或B里的水变成C。FILL(i) 把i容器中倒满水，DROP(i) 把i容器中的水倒掉，POUR(i,j) 把i容器中的水倒到j中。如果能做到，输出需要的最小步数，并输出每一步的操作，如果不能输出impossible。#include#include#include#include#include

There is a checkered field of size N x N cells (1 Ј N Ј 3). Each cell designates the territory of a state (i.e. N2 states). Each state has an army. Let A [i, j] be the number of soldiers in the stat

Problem DescriptionRXD has a tree T, with the size of n. Each edge has a cost.Define f(S) as the the cost of the minimal Steiner Tree of the set S on tree T. he wants to divide 2,3,4,5

The twenty-first century is a biology-technology developing century. We know that a gene is made of DNA. The nucleotide bases from which DNA is built are A(adenine), C(cytosine), G(guanine), and T(thy

The Vampires and Lykans are fighting each other to death. The war has become so fierce that, none knows who will win. The humans want to know who will survive finally. But humans are afraid of going t

Winter is approaching! The weather is getting colder and days are becoming shorter. The animals take different measures to adjust themselves during this season.- Some of them "migrate." This means t

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

第一次做到用优先队列做BFS，第一开始用队列做，发现答案不对，照着网上代码改了半天也还是不对，最后发现别人竟然用的是priority_queue，改了之后答案立马就对了，好神奇，涨了一波姿势。题目描述：输入：第一个数T，T组测试数据。两个数 n, m; ( 0接下来n行每行m 个字符。‘s’ 表示弟弟目前所在位置。‘# ’表示此处为一座山。为了节省体力，不从此处通行。

给你三个水杯的容量，只有第一杯里面装满水，其他两个水杯是空的，再输入三个目标值，问你是否能通过倒水达到这个目标，如果能，输入最少步数，如果不能，输出-1.这题其实就是一个简单的BFS，以前感觉太麻烦了，一直不想写，今天终于AC了它。最后提示一下，BFS还是加上标记比较好。#include#include#include#include#includeusing namespac

搜索真的是一个很好用的算法，但是一直都是很弱，代码写的也是很弱。在一个吝啬的国度里有N个城市，这N个城市间只有N-1条路把这个N个城市连接起来。现在，Tom在第S号城市，他有张该国地图，他想知道如果自己要去参观第T号城市，必须经过的前一个城市是几号城市（假设你不走重复的路）。#include#include#include#includeusing namespace s

You are given an undirected connected graph, with N vertices and N-1 edges (a tree). You must find the centroid(s) of the tree. In order to define the centroid, some integer value will be assosciate