2286.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2286 on 2006-06-18 at 21:34:16 */ 
#include <cstdio>
#include <cctype>
#include <vector>
#include <algorithm>
using namespace std;

const char P[][8] = { "KQRBNP", "kqrbnp" };
const char KIND[][8] = { "White", "Black" };

vector<int> p[2];

int main()
{
	int i, j;
	char line[64];

	while(gets(line) != NULL) {
		for(i = 0; i < 2; i++) p[i].clear();
		for(i = 7; i >= 0; i--) {
			gets(line);
			for(j = 0; j < 8; j++) {
				int id = 4*j+2, o;
				if(!isalpha(line[id])) continue;
				int bk = !isupper(line[id]), r = i, c = j;
				if(bk) r = 7-r;
				for(o = 0; P[bk][o] != line[id]; o++) ;
				p[bk].push_back((o<<6)|(r<<3)|c);
			}
			gets(line);
		}
		for(i = 0; i < 2; i++) {
			sort(p[i].begin(), p[i].end());
			printf("%s: ", KIND[i]);
			for(j = 0; j < (int)p[i].size(); j++) {
				int k = p[i][j]>>6, r = (p[i][j]>>3)&7, c = p[i][j]&7;
				if(i == 1) r = 7-r;
				if(j != 0) putchar(',');
				if(k != 5) putchar(P[0][k]);
				printf("%c%c", c+'a', r+'1');
			}
			putchar('\n');
		}
	}
	
	return 0;
}