摘要：Description The Robot Moving Institute is using a robot in their local store to transport different items. Of course the robot should spend only the m 阅读全文

摘要：Problem Description There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.Th 阅读全文

摘要：Description Given a connected, undirected graph G = (V, E), where V is the vertex set consisting a collection of nodes, and E is the set of edges, eac 阅读全文

摘要：Description Nemo is a naughty boy. One day he went into the deep sea all by himself. Unfortunately, he became lost and couldn't find his way home. The 阅读全文

摘要：Description Input is the matrix A of N by N non-negative integers. A distance between two elements Aij and Apq is defined as |i − p| + |j − q|. Your p 阅读全文

摘要：Time Limit: 1000MS Memory Limit: 32768K Total Submissions: 7211 Accepted: 1545 Description a program that, given a natural number N between 0 and 4999 阅读全文

摘要：题意：一个n*n格的棋盘，从1标号到n*n。从1开始走，每次投色子，可走1到6步中的任意一个步数，问最少投几次色子可到最后一格。其中有两种特殊通道，蛇和梯子，在蛇头所在的格子可以直接走到蛇尾所在的格子，在梯子底端所在的格子可以直接走到梯子顶端所在的格子。 思路：由于蛇和梯子作用是一样的，所以可以把它 阅读全文

摘要：Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 970 Accepted Submission(s): 400 Problem Descript 阅读全文

摘要：Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26891 Accepted Submission(s): 9529 Problem Descri 阅读全文