1089.cpp

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

/*  This Code is Submitted by wywcgs for Problem 1089 on 2005-09-18 at 13:09:00 */ 
#include <stdio.h>
#include <string.h>

int main()
{
    char wordStr[101][10], inputStr[10], *output[100], *temp;
    int word[100][26], input[26];
    int num, i, j, len, find, flag;
    
    for(i = 0; i < 100; i++) {
        for(j = 0; j < 26; j++) {
            word[i][j] = 0;
        }    
    }    
    for(num = 0; ; num++) {
        scanf("%s", wordStr[num]);
        if(!strcmp(wordStr[num], "XXXXXX")) {
            break;
        } else {
            len = strlen(wordStr[num]);
            for(i = 0; i < len; i++) {
                word[num][wordStr[num][i]-'a']++;
            }
        }
    }
    while(1) {
        scanf("%s", inputStr);
        if(!strcmp(inputStr, "XXXXXX")) {
            return 0;
        } else {
            len = strlen(inputStr);
            for(i = 0; i < 26; i++) {
                input[i] = 0;
            }
            for(i = 0; i < len; i++) {
                input[inputStr[i]-'a']++;
            }
            find = 0;
            for(i = 0; i < num; i++) {
                flag = 1;
                for(j = 0; j < 26; j++) {
                    if(input[j] != word[i][j]) {
                        flag = 0;
                        break;
                    }
                }
                if(flag == 1) {
                    output[find] = wordStr[i];
                    find++;
                }
            }
            if(!find) {
                printf("NOT A VALID WORD\n");
            } else {
                for(i = 0; i < find; i++) {
                    flag = 1;
                    for(j = find-1; j > 0; j--) {
                        if(strcmp(output[j], output[j-1]) < 0) {
                            flag = 0;
                            temp = output[j];
                            output[j] = output[j-1];
                            output[j-1] = temp;
                        }    
                    }
                    if(flag == 1) {
                        break;
                    }    
                }
                for(i = 0; i < find; i++) {
                    printf("%s\n", output[i]);
                }    
            }
            printf("******\n");
        }
    }
    
    return 0;
}