zxy160的博客

题目http://115.159.40.116/problem_show.php?pid=4670 二维地图最短路问题 广搜，这个题深搜也可以，先写个广搜吧#include<iostream>#include<string.h>#include<queue>#include<algorithm>using namespace std;int si,sj,di,dj;int map[9

Problem 2150 Fire Game 题意：找两个起火点，把草烧完，求最短时间，如果烧不完，输出-1 思路：先找到草堆数目，然后暴力枚举任意两个点。水题，还以为会超时呢#include&lt;stdio.h&gt;#include&lt;string.h&gt;#include&lt;queue&gt;#include&lt;iostream&gt;#include&l...

UVA - 167 八皇后问题，用c[i]=k表示第i行放置第k列。#include&lt;stdio.h&gt;#include&lt;string.h&gt;#include&lt;iostream&gt;#include&lt;algorithm&gt;using namespace std;const int maxn=25;int mapp[maxn][maxn];...

题目 题意：在一个y行 x列的迷宫中，有可行走的通路空格’ ‘，不可行走的墙’#’，还有两种英文字母A和S，现在从S出发，要求用最短的路径L连接所有字母，输出这条路径L的总长度。 做法：BFS+最小生成树 我的做法是先把图转换成一个由-1表示墙，0表示空格，&gt;=1的数字表示点A和S构成的图，然后bfs求出任意两点间的距离，最后用prime算法求出答案即可。 坑点是数据的任意一行的最后...

poj1664 感觉dfs+接口问题一样，不过就是要搞清有几个接口。 1.m==1||n==1时，只有一种放的方式。 2.m3.m>n时，先每个盘子放一个苹果，然后考虑剩下的苹果放n个盘子的情况。还有m个苹果放n-1个盘子里的情况，所以返回dfs(m-n,m)+dfs(m,n-1). 但是m-n有可能等于0，所以第一种情况添加m==0的情况，虽然不添加也对，可能是数据水。#inc

A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C chips. Eac

Problem Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a

定义一个二维数组： int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,};它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。 Input 一个5 × 5的二维数组，表示一个迷宫。数据保证有唯一解

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 matter of se

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 than 200

Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 89585 Accepted: 28099 DescriptionFarmer John has been informed of the location of a fugitive cow and wants to ca

Dungeon Master Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 33157 Accepted: 12711 DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dung

棋盘问题 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 42124 Accepted: 20520 Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的

Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s location in the

Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. Yifenfei’s home is at the co

题目https://vjudge.net/contest/145660?#problem/B 三维空间最短路问题用广搜#include<iostream>#include<string.h>#include<queue>//队列头文件using namespace std;char map[35][35][35];//地图int a,b,c;int vis[35][35][35];//

直接暴力搜+可行性剪枝。具体看代码，注意：顺时针旋转#include&lt;bits/stdc++.h&gt;using namespace std;int vis[20];char s[20][20];int a[20][20],b[20][20];int ans;void ro(int x,int y){ for(int i=x;i&lt;x+4;i++) ...