1989.cpp

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

/*  This Code is Submitted by wywcgs for Problem 1989 on 2005-09-19 at 21:02:15 */ 
#include <stdio.h>
#include <string.h>

int main()
{
    char word[501][21], *frestr = NULL;
    int repeat[500] = {0};
    int i, j, num, max;
    
    for(num = 0; ; num++) {
        scanf("%s", word[num]);
        if(!strcmp(word[num], "#")) {
            break;
        }    
    }
    max = -1;
    for(i = 0; i < num; i++) {
        for(j = i; j < num; j++) {
            if(repeat[i] != -2) {
                if(!strcmp(word[i], word[j])) {
                    repeat[i]++;
                    if(i != j) {
                        repeat[j] = -2;
                    }    
                }
            }
        }
        if(repeat[i] > max) {
            max = repeat[i];
            frestr = word[i];
        } else if(repeat[i] == max) {
            if(strcmp(word[i], frestr) < 0) {
                frestr = word[i];
            }    
        }
    }
    printf("%s\n", frestr);
    scanf("%d", &i);
    
    return 0;
}