2569.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Problem Id:2569  User Id:fzk 
Memory:116K  Time:15MS
Language:C++  Result:Accepted

Source 

#include"stdio.h"

int ans[128][128];
bool sign[128][128];

int main()
{
	int n,i,j,k,total,x,y;
	char c,w[1000],*q;
	
	while( 1 )
	{
		scanf( "%d", &n );
		if( n == 0 ) break;

		getchar();

		for( i=0; i<128; i++ )
		for( j=0; j<128; j++ )
			ans[i][j] = 0, sign[i][j] = true;
		
		c = getchar();
		total = 0;
		
		while( n-- )
		{
			gets( w );

			for( q = w; *q; q++,total++ )
			{
				ans[c][*q]++;
				c = *q;
			}
		}

		for( k=0; k<5; k++ )
		{
			x = 0, y = 0;
			
			for( i=0; i<128; i++ )
			for( j=0; j<128; j++ )
			if( sign[i][j] && ans[i][j] > ans[x][y] )
				x = i, y = j;

			sign[x][y] = false;
			printf( "%c%c %d %.6lf\n", x, y, ans[x][y], (double)ans[x][y]/total );
		}
		printf( "\n" );
	}

	return 0;
}