computering666-优快云博客

原创 Alphabet Animals

Alphabet Animals 来源：Kattis - alphabetanimals 考查简单的字符串处理难度简单题意理解给定一个字符串s和一个字符串集合t，遍历集合t，若t中不存在以s最后一个字符开头的字符串，输出’?’；若t中存在以s最后一个字符开头的字符串，设该字符串为s1，且不存在以s1最后一个字符开头的字符串，则输出第一个满足该条件的字符串s1加一个’!’；若t中存在以s最后一个字符开头的字符串，设该字符串为s1，且对于每一个满足条件的s1，t中都存在以s1最后一个字符开头的字符串

2021-09-02 10:58:02 246

原创 Dungeon Master

Dungeon Master 来源：POJ 2251 考查 BFS 难度简单题意理解在一个三维的空间中，输入三个数，分别是L，R，C，代表有L个平面，R行，C列。输入的三维空间中，’.‘代表可以走，’#'代表不能走，'S’代表起点，'E’代表终点。问从起点到终点最少需要多少步，如果不能到达，输出"Trapped!"。模型建立三维的BFS 解题思路建立一个结构体Point，存储每一个位置的信息，有四个成员，分别是三个方向的坐标和走了多少步。开一个三维的数组，在输入时进行初始化，如果输入的点为起点或

2021-08-05 19:50:14 217

原创 Buried memory

Buried memory 来源：HDU - 3007 题目描述： Each person had do something foolish along with his or her growth.But,when he or she did this that time,they could not predict that this thing is a mistake and they will want this thing would rather not happened. The wo

2021-03-14 21:59:44 190

原创 Use of Hospital Facilities

Use of Hospital Facilities 来源：UVA - 212 题目描述： County General Hospital is trying to chart its course through the troubled waters of the economy and shifting population demographics. To support the planning requirements of the hospital, you have been asked

2021-02-08 12:40:39 238

原创 Revenge of Fibonacci

Revenge of Fibonacci 来源：UVA - 12333 题目描述： The well-known Fibonacci sequence is defined as following: F(0) = F(1) = 1 F(n) = F(n − 1) + F(n − 2) ∀n ≥ 2 Here we regard n as the index of the Fibonacci number F(n). This sequence has been studied since the p

2021-01-31 12:58:14 178

原创 Asterism (Easy Version)

Asterism (Easy Version) 来源：CodeForces - 1371E1 题目描述： This is the easy version of the problem. The difference between versions is the constraints on n and ai. You can make hacks only if all versions of the problem are solved. First, Aoi came up with the

2021-01-19 16:19:55 303

原创 Grid-00100

Grid-00100 来源：CodeForces - 1371D 题目描述： A mad scientist Dr.Jubal has made a competitive programming task. Try to solve it! You are given integers n,k. Construct a grid A with size n×n consisting of integers 0 and 1. The very important condition should be

2021-01-19 13:36:21 147

原创 Game On Leaves

Game On Leaves 来源：CodeForces - 1363C 题目描述： Ayush and Ashish play a game on an unrooted tree consisting of n nodes numbered 1 to n. Players make the following move in turns: Select any leaf node in the tree and remove it together with any edge which has

2021-01-10 17:33:28 121

原创 Subsequence Hate

Subsequence Hate 来源：CodeForces - 1363B 题目描述： Shubham has a binary string s. A binary string is a string containing only characters “0” and “1”. He can perform the following operation on the string any amount of times: Select an index of the string, and f

2021-01-10 11:58:12 280

computering666的博客