zoukankan      html  css  js  c++  java
  • HDU_1113_字符串处理

    Word Amalgamation

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


    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
    ******
     
    题意:先给一个字典,在给字符串,用这个字符串在字典中找用这些字符组成的词条。
    sort可以给string排序。
    map<string,string>词条和该词条字符排序后的字符串的映射。
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<stdlib.h>
    #include<algorithm>
    #include<cmath>
    #include<string>
    #include<map>
    using namespace std;
    
    map<string,string>m;
    
    void input()
    {
        string a,b;
        while(1)
        {
            cin>>a;
            if(a=="XXXXXX")
                break;
            b=a;
            sort(a.begin(),a.end());
            m[b]=a;
        }
    }
    
    void deal()
    {
        string a;
        while(1)
        {
            cin>>a;
            if(a=="XXXXXX")
                break;
            sort(a.begin(),a.end());
            map<string,string>::iterator it;
            int flag=0;
            for(it=m.begin(); it!=m.end(); it++)
            {
                if(it->second==a)
                {
                    flag=1;
                    cout<<it->first<<endl;
                }
            }
            if(!flag)
                printf("NOT A VALID WORD
    ");
            cout<<"******"<<endl;
        }
    }
    
    int main()
    {
        input();
        deal();
        return 0;
    }
  • 相关阅读:
    2008俱乐部高校行之中南民族大学
    [更新]MSDN中Webcast "WPF中的图形系统系列" 课程预告及反馈
    7月20日 武汉.NET俱乐部在线沙龙!
    2007武汉.NET俱乐部沙龙VS2008、WPF、Silverlight
    MSDN新年第一次WebCast总结
    [评]Microsoft Visual Web Developer 2008 Step by Step, Express Edition
    [老爸创作的歌词]我从瓦砾中站起
    [Expert MS IL Assembler]武汉.NET俱乐部在线沙龙与线下聚会
    2008开年大礼:《Application = Code + Markup》中文版面世
    2009武汉.NET俱乐部活动之黄冈站
  • 原文地址:https://www.cnblogs.com/jasonlixuetao/p/5914523.html
Copyright © 2011-2022 走看看