ACM搜索题
文章平均质量分 80
椰子Tyshawn
你眼中的世界就是你自己的样子。
展开
-
DFS-Prime Ring Problem
DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.N原创 2016-07-23 10:49:46 · 385 阅读 · 0 评论 -
诡异的楼梯
诡异的楼梯Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 14329 Accepted Submission(s): 3654Problem DescriptionHogwarts正式开学以后,Harry发现原创 2017-03-19 16:33:26 · 433 阅读 · 0 评论 -
迷宫问题
迷宫问题Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmitStatusDescription定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1,原创 2016-08-23 11:29:14 · 447 阅读 · 0 评论 -
残缺的棋盘
残缺的棋盘Time Limit:1000MS Memory Limit:131072KB 64bit IO Format:%lld & %lluSubmitStatusPracticeCSU 1511DescriptionInput输入包含不超过10000 组数据。每组数据包含6个整数r1, c1, r2, c2,原创 2016-08-21 20:25:10 · 540 阅读 · 0 评论 -
BFS-Oil Deposits
DescriptionGeoSurvComp地质调查公司负责探测地下石油储藏。 GeoSurvComp现在在一块矩形区域探测石油,并把这个大区域分成了很多小块。他们通过专业设备,来分析每个小块中是否蕴藏石油。如果这些蕴藏石油的小方格相邻,那么他们被认为是同一油藏的一部分。在这块矩形区域,可能有很多油藏。你的任务是确定有多少不同的油藏。Input输入可能有多个矩形区域原创 2016-07-27 21:30:03 · 564 阅读 · 0 评论 -
N皇后问题
N皇后问题Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusDescription在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。你的任务是,对于给定的原创 2016-08-21 11:32:50 · 250 阅读 · 0 评论 -
棋盘问题
棋盘问题Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmitStatusDescription在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k原创 2016-08-21 10:13:32 · 645 阅读 · 0 评论 -
FZU 最大黑区域
B - 最大黑区域Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeFZU 1082Description二值图像是由黑白两种像素组成的矩形点阵,图像识别的一个操作是求出图像中最大黑区域的面积。请设计一个程序完成二值图像的原创 2016-08-19 09:14:38 · 1159 阅读 · 0 评论 -
BFS-Mike and Shortcuts
DescriptionRecently, 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原创 2016-07-28 17:22:16 · 380 阅读 · 0 评论 -
DFS-Find The Multiple
DescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater tha原创 2016-07-28 15:14:33 · 300 阅读 · 0 评论 -
BFS-Prime Path
DescriptionThe 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.— I原创 2016-07-28 11:05:07 · 266 阅读 · 0 评论 -
BFS-Knight Moves
DescriptionBackgroundMr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him?The ProblemYour tas原创 2016-07-27 15:59:28 · 292 阅读 · 0 评论 -
DFS-Numerically Speaking
DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent til原创 2016-07-27 10:48:46 · 312 阅读 · 0 评论 -
DFS-速算24点
DescriptionGeorge 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 sti原创 2016-07-26 16:20:15 · 968 阅读 · 0 评论 -
DFS-Sticks(扑克24点)
Description速算24点相信绝大多数人都玩过。就是随机给你四张牌,包括A(1),2,3,4,5,6,7,8,9,10,J(11),Q(12),K(13)。要求只用'+','-','*','/'运算符以及括号改变运算顺序,使得最终运算结果为24(每个数必须且仅能用一次)。游戏很简单,但遇到无解的情况往往让人很郁闷。你的任务就是针对每一组随机产生的四张牌,判断是否有解。我们另外规定,整原创 2016-07-25 23:53:50 · 587 阅读 · 0 评论 -
DFS-Network Saboteur
DescriptionA university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order原创 2016-07-25 15:10:45 · 435 阅读 · 0 评论 -
连连看
连连看Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34222 Accepted Submission(s): 8480Problem Description“连连看”相信很多人都玩过。没玩过也没关系,下原创 2017-03-26 16:53:30 · 532 阅读 · 0 评论