水题不解释,仔细读题皆可
#include<stdio.h>
#include<string.h>
#include<algorithm>
const int maxm=50;
char map[maxm][maxm];
int main()
{
int sum1=0,sum2=0;
for(int i=0; i<8; i++)
{
scanf("%s",map[i]);
}
for(int i=0; i<8; i++)
{
for(int j=0; j<8; j++)
{
if(map[i][j]=='Q')
{
sum1+=9;
}
else if(map[i][j]=='R')
{
sum1+=5;
}
else if(map[i][j]=='B'||map[i][j]=='N')
{
sum1+=3;
}
else if(map[i][j]=='P')
{
sum1+=1;
}
else if(map[i][j]=='q')
{
sum2+=9;
}
else if(map[i][j]=='r')
{
sum2+=5;
}
else if(map[i][j]=='b'||map[i][j]=='n')
{
sum2+=3;
}
else if(map[i][j]=='p')
{
sum2+=1;
}
}
}
if(sum1==sum2)
{
printf("Draw\n");
}
else if(sum1>sum2)
{
printf("White\n");
}
else
{
printf("Black\n");
}
return 0;
}