zoukankan      html  css  js  c++  java
  • Looksery Cup 2015——AFace Detection

    The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for them.

    In this problem an image is a rectangular table that consists of lowercase Latin letters. A face on the image is a 2 × 2 square, such that from the four letters of this square you can make word "face".

    You need to write a program that determines the number of faces on the image. The squares that correspond to the faces can overlap.

    Input

    The first line contains two space-separated integers, n and m (1 ≤ n, m ≤ 50) — the height and the width of the image, respectively.

    Next n lines define the image. Each line contains m lowercase Latin letters.

    Output

    In the single line print the number of faces on the image.

    Sample test(s)
    input
    4 4
    xxxx
    xfax
    xcex
    xxxx
    output
    1
    input
    4 2
    xx
    cf
    ae
    xx
    output
    1
    input
    2 3
    fac
    cef
    output
    2
    input
    1 4
    face
    output
    0
    Note

    In the first sample the image contains a single face, located in a square with the upper left corner at the second line and the second column:

    In the second sample the image also contains exactly one face, its upper left corner is at the second row and the first column.

    In the third sample two faces are shown:

    In the fourth sample the image has no faces on it.

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    int main()
    {
    	int n,m;
    	int c[55][55];
    	char  a[55][55];
    	while(~scanf("%d%d",&n,&m)){
    		int count = 0;
    		memset(c,0,sizeof(c));
    		getchar();
    		for(int i = 1; i <= n ; i++){
    			for(int j = 1; j <= m ; j++)
    				scanf("%c",&a[i][j]);
    			getchar();
    		}
    	    for(int i = 1; i <= n ; i++){
    			for(int j = 1; j <= m ; j++){
    				if(a[i][j] == 'f')
    					c[i][j] = 1;
    				if(a[i][j] == 'a')
    					c[i][j] = 10;
    				if(a[i][j] == 'c')
    					c[i][j] = 100;
    				if(a[i][j] == 'e')
    					c[i][j] = 1000;
    			}
    		}
    //		for(int i = 1; i <= n ; i++){
    //			for(int j = 1; j <= m ; j++){
    //				printf("%c",a[i][j]);
    //			}
    //			puts("");
    //		}
    //		for(int i = 1; i <= n; i++){
    //			for(int j = 1; j <= m ;j++)
    //				printf("%d",c[i][j]);
    //		puts("");
    //	}
    		for(int i = 1; i < n ; i++){
    			for(int j = 1; j < m ;j++){
    				if(c[i][j] + c[i+1][j+1] + c[i+1][j] + c[i][j+1] == 1111)
    					count++;
    					}
    		}
    		printf("%d
    ",count);
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    二叉树的最大深度与最小深度
    【C++学习笔记】由 const char* 引出的一系列问题
    【C++学习笔记】标准库容器Vector可变长度实现原理
    Python数据可视化之Matplotlib学习笔记
    python读取excel文件—xlrd
    ubuntu14.04下嵌入式工作环境搭建
    ubuntu14.04下交叉编译器的安装
    挂载nfs系统问题之: Root-NFS: Server returned error -13 while mounting
    关于开发板不能ping通外网IP
    Socket的协议地址属性
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4569652.html
Copyright © 2011-2022 走看看