1201.cpp

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

/*  This Code is Submitted by wywcgs for Problem 1201 on 2006-03-14 at 18:53:19 */ 
#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;

const int MAX = 512;
const int L = 24;

class Word {
public:
	char letter[L], code[L];
	bool have;
	int make();
	void print() const { if(!have) puts(letter); }
};
int Word::make() {
	if(scanf("%s", letter) == EOF) return 0;
	else if(letter[0] == '#') return -1;
	strcpy(code, letter); int i;
	for(i = 0; code[i] != 0; i++)
		if(isupper(code[i])) code[i] -= 'A' - 'a';
	sort(code, code+i); have = false;
	return 1;
}

bool lcmp(const Word& w1, const Word& w2) { return strcmp(w1.letter, w2.letter) < 0; }
bool ccmp(const Word& w1, const Word& w2) { return strcmp(w1.code, w2.code) < 0; }

int main()
{
	Word word[MAX];
	int i, n;
	
	while(true) {
		for(n = 0; true; n++) {
			int r = word[n].make();
			if(r == 0) return 0;
			else if(r < 0) break;
		}
		sort(word, word+n, ccmp);
		for(i = 1; i < n; i++)
			if(!strcmp(word[i].code, word[i-1].code)) word[i].have = word[i-1].have = true;
		sort(word, word+n, lcmp);
		for(i = 0; i < n; i++) word[i].print();
	}
	
	return 0;
}