coderforce 549A Face Detection

题意：找图中的face有多少个。（来一个最长的代码）

#include<stdio.h>
#include<string.h>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
const int maxm=100;
map<char,int>q;
char s[maxm][maxm];
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        for(int i=0; i<n; i++)
        {
            scanf("%s",s[i]);
        }
        int cnt=0;
        for(int i=0; i<n-1; i++)
        {
            for(int j=0; j<m-1; j++)
            {
                q.clear();
                int sum=0;
                if(s[i][j]!='x'&&s[i+1][j]!='x'&&s[i][j+1]!='x'&&s[i+1][j+1]!='x'&&(s[i+1][j+1]=='a'||s[i+1][j+1]=='f'||s[i+1][j+1]=='c'||s[i+1][j+1]=='e')&&(s[i][j]=='a'||s[i][j]=='f'||s[i][j]=='c'||s[i][j]=='e')&&(s[i+1][j]=='a'||s[i+1][j]=='f'||s[i+1][j]=='c'||s[i+1][j]=='e')&&(s[i][j+1]=='a'||s[i][j+1]=='f'||s[i][j+1]=='c'||s[i][j+1]=='e'))
                {
                    if(!q[s[i][j]])
                    {
                        q[s[i][j]]=1;
                        sum++;
                    }
                    if(!q[s[i+1][j]])
                    {
                        q[s[i+1][j]]=1;
                        sum++;
                    }
                    if(!q[s[i][j+1]])
                    {
                        q[s[i][j+1]]=1;
                        sum++;
                    }
                    if(!q[s[i+1][j+1]])
                    {
                        q[s[i+1][j+1]]=1;
                        sum++;
                    }
                    if(sum==4)
                    {
                        cnt++;
                    }
                }
            }
        }
        printf("%d\n",cnt);
    }
    return 0;
}