HDU4414 Finding crosses

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int Ni = 60;
bool vis[Ni][Ni];
char map[Ni][Ni];
int n;
void Init()
{
    memset(vis,0,sizeof(vis));
    for(int i=0;i<n;i++)
        scanf("%s",map[i]);
}
int pushdown(int i,int j)
{
    int k;
    for(k=0;i+k<n;k++)  if(map[i+k][j]=='#')
        vis[i+1][j]=1;
    else break;
    return k;
}
int pushup(int i,int j)
{
    int k;
    for(k=0;i-k>=0;k++) if(map[i-k][j]=='#')
        vis[i-k][j]=1;
    else break;
    return k;
}
int pushleft(int i,int j)
{
    int k,flg=1;
    for(k=0;j-k>=0;k++) if(map[i][j-k]=='#')
    {
        if(k&&(pushdown(i,j-k)!=1||pushup(i,j-k)!=1)) flg=0;
        vis[i][j-k]=1;
    }
    else break;
    if(flg) return k;
    else return 0;
}
int pushright(int i,int j)
{
    int k,flg=1;
    for(k=0;j+k<n;k++) if(map[i][j+k]=='#')
    {
        if(k&&(pushdown(i,j+k)!=1||pushup(i,j+k)!=1)) flg=0;
        vis[i][j+k]=1;
    }
    else break;
    if(flg) return k;
    else return 0;
}
bool ok(int i,int j)
{
    int l,r,fd=1;
    int d=pushdown(i,j);
    if(!(d&1)||d==1) fd=0;
    for(int k=0;k<d;k++)
    {
        l=pushleft(i+k,j)-1;
        r=pushright(i+k,j)-1;
        if(k==d/2)
        {
            if(l!=d/2||r!=d/2) fd=0;
        }
        else if(l!=0||r!=0)
            fd=0;
    }
    return fd;
}
int finds()
{
    int ans=0,i,j;
    for(i=0;i<n;i++)
    for(j=0;j<n;j++)
    {
       if(map[i][j]=='#'&&(!vis[i][j])&&ok(i,j)) ans++;
    }
    return ans;
}
int main()
{
    while(scanf("%d",&n),n)
    {
        Init();
        printf("%d\n",finds());
    }
    return 0;
}