CHESS PLAYERS ARE AMAZING

#include <iostream>
#include <vector>
#include <cmath>
#include <valarray>
#include <string>
#include <algorithm>
#include <sstream>
#include <set>
using namespace std;
int main()
{
    long long int summ,k,n,i,j,m,ma,c,o,x,c1,i1,i2,i3,j1,j2,mi,q,OMEGAHEAD;
    vector < vector<char>> a(8, vector<char>(8,'*'));
    set < vector<long long int>> st;
    vector<vector<long long int>> b(999999,vector<long long int>(2));
    for (i=0;i<8;++i)
        for (j=0;j<8;++j)
            cin >> a[i][j];
    q=0;
    OMEGAHEAD=0;
    k=0;
    for (i=0;i<8;++i)
    {
        for (j=0;j<8;++j)
        {
            if (a[i][j]=='B')
            {
                ++OMEGAHEAD;
                q=0;
                while(1==1)
                {
                    if ((i+q)<8 & (j+q)<8)
                    {
                        b[k][0]=i+q;
                        b[k][1]=j+q;
                        ++k;
                        ++q;
                        if ((a[i+q-1][j+q-1]=='B' || a[i+q-1][j+q-1]=='R')& q!=1)
                            break;
                    }
                    else
                        break;
                }
                q=0;
                while (1==1)
                {
                    if ((i+q)<8 & (j-q)>=0)
                    {
                        b[k][0]=i+q;
                        b[k][1]=j-q;
                        ++k;
                        ++q;
                        if ((a[i+q-1][j-q+1]=='B' || a[i+q-1][j-q+1]=='R')& q!=1)
                            break;
                    }
                    else
                        break;
                }
                q=0;
                while (1==1)
                {
                    if((i-q)>=0 & (j-q)>=0)
                    {
                        b[k][0]=i-q;
                        b[k][1]=j-q;
                        ++k;
                        ++q;
                        if ((a[i-q+1][j-q+1]=='B' || a[i-q+1][j-q+1]=='R')& q!=1)
                            break;
                    }
                    else
                        break;
                }
                q=0;
                while (1==1)
                {
                    if ((i-q)>=0 & (j+q)<8)

                    {
                        b[k][0]=i-q;
                        b[k][1]=j+q;
                        ++k;
                        ++q;
                        if ((a[i-q+1][j+q-1]=='B' || a[i-q+1][j+q-1]=='R')& q!=1)
                            break;
                    }
                    else
                        break;
                }
            }
            if (a[i][j]=='R')
            {
                ++OMEGAHEAD;
                q=0;
                while(1==1)
                {
                    if(j+q<8)
                    {
                        b[k][0]=i;
                        b[k][1]=j+q;
                        ++k;
                        ++q;
                        if ((a[i][j+q-1]=='B' || a[i][j+q-1]=='R')& q!=1)
                            break;
                    }
                    else
                        break;
                }
                q=0;
                while (1==1)
                {
                    if(j-q>=0)
                    {
                        b[k][0]=i;
                        b[k][1]=j-q;
                        ++k;
                        ++q;
                        if ((a[i][j-q+1]=='B' || a[i][j-q+1]=='R')& q!=1)
                            break;
                    }
                    else
                        break;
                }
                q=0;
                while(1==1)
                {
                    if(i-q>=0)
                    {
                        b[k][0]=i-q;
                        b[k][1]=j;
                        ++k;
                        ++q;
                        if ((a[i-q+1][j]=='B' || a[i-q+1][j]=='R')& q!=1)
                            break;
                    }
                    else
                        break;
                }
                q=0;
                while (1==1)
                {
                    if(i+q<8)
                    {
                        b[k][0]=q+i;
                        b[k][1]=j;
                        ++k;
                        ++q;
                        if ((a[i+q-1][j]=='B' || a[i+q-1][j]=='R')& q!=1)
                            break;
                    }
                    else
                        break;
                    }
            }
        }
    }
    for (i=0;i<k;++i)
    {
        st.insert(b[i]);
    }
    cout<<64-st.size();
    return 0;
}