Kiritow/OJ-Problems-Source
1
0
Fork 0
mirror of https://github.com/Kiritow/OJ-Problems-Source.git synced 2024-03-22 13:11:29 +08:00
Code Issues Projects Releases Wiki Activity

Create 3564.cpp

Browse Source
This commit is contained in:
Kirigaya Kazuto 2016-10-12 20:13:23 +08:00 committed by GitHub
parent 2067f9f438
commit fd67b73a92
1 changed files with 56 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

56
SDUTOJ/3564.cpp Normal file
View File

@ -0,0 +1,56 @@
#include <bits/stdc++.h>
using namespace std;
#define MAXN 105
char mp[MAXN][MAXN];
int cc[MAXN][MAXN];
int t;
int N,M;
int main()
{
scanf("%d",&t);
while(t--)
{
memset(mp,0,sizeof(mp));
scanf("%d %d%*c",&N,&M);
for(int i=1;i<=N;i++)
{
gets(&mp[i][1]);
}
memset(cc,0,sizeof(cc));
int realn=N+2;
int realm=M+2;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=M;j++)
{
if(mp[i][j]=='#')
{
cc[i][j]=2;
//++cc[i-1][j-1];
++cc[i-1][j];
//++cc[i-1][j+1];
++cc[i][j-1];
++cc[i][j+1];
//++cc[i+1][j-1];
++cc[i+1][j];
//++cc[i+1][j+1];
}
}
}
int c=0;
for(int i=0;i<realn;i++)
{
for(int j=0;j<realm;j++)
{
if(cc[i][j]==1) ++c;
}
}
printf("%d\n",c);
}
return 0;
}