zoukankan      html  css  js  c++  java
  • hdu 1113 Word Amalgamation

    Word Amalgamation

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


    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 ******
     
    Source
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstdlib>
     4 #include <cstring>
     5 using namespace std;
     6 char dic[100+10][20], wor[20];
     7 typedef struct doc{
     8   int id; char a[20];
     9 }Doc; Doc dii[100+10];
    10 int cmp(const void *a, const void *b){
    11   return *(char*)a - *(char *)b;
    12 }
    13 int cmp2(const void *a, const void *b){
    14   return strcmp((char *)a, (char *)b);
    15 }
    16 int main(void){
    17 #ifndef ONLINE_JUDGE
    18   freopen("1113.in", "r", stdin);
    19 #endif
    20   char tem[20]; int i = 0, n;
    21   while (~scanf("%s", tem)){
    22     if (tem[0] == 'X') break;
    23     strcpy(dic[i], tem); i++;
    24   } n = i;
    25   qsort(dic, n, 20*sizeof(char), cmp2);
    26   for (i = 0; i < n; ++i){
    27     strcpy(dii[i].a, dic[i]);
    28     qsort(dii[i].a, strlen(dii[i].a), sizeof(char), cmp); 
    29     dii[i].id = i;
    30   }
    31   while (~scanf("%s", tem)){
    32     if (tem[0] == 'X') break;
    33     qsort(tem, strlen(tem), sizeof(char), cmp); bool flag = false;
    34     for (int i = 0; i < n; ++i){
    35       if (!strcmp(tem, dii[i].a)){
    36         printf("%s\n", dic[dii[i].id]); flag = true;
    37       }
    38     }
    39     if (!flag) printf("NOT A VALID WORD\n");
    40     printf("******\n");
    41   }
    42   return 0;
    43 }

    结构体排序……

    理清思路,掌握qsort的用法就OK,还是卡了很久,原因就是当初没有理清思路啊……想错了

  • 相关阅读:
    指令到底是什么?机器码又是什么?
    汇编基础最后一篇--机器语言指令
    剑指OFFER----面试题34. 二叉树中和为某一值的路径
    剑指OFFER----面试题33. 二叉搜索树的后序遍历序列
    剑指OFFER----面试题32
    剑指OFFER----面试题31. 栈的压入、弹出序列
    剑指OFFER----面试题30. 包含min函数的栈
    剑指OFFER----面试题29. 顺时针打印矩阵
    剑指OFFER----面试题28. 对称的二叉树
    剑指OFFER----面试题27. 二叉树的镜像
  • 原文地址:https://www.cnblogs.com/liuxueyang/p/2955680.html
Copyright © 2011-2022 走看看