Poj-1321 棋盤問題

# include<stdio.h> # include<string.h> # include<algorithm> # include<iostream> # include<queue> # define maxn 30 using namespace std; char s[maxn][maxn]; int vis[maxn]; int ans,n,k; void dfs(int x,in

>>阅读原文<<