HZNU Training 1 for Zhejiang Provincial Competition 2020 Xeon第三场训练赛

#include<iostream>
#include<string>
#include<cmath>
#include<cstring>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<queue>
#include<stack>
#include<sstream>
#include<cstdio>
#define INF 0x3f3f3f3f
const int maxn = 2e5 + 10;
const double PI = acos(-1.0);
typedef long long ll;
using namespace std;

int vis[110][110];
char s[110][110];

int main() {
    int T, n, m;
    scanf("%d", &T);
    getchar();
    while (T--) {
        int ans = 0;
        scanf("%d%d", &n, &m);
        for (int i = 0; i < n; i++) scanf("%s", &s[i + 3][3]);
        for (int i = 0; i < n+3; i++) {
            for (int j = 0; j < m+3 ; j++) {
                if (s[i][j + 1] == ‘O‘ || s[i + 1][j + 1] == ‘|‘ || s[i + 1][j] == ‘/‘ || s[i + 1][j + 2] == ‘\\‘ || s[i + 2][j] == ‘(‘ || s[i + 2][j + 2] == ‘)‘) ans++;
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}