Codeforces Round #294 (Div. 2) A and B and Chess

Problem: A and B and Chess

///     Raihan Ruhin
///     CSE, Jahangirnagar University.
///     Dhaka-Bangladesh.
///     id: raihanruhin (topcoder / codeforces / codechef / hackerrank / uva / uvalive / spoj), 3235 (lightoj)
///     mail: raihanruhin@ (yahoo / gmail / facebook)
///     blog: ruhinraihan.blogspot.com

#include<bits/stdc++.h>
using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define PI acos(-1.0)

#define MOD 1000000007
#define MX 100010


int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int tc,kk=1, n, white, black;
    char c;
    white=black=0;
    for(int i=0;i<8;i++)
        for(int j=0;j<8;j++)
        {
            cin>>c;
            if(c!='.')
            {
                if(c=='Q') white+=9;
                else if(c=='q') black+=9;
                else if(c=='R') white+=5;
                else if(c=='r') black+=5;
                else if(c=='B' || c=='N') white+=3;
                else if(c=='b' || c=='n') black+=3;
                else if(c=='P') white+=1;
                else if(c=='p') black+=1;
            }
        }
    if(white>black) cout<<"White";
    else if(white<black) cout<<"Black";
    else cout<<"Draw";

    return 0;
}