CodeForces 7A Kalevitch and Chess

dfs都不需要，由于题目只给8*8的范围，所以直接暴力就好了。。。

#include "string"
#include "iostream"
#include "cstdio"
#include "cmath"
#include "set"
#include "queue"
#include "vector"
#include "cctype"
#include "sstream"
#include "cstdlib"
#include "cstring"
#include "stack"
#include "ctime"
#include "algorithm"
#define pa pair<int,int>
#define Pi M_PI
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef long long LL;
const int M=55;

char mp[10][10];
    
int main()
{
    int i,j;
    for(i=1;i<=8;++i)
       for(j=1;j<=8;++j)
        cin>>mp[i][j];
    int s,t,cnt;
    s=0,t=0,cnt=0;
    for(i=1;i<=8;++i)
    {
        t=0;
        for(j=1;j<=8;++j)
        {
            if(mp[i][j]=='B')
                t++;
        }
        if(t==8)
            cnt++;
        else
            s=t;
    }
    
    cout<<s+cnt<<endl;
    
    return 0;
     

}