Word Amalgamation—— 个人c++解

浅浅的花香味﹌ 2022-06-16 02:12 185阅读 0赞

## Problem Description ##

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 contains four parts: 1. a dictionary, which consists of at least one and at most 100 words, one per line; 2. a line containing XXXXXX, which signals the end of the dictionary; 3. one or more scrambled \`words' that you must unscramble, each on a line by itself; and 4. 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<bits/stdc++.h>
    using namespace std;
    struct str
    {
        char a[101],b[101];
    }s[101];
    bool cmp(str e,str r)
    {
        return strcmp(e.a,r.a)<0;
    }
    int main()
    {
        int i,l,j,k,w;
        str q[101];
        w=0;
        for(int i=0;;i++)
        {
            scanf("%s",s[i].a);
            if(strcmp(s[i].a,"XXXXXX")==0)break;
            w++;
            strcpy(s[i].b,s[i].a);
            l=strlen(s[i].b);
            sort(s[i].b,s[i].b+l);
        }
        sort(s,s+w,cmp);
        for(int i=0;;i++)
        {
            scanf("%s",q[i].a);
            if(strcmp(q[i].a,"XXXXXX")==0)break;
            strcpy(q[i].b,q[i].a);
            l=strlen(q[i].b);
            sort(q[i].b,q[i].b+l);
        }
        for(j=0;;j++)
        {
            k=0;
            if(strcmp(q[j].a,"XXXXXX")==0)break;
            for(i=0;;i++)
            {
                if(strcmp(q[j].b,s[i].b)==0)
                {
                    printf("%s\n",s[i].a);
                    k++;
                }
                if(strcmp(s[i].a,"XXXXXX")==0)break;
            }
            if(k==0)
                printf("NOT A VALID WORD\n");
            printf("******\n");
        }
    
        return 0;
    }