toj_2952.cpp

Tianjin University Online Judge 的80多道题目 .

#include<cstdio>
#include<cstring>
#include<cstdlib>
#define MAXNUM 110
char ch[ MAXNUM ][ MAXNUM ];
char tri[ 30 ][ 30 ][ 30 ];

int p[ 255 ][ 2 ];
int n , result;

int main()
{
	int i , j;
	char ch1 , ch2 , ch3;
	scanf( "%d" , &n );
	for( i = 0; i < n; i++ ){
		scanf( "%s" , ch[ i ] );
	}
	for( i = 0; i < 255; i++ )
		p[ i ][ 0 ] = p[ i ][ 1 ] = -1;
		
	for( i = 0; i < n; i++ ){
		for( j = 0;  j < n; j++ ){
			if( ch[ i ][ j ] != '.' ){
				p[ ch[ i ][ j ] ][ 0 ] = i;
				p[ ch[ i ][ j ] ][ 1 ] = j;
			}
		}
	}
	memset( tri , 0 , sizeof( tri ) );
	result = 0;
	for( ch1 = 'A'; ch1 <= 'Z'; ch1++ )
		if( p[ ch1 ][ 0 ] != -1 )
		for( ch2 = ch1 + 1; ch2 <= 'Z'; ch2++ )
			if( p[ ch2 ][ 0 ] != -1 )
			for( ch3 = ch2 + 1; ch3 <= 'Z'; ch3++ )
				if( p[ ch3 ][ 0 ] != -1 )
				if(  ( p[ ch3 ][ 0 ] - p[ ch2 ][ 0 ] ) * ( p[ ch2 ][ 1 ] - p[ ch1 ][ 1 ] ) ==
				( p[ ch2 ][ 0 ] - p[ ch1 ][ 0 ] ) * ( p[ ch3 ][ 1 ] - p[ ch2 ][ 1 ] ) )
					result++;		
	printf( "%d\n" , result );
	system( "pause" );
	return 0;	
}