wh19980604的博客

#include <iostream> #include <stdio.h> #include <queue> #include <string.h> #define MAX 1010 using namespace std; char Map[MAX][MAX]; int Time[MAX][MAX]; bool vis[MAX][MAX]; ...

//不带路径回溯，后面会补上带路径回溯的代码 #include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<queue> #include<cstdio> using name

//不带路径回溯，后面会补上带路径回溯的代码 #include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<queue> #include<cstdio> using name

#include<iostream> #include<cstring> #include<algorithm> #include<string> #include<cstdio> #include<queue> using namespace std; #define inf 0x3f3f3f ...

题目链接 #include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<queue> using namespace std; char M[101][101]; int ans=0...

题目链接 #include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<vector> #include<queue> #include<cstdio&am

#include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<queue> using namespace std; int l,r,c; char m[31][31][31]; bool...

题目链接 #include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> using namespace std; int n,k,ans; char m[9][9]; bool c[9]; //int dx[4]...

Hdu2553 #include<iostream> #include<stdlib.h> #include<cstring> #include<math.h> #include<algorithm> using namespace std; bool c[11],r[11],le[20]

题目链接 #include <iostream> #include<stdlib.h> #include<string.h> using namespace std; char m[21][21];//map bool book[21][21];//book int w,h; int sum;//answer int dx[4]={0,-1,0,1}; i...

题目链接 字符串成对出现，故可以按照层数来区分是第几对。 当为奇数时，n/2+1单独为一对需要特判 #include <iostream> using namespace std; int n; char name[16][28]; void work(int depth) { if((depth==n/2+1)) { if(n%2) ...

#include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<queue> using namespace std; int s,n,m; bool book[101][101][101]...