摘要： http://poj.org/problem?id=2251#include<stdio.h>#include<string.h>#include<queue>#include<iostream>using namespace std;#define max 999999#define N 40int l,r,c,ans,ex,ey,ez;char map[N][N][N];int vis[N][N][N];int dx[6]={-1,0,1,0,0,0};int dy[6]={0,1,0,-1,0,0};int dz[6]={0,0,0,0,1 阅读全文

摘要： http://poj.org/problem?id=1321#include<stdio.h>#include<string.h>#define N 100char str[N][N];int n,ans,k,r[N],c[N],l;struct node{ int x; int y;}p[N];void dfs(int num,int sum){ if(num<=l&&sum==0) { ans++; return ; } if(num>=l) { return ; } int x=p[num].... 阅读全文