Zhangcan233的博客

题目链接:Tempter of the Bone题目大意：给出一个地图和固定步数t，问能否恰好花费给定的步数t从地图起点走到地图终点.一开始理解为在给定步数之内到达终点即可，数据又很小，直接深搜果断TLE，真正按题意来的话会把从起点到终点的所有情况都搜索一便，这里就要用到奇偶剪枝（qaq以前明明有用过，一自己做就是想不起来），说说自己对奇偶剪枝的理解：在地图中，只能走直线的情况下，两点

题目：Recently, Mike was very busy with studying for exams and contests. Now he is going to chill a bit by doing some sight seeing in the city.City consists of n intersections numbered from 1 to n.

题目：ACM小组的Samsara和Staginner对中国象棋特别感兴趣，尤其对马（可能是因为这个棋子的走法比较多吧）的使用进行深入研究。今天他们又在 构思一个古怪的棋局:假如Samsara只有一个马了，而Staginner又只剩下一个将，两个棋子都在棋盘的一边，马不能出这一半棋盘的范围，另外这 一半棋盘的大小很奇特(n行m列)。Samsara想知道他的马最少需要跳几次才能吃掉Stagin

题目：The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — It is a matt

题目：You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's

题目：D(1973): 给自己出题的小XSubmit Page    Summary    Time Limit: 1 Sec     Memory Limit: 128 Mb     Submitted: 38     Solved: 9    Description小X学习了dfs，为了练习搜索，开始给自己出题玩。玩着玩着，一会把

题目：Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square? InputThe first line of input contains N, the number of test cases. Each test case begins

题目：Given four numbers, can you get twenty-four through the addition, subtraction, multiplication, and division? Each number can be used only once.InputThe input consists of multiple test c

题目：George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he h

题目：Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities across its uncharted wilderness. You are employed b

题目：有一棵由N个结点构成的树，每一条边上都有其对应的权值。现在给定起点，求从该点出发的一条路径（至少有一条边）使得这条路径上的权值之和最大，并输出这个最大值。Input第一行一个正整数T，代表数据组数。每组数据第一行两个正整数n(2Output每组数据输出一行，即所找到路径的最大权值(格式参见样例)。Sample Input23 11 2 101

题目：There is an interesting calculator. It has 3 rows of buttons.Row 1: button 0, 1, 2, 3, …, 9. Pressing each button appends that digit to the end of the display.Row 2: button +0, +1, +2, +3, …, +9. Pr