uva 644

大家好，又见面了，我是你们的朋友全栈君。

第一次交用的冒泡排序，Re了， 改成快排OK

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <cstdlib>
using namespace std;
char temp[100][10];
int cmp( const void *_a, const void * _b )
{
     char * a = (char*)_a;
     char * b = (char*)_b;
     if( strlen(a) > strlen(b) )
         return 1;
     else if( strlen(a) < strlen(b) )
         return  -1;
     else
         return 0;
};
bool cmp( int i, int j )
{
    int len, k;
    len = strlen( temp[i] );
    for( k = 0; k < len; k++ )
    {
      if( temp[i][k] != temp[j][k] )
          return false;
    }
    return true;
};

int main()
{  

    int n, i, j, k, time = 0, a = 0;
    bool flag;
    char input[10];
    while( scanf( "%s", input ) != EOF )
    {
           flag = false;
           if( input[0] == '9' )
           {
               n = a;
               qsort( temp, n, sizeof(temp[0]), cmp );
               for( i = 0; i < n && !flag; i++ )
                    for( j = i+1; j < n && !flag; j++ )
                         flag = cmp( i, j );                       
               if( flag )
               {
                   cout << "Set " << time+1 << " is not immediately decodable" << endl;   
               }
               else
                   cout << "Set " << time+1 << " is immediately decodable" << endl;
               
               a = 0;
               time++;
           }
           else
               strcpy(temp[a++], input );
    }
    return 0;
}