UVa 156 反语片

/*

* 解题思路:

* 经典的字母重排问题，忽略大小写的比较，如果输入没有该单词对应的其他重排单词，则原单词输出

*/

#include 
  
   
#include 
   
     #include 
    
      #include 
     
       #define A 1000 char s1[ A ][ A ],s2[ A ][ A ]; char s3[ A ][ A ]; int p,q; int cmp_char( const void *_a , const void *_b ) { char *a = (char * )_a; char *b = (char* )_b; return *a-*b; } int cmp_string( const void *_a , const void *_b ) { char * a = (char *)_a; char *b = (char * )_b; return strcmp( a , b ); } int search( int x ) { int i,j; for( i=0;i