HDU1113

最新推荐文章于 2022-02-14 12:30:38 发布

weixin_45655404

最新推荐文章于 2022-02-14 12:30:38 发布

阅读量118

点赞数

本文链接：https://blog.csdn.net/weixin_45655404/article/details/112982501

版权

Jumble游戏单词解谜字典搜索字符串排序 C++实现

关键词由CSDN通过智能技术生成

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

分析：这个题是20级的训练。。。一个map+sort，只要能想到这么用基本都可以的

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <map>
#include <string>
#include <algorithm>
using namespace std;

int main()
{
    string s,t;
    map<string,string>m;
    int flag;

    while(cin>>s)
    {
        if(s=="XXXXXX") break;

        t=s;
        sort(s.begin(),s.end());
        m[t]=s;//下标中存的是原来的字符串 数组中存的是排序后的数
    }

    while(cin>>s)
    {
        if(s=="XXXXXX") break;

        flag=0;
        sort(s.begin(),s.end());
        map<string,string>::iterator it;
        for(it=m.begin();it!=m.end();it++)
        {
            if(s==it->second)
            {
                cout<<it->first<<endl;
                flag=1;
            }
        }
        if(flag==0) cout<<"NOT A VALID WORD"<<endl;
        cout<<"******"<<endl;
    }
    return 0;
}