HDU-4414 Finding crosses 水题

　　题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4414

　　直接暴力判断即可。

 //STATUS:C++_AC_15MS_232KB
 #include <functional>
 #include <algorithm>
 #include <iostream>
 //#include <ext/rope>
 #include <fstream>
 #include <sstream>
 #include <iomanip>
 #include <numeric>
 #include <cstring>
 #include <cassert>
 #include <cstdio>
 #include <string>
 #include <vector>
 #include <bitset>
 #include <queue>
 #include <stack>
 #include <cmath>
 #include <ctime>
 #include <list>
 #include <set>
 #include <map>
 using namespace std;
 //using namespace __gnu_cxx;
 //define
 #define pii pair<int,int>
 #define mem(a,b) memset(a,b,sizeof(a))
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define PI acos(-1.0)
 //typedef
 typedef __int64 LL;
 typedef unsigned __int64 ULL;
 //const
 const int N=;
 const int INF=0x3f3f3f3f;
 const int MOD=,STA=;
 const LL LNF=1LL<<;
 const double EPS=1e-;
 const double OO=1e15;
 const int dx[]={-,,,};
 const int dy[]={,,,-};
 const int day[]={,,,,,,,,,,,,};
 //Daily Use ...
 inline int sign(double x){return (x>EPS)-(x<-EPS);}
 template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
 template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
 template<class T> inline T lcm(T a,T b,T d){return a/d*b;}
 template<class T> inline T Min(T a,T b){return a<b?a:b;}
 template<class T> inline T Max(T a,T b){return a>b?a:b;}
 template<class T> inline T Min(T a,T b,T c){return min(min(a, b),c);}
 template<class T> inline T Max(T a,T b,T c){return max(max(a, b),c);}
 template<class T> inline T Min(T a,T b,T c,T d){return min(min(a, b),min(c,d));}
 template<class T> inline T Max(T a,T b,T c,T d){return max(max(a, b),max(c,d));}
 //End

 char ma[N][N];
 int n;

 int isok(int x,int y)
 {
     int i,j,l,r,cnth;
     for(l=;y-l>= && ma[x][y-l]=='#';l++){
         if(ma[x-][y-l]=='#' || ma[x+][y-l]=='#')return ;
     }
     for(r=;y+r<n && ma[x][y+r]=='#';r++){
         if(ma[x-][y+r]=='#' || ma[x+][y+r]=='#')return ;
     }
     if(l!=r || l== || r==)return ;
     cnth=l;
     for(l=;x-l>= && ma[x-l][y]=='#';l++){
         if(ma[x-l][y-]=='#' || ma[x-l][y+]=='#')return ;
     }
     for(r=;x+r<n && ma[x+r][y]=='#';r++){
         if(ma[x+r][y-]=='#' || ma[x+r][y+]=='#')return ;
     }
     if(l!=r || l== || r==)return ;
     if(cnth!=l)return ;
     return ;
 }

 int main()
 {
  //   freopen("in.txt","r",stdin);
     int i,j,cnt;
     while(~scanf("%d",&n) && n)
     {
         for(i=;i<n;i++){
             scanf("%s",ma[i]);
         }
         cnt=;
         for(i=;i<n-;i++){
             for(j=;j<n-;j++){
                 if(ma[i][j]=='#')cnt+=isok(i,j);
             }
         }

         printf("%d\n",cnt);
     }
     return ;
 }