1326.txt

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

//////////////////////////////////////////////////
//Mileage Bank
//
//

#include"stdio.h"

int main()
{
	char city1[100], city2[100], type;
	int total, distance;
	
	while( 1 )
	{
		total = 0;
	
		while( 1 )
		{
			scanf( "%s", city1 );
			
			if( ( city1[0] == '0' || city1[0] == '#' ) && city1[1] == '\0' )
				break;
			
			scanf( "%s %d %c", city2, &distance, &type );
		
			switch ( type )
			{
				case 'F' : total += distance * 2; break;
				case 'B' : total += distance + ( distance + 1 ) / 2; break;
				default  : total += ( distance < 500 ) ? 500 : distance; break;
			}	
		}
		
		if( city1[0] == '#' ) break;
		printf( "%d\n", total );
	}

	return 0;

}