mayuqing98的博客

描述 1 2 3 4 5 6 7 ############################# 1 # | # | # | | # #####---#####---#---#####---# 2 # # | # # # # # #---#####---#####---#####---

#include #includeusing namespace std;struct pos{    int r,c;};int visited[30][30];pos path[30];pos dir[8]={{-2,-1},{-2,1},{-1,-2},{-1,2},{1,-2},{1,2},{2,-1},{2,1}};int p,q;bool d

描述有一个方格矩阵，矩阵边界在无穷远处。我们做如下假设：a.    每走一步时，只能从当前方格移动一格，走到某个相邻的方格上；b.    走过的格子立即塌陷无法再走第二次；c.    只能向北、东、西三个方向走；请问：如果允许在方格矩阵上走n步，共有多少种不同的方案。2种走法只要有一步不一样，即被认为是不同的方案。输入允许在方格上行走的步数n(n 输出

描述N cities named with numbers 1 ... N are connected with one-way roads. Each road has two parameters associated with it : the road length and the toll that needs to be paid for the road (expressed i

#include #include#include#includeusing namespace std;const int maxn=8;char map[maxn][maxn];int vis[100],n,k,ans;int flag;void dfs(int cur,int num){    if(num==k)    {       

Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 10

http://www.techiedelight.com/print-possible-solutions-n-queens-problem/蓝桥杯的题  也是看了别人代码写出来的 还有好几种解法 先这样吧#include #include#include#includeusing namespace std;const int maxn=8;cha

In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors a