Some.

问题及代码：给出迷宫的图纸和初始终点位置，用DFS求最小步数。#include using namespace std;int n,m,p,q,MIN=99999999;int a[51][51],book[51][51];void dfs(int x,int y,int step){ int next[4][2]= {{0,1},{1,0},{0,-1},{-1,0}

Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19095 Accepted: 10711DescriptionThe ministers of the cabinet were quite upset by the message

SudokuTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19638 Accepted: 9408 Special JudgeDescriptionSudoku is a very simple task. A square table with

Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 82618 Accepted: 25955DescriptionFarmer John has been informed of the location of a fugitiv

Shredding CompanyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6035 Accepted: 3299DescriptionYou have just been put in charge of developing a new shre

Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30842 Accepted: 11948DescriptionYou are trapped in a 3D dungeon and need to find the quick

PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15785 Accepted: 6661 Special JudgeDescriptionYou are given two pots, having the volume of A and 

A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 43947 Accepted: 14931DescriptionBackground The knight is getting bored of seeing the

Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20305 Accepted: 8282DescriptionOn Planet MM-21, after their Olympic games this year, curling

问题及代码：Problem C Oil DepositsTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6   Accepted Submission(s) : 3Font: Times Ne

Distance on ChessboardTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 26931 Accepted: 9124Description国际象棋的棋盘是黑白相间的8 * 8的方格，棋子放在格子中间。如下图所示： 王、后、车、象

算法提高 学霸的迷宫  时间限制：1.0s   内存限制：256.0MB    问题描述　　学霸抢走了大家的作业，班长为了帮同学们找回作业，决定去找学霸决斗。但学霸为了不要别人打扰，住在一个城堡里，城堡外面是一个二维的格子迷宫，要进城堡必须得先通过迷宫。因为班长还有妹子要陪，磨刀不误砍柴功，他为了节约时间，从线人那里搞到了迷宫的地图，准备提前计算最短的路线。

Knight MovesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 26034 Accepted: 12276DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asse

Knight MovesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13444 Accepted: 7525DescriptionA friend of you is doing research on the Traveling Knight Pro

MultipleTime Limit: 1000MS Memory Limit: 32768KTotal Submissions: 7106 Accepted: 1524Descriptiona program that, given a natural number N between 0 and 4999 (inclusi

Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 26092 Accepted: 14163DescriptionThere is a rectangular room, covered with square tiles. Eac

问题及代码：给出迷宫的图纸和初始终点位置，用DFS求最小步数。#include #include using namespace std;int a[51][51],book[51][51];int sx,sy,n,m,p,q;struct note{ int x,y,f,s;//坐标、父亲在队列中的编号（不求路径，可省略）、步数} que[2501];

问题及代码：Balloons Time Limit: 1000MS Memory limit: 65536K 题目描述Both Saya and Kudo like balloons. One day, they heard that in the central park, there will be thousands of people fly bal

放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28356 Accepted: 17939Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。

问题及代码：Problem G  a strange liftTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 3   Accepted Submission(s) : 3Font: Times New Rom

问题及代码：Problem D N皇后问题Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3   Accepted Submission(s) : 2Font: Times New Roman | Verda

问题及代码：Problem E Tempter of the BoneTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 7   Accepted Submission(s) : 4Font: Times New

问题及代码：Problem B Red and BlackTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 10   Accepted Submission(s) : 5Font: Times New Roma

问题及代码：Problem A Robot MotionTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 7   Accepted Submission(s) : 5Font: Times New Roman |

问题及代码：Tri TilingTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 3   Accepted Submission(s) : 2Font: Times New Roman | Verdana | Ge

Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 38472 Accepted: 16721DescriptionFlip game is played on a rectangular 4x4 field with two-sided p

The Pilots Brothers' refrigeratorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23018 Accepted: 8862 Special JudgeDescriptionThe game “The Pilots

#include#include#include#include#include#include#includeusing namespace std;#define MAXN 1000010#define MOD 1000000000int vis[3][4],map[3][4];int dir[8][2]= {{-2,-1},{-2,1},{-1,-2},{-1,2},{

肿瘤诊断   在诊断肿瘤疾病时，计算肿瘤体积是很重要的一环。给定病灶扫描切片中标注出的疑似肿瘤区域，请你计算肿瘤的体积。输入格式：输入第一行给出4个正整数：MM、NN、LL、TT，其中MM和NN是每张切片的尺寸（即每张切片是一个M\times NM×N的像素矩阵。最大分辨率是1286\times 1281286×128）；LL（\le 60≤60）是切片的张数；TT是一个整数阈值（若疑似肿瘤的连通...