UVa OJ 642 Word Amalgamation

最新推荐文章于 2014-06-04 20:19:59 发布

原创最新推荐文章于 2014-06-04 20:19:59 发布 · 667 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#AOAPC_1 #水题

UVA_OJ 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一款基于报纸的单词游戏——Jumble，并提供了一个程序解决方案，该程序能够自动解开游戏中混乱排列的单词，帮助玩家找到正确的答案。程序通过读取字典文件并对比混乱单词的所有可能组合来寻找正确答案。

Word Amalgamation

In millions of newspapers across the United States there is a word game called Jumble. The object of this game is to solve a riddle, but in order to find the letters that appear in the answer it is necessary to unscramble four words. Your task is to write a program that can unscramble words.

Input

The input file contains four parts:

a dictionary, which consists of at least one and at most 100 words, one per line;

a line containing XXXXXX, which signals the end of the dictionary;

one or more scrambled `words' that you must unscramble, each on a line by itself; and

another line containing XXXXXX, which signals the end of the file.

All words, including both dictionary words and scrambled words, consist only of lowercase English letters and will be at least one and at most six characters long. (Note that the sentinel XXXXXX contains uppercase X's.) The dictionary is not necessarily in sorted order, but each word in the dictionary is unique.

Output

For each scrambled word in the input, output an alphabetical list of all dictionary words that can be formed by rearranging the letters in the scrambled word. Each word in this list must appear on a line by itself. If the list is empty (because no dictionary words can be formed), output the line ``NOT A VALID WORD" instead. In either case, output a line containing six asterisks to signal the end of the list.

Sample Input

tarp
given
score
refund
only
trap
work
earn
course
pepper
part
XXXXXX
resco
nfudre
aptr
sett
oresuc
XXXXXX

Sample Output

score
******
refund
******
part
tarp
trap
******
NOT A VALID WORD
******
course
******

#include <cstdio>
#include <cstdlib>
#include <cstring>

char dic[101][7];

void bubble_sort(char s[], int n)
{
    for (int i = 0; i < n; ++i)
    {
        for (int j = i+1; j < n; ++j)
        {
            if (s[i] > s[j])
            {
                char t = s[i];
                s[i] = s[j];
                s[j] = t;
            }
        }
    }
}

void dic_sort(char dic[][7], int n)
{
    for (int i = 0; i < n; ++i)
    {
        for (int j = i+1; j < n; ++j)
        {
            if (strcmp(dic[i], dic[j]) > 0)
            {
                char t[7];
                strcpy(t, dic[i]);
                strcpy(dic[i], dic[j]);
                strcpy(dic[j], t);
            }
        }
    }    
}

bool cmp_words(const char word1[7], const char word2[7])
{
    char w1[7], w2[7];
    strcpy(w1, word1);
    strcpy(w2, word2);
    int n1 = strlen(w1), n2 = strlen(w2);
    bubble_sort(w1, n1);
    bubble_sort(w2, n2);
    return strcmp(w1, w2) == 0;
}

int main()
{
    int count = 0;
    char word[7] = "";
    while (scanf("%s", dic[count]) == 1 && strcmp(dic[count], "XXXXXX") != 0)
    {
        ++count;
    }
    dic_sort(dic, count);
    while (scanf("%s", word) == 1 && strcmp(word, "XXXXXX") != 0)
    {
        bool found = false;
        for (int i = 0; i < count; ++i)
        {
            if (cmp_words(word, dic[i]) == true)
            {
                printf("%s\n", dic[i]);
                if (!found)
                    found = true;
            }
        }
        if (!found)
            printf("NOT A VALID WORD\n");
            
        printf("******\n");
    }
    return 0;
}