toj_2925.cpp

Tianjin University Online Judge 的80多道题目 .

#include<cstdio>
#include<cstring>
#include<cstdlib>
#define MAXNUM 110
int t , n , len;
char word[ MAXNUM ][ 25 ] , 
int gr[ MAXNUM ][ MAXNUM ];

bool diff_1( char w1[] , char w2[] )
{
    static int table[ 30 ];
    int i , j , n_1 , n_m1;
    memset( table , 0 , sizeof( table ) );
    for( i = 0; i < len; i++ ){
        table[ w1[ i ] - 'a' ]++;
        table[ w2[ i ] - 'a' ]--;
    }
    n_1 = 0;
    n_m1 = 0;
    for( i = 0; i < 30; i++ ){
        if( table[ i ] == 1 )
            n_1++;
        else if ( table[ i ] == -1 )
            n_m1++;
        else if ( table[ i ] != 0 )
            break;
    }
    if( i == 30 && n_1 == 1 && n_m1 == 1 )
        return true;
    else
        return false;
}

/*void bfs()
{
  */
         


int main()
{
    int i , j;
    scanf( "%d" , &t );
    scanf( "%d%d" , &n , &len );
    for( i = 0; i < n; i++ )
        scanf( "%s" , word[ i ] );
    memset( gr , 0 , sizeof( gr ) );
    for( i = 0; i < n; i++ )
        for( j = 0; j < n; j++ )
            if( i != j && diff_1( word[ i ] , word[ j ] ) ){
                gr[ i ][ j ] = 1;
                gr[ j ][ i ] = 1;
            }
    for( i = 0; i < n; i++ ){
        for( j = 0; j < n; j++ )
            printf( "%d " , gr[ i ][ j ] );
        printf( "\n" );
    }
    minWord = i;
    
    for( i = 0; i < n; i++ )
    system( "pause" );
    return 0;
}