Codeforces 549A. Face Detection[模拟]
2016-09-16 22:24
1241 查看
A. Face Detection
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Examples
input
output
input
output
input
output
input
output
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.
题意:四个格子里出现face四个字母
我是用了个vis数组,题解是给四个格子字母排序与acef对比
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Examples
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.
题意:四个格子里出现face四个字母
我是用了个vis数组,题解是给四个格子字母排序与acef对比
// // main.cpp // cf549a // // Created by Candy on 9/15/16. // Copyright © 2016 Candy. All rights reserved. // #include <iostream> #include <cstdio> #include <algorithm> #include <cstring> using namespace std; const int N=55; int n,m,ans=0; int a ,vis[30]; char s ; int main(int argc, const char * argv[]) { scanf("%d%d",&n,&m); for(int i=1;i<=n;i++){ scanf("%s",s); for(int j=0;j<m;j++) a[i][j+1]=s[j]-'a'; } for(int i=1;i<=n-1;i++) for(int j=1;j<=m-1;j++){ memset(vis,0,sizeof(vis)); vis[a[i][j]]++; vis[a[i+1][j]]++; vis[a[i][j+1]]++; vis[a[i+1][j+1]]++; if(vis[0]&&vis['f'-'a']&&vis['c'-'a']&&vis['e'-'a']) ans++; } printf("%d",ans); return 0; }
相关文章推荐
- CodeForces 581C - Developing Skills(模拟)
- CodeForces 660 B. Seating On Bus【模拟】
- Codeforces Good Bye 2017: F. New Year and Rainbow Roads(模拟)
- CodeForces - 758D Ability To Convert(模拟,递归)
- CodeForces - 750B New Year and North Pole (模拟)
- CodeForces - 148B Escape (模拟)
- Codeforces 569 A. Music ( 模拟 )
- CodeForces - 405B Domino Effect (模拟)
- codeforces 767A Snacktower(模拟)
- CodeForces - 868B Race Against Time(模拟)
- CodeForces 660D. Number of Parallelograms【模拟】
- CodeForces 143B - Help Kingdom of Far Far Away 2(字符串模拟)
- codeforces 673B B. Problems for Round(模拟)
- CodeForces 589D Boulevard (模拟)
- Codeforces-697B Barnicle(模拟)
- 【模拟】Codeforces 706A Beru-taxi
- codeforces-508C -鬼吹灯(巧妙模拟)
- [codeforces] A. Grasshopper And the String 简单模拟
- Codeforces 876 D. Sorting the Coins 模拟
- codeforces 425B Sereja and Table(状态压缩,也可以数组模拟)