UVa OJ

 Ananagrams 

Most crossword puzzle fans are used to anagrams--groups of words with the same letters in different orders--for example OPTS, SPOT, STOP, POTS and POST. Some words however do not have this attribute, no
matter how you rearrange their letters, you cannot form another word. Such words are called ananagrams, an example is QUIZ.

Obviously such definitions depend on the domain within which we are working; you might think that ATHENE is an ananagram, whereas any chemist would quickly produce ETHANE. One possible domain would be the entire
English language, but this could lead to some problems. One could restrict the domain to, say, Music, in which case SCALE becomes a relative ananagram (LACES is not in the same domain) but NOTE is not since it can produce TONE.

Write a program that will read in the dictionary of a restricted domain and determine the relative ananagrams. Note that single letter words are, ipso facto, relative ananagrams since they cannot be ``rearranged''
at all. The dictionary will contain no more than 1000 words.

Input

Input will consist of a series of lines. No line will be more than 80 characters long, but may contain any number of words. Words consist of up to 20 upper and/or lower case letters, and will not be broken across
lines. Spaces may appear freely around words, and at least one space separates multiple words on the same line. Note that words that contain the same letters but of differing case are considered to be anagrams of each other, thus tIeD and EdiT are anagrams.
The file will be terminated by a line consisting of a single #.

Output

Output will consist of a series of lines. Each line will consist of a single word that is a relative ananagram in the input dictionary. Words must be output in lexicographic (case-sensitive) order. There will always
be at least one relative ananagram.

Sample input

ladder came tape soon leader acme RIDE lone Dreis peat
 ScAlE orb  eye  Rides dealer  NotE derail LaCeS  drIed
noel dire Disk mace Rob dries
#

Sample output

Disk
NotE
derail
drIed
eye
ladder
soon

给你一系列字符串，以“#”结束

然后对这些单词进行筛选，若一个单词的字母可以进行重排列形成另一个单词，这两个单词相关

最后输出没有相关的单词

可以用c++里面的string来处理字符串，相对比较方便。发现string必须要在using namespace std; 的声明下面才能使用

用一个结构体来记录，word.x来记录元单词，word.y来记录全部变为小写之后的并且按照字母大小顺序排列好的单词

然后把没有重复的筛选出来

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<ctype.h>
#include<string>
using namespace std;
struct node
{
    string x;
    string y;
} word[1050];
string output[10050];
bool cmp(node s,node v)
{
    return s.y<v.y;
}
int main ()
{
    char ch,t=0,i,j=1,k;
    while(ch=getchar())
    {
        if (ch=='#') break;
        if (isalpha(ch))
        {
            j=0;
            word[t].x+=ch;
            word[t].y+=tolower(ch);
        }
        else if (j==0)
        {
            j=1;
            sort(word[t].y.begin(),word[t].y.end());
            t++;
        }
    }
    sort(word,word+t,cmp);
    i=0,j=0,k=0;
    while(i<t)
    {
        if (word[i].y==word[i+1].y) j++;
        else
        {
            if (j==0) output[k++]=word[i].x;
            j=0;
        }
        i++;
    }
    sort(output,output+k);
    for (i=0; i<k; i++)
        cout<<output[i]<<endl;
    return 0;
}