hdu-1113 Word Amalgamation

Word Amalgamation

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3425    Accepted Submission(s): 1686


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 ******
题目意思是字典查询,直接使用map就行了,构成dictionary原词和dictionary原词排序结果的对应关系,再对应去查找。
//
//  main.cpp
//  hdu1113
//
//  Created by Morris on 16/7/14.
//  Copyright © 2016年 Morris. All rights reserved.
//

#include <iostream> 
#include <string> 
#include <vector>
#include <map>
#include <algorithm> 

namespace {
    using std::cin;
    using std::cout;
    using std::endl;
    using std::vector;
    using std::string;
    using std::map;
    using std::sort;
}

int main(int argc, const char *argv[])
{
    string word;
    string tmp;
    map<string, string> dic;
    while (cin >> word, word != "XXXXXX") {
        tmp = word;
        sort(word.begin(), word.end());
        dic[tmp] = word;
    }
    
    int flag = 0;
    string uns;
    while (cin >> uns, uns != "XXXXXX") {
        sort(uns.begin(), uns.end());
        for (map<string, string>::iterator iter = dic.begin(); iter != dic.end(); ++iter)
        {
            if (uns == (*iter).second) {
                cout << (*iter).first << endl;
                flag = 1;
            }
        }
        
        if (flag == 0) {
            cout << "NOT A VALID WORD" << endl;
            cout << "******" << endl;
        }
        else {
            cout << "******" << endl;
        }
        
        flag = 0;
    }
    
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值