字典字符串

最新推荐文章于 2025-05-31 07:00:00 发布

weixin_30439031

最新推荐文章于 2025-05-31 07:00:00 发布

阅读量175

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/nanfenggu/p/7900195.html

本文介绍了一款用于解决报纸上单词游戏Jumble的程序设计思路与实现细节。该程序能够接收一个字典文件和一系列打乱顺序的单词，然后找出所有可以通过重新排列字母构成的有效单词。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
struct asd
{
    char a[10],b[10];
}as[105];
bool cmp(asd a,asd b)
{
    return strcmp(a.a,b.a)<0;
};
int main()
{
    char c[105][10],d[105][10],e[10];
    int i,j,n=0;
    while(scanf("%s",c[n]),strcmp(c[n],"XXXXXX")!=0)
    {
        strcpy(as[n].a,c[n]);
        sort(c[n],c[n]+strlen(c[n]));
        strcpy(as[n].b,c[n]);
        n++;
    }
    sort(as,as+n,cmp);
    while(scanf("%s",&e),strcmp(e,"XXXXXX")!=0)
    {
        int m=0,f=0;
        sort(e,e+strlen(e));
        for(i=0;i<n;i++)
        {
            if(strcmp(e,as[i].b)==0)
            {
                f=1;
                strcpy(d[m++],as[i].a);
            }
        }
        if(f==0)
            printf("NOT A VALID WORD\n");
        else
        {
            for(i=0;i<m;i++)
                printf("%s\n",d[i]);
        }
        printf("******\n");
    }
    return 0;
}