3095.txt

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

Source

Problem Id:3095  User Id:fzk 
Memory:24K  Time:0MS
Language:C++  Result:Accepted

Source 

#include <stdio.h>

char w[100];

bool check( int k, int to ) {
	for( k+=to; k>=0 && w[k]; k+=to ) {
		if( w[k] == '.' )
			return true;
		else if( w[k] != '_' )
			return false;
	}
	return true;
}

int main( ) {
	int i, s;
	while( scanf( "%s", w ) == 1 && w[0] != '#' ) {
		s = 0;
		for( i=0; w[i]; i++ ) {
			if( w[i] == '.' )
				s += 100;
			else if( w[i] == '_' )
				;
			else if( w[i] == '/' )
				s += 100*check( i, -1 );
			else if( w[i] == '\\' )
				s += 100*check( i, 1 );
			else
				s += 50*check( i, 1 ) + 50*check( i, -1 );
		}
		printf( "%d\n", s/i );
	}
	return 0;
}