3195.txt

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

Source

Problem Id:3195  User Id:fzk 
Memory:48K  Time:62MS
Language:C++  Result:Accepted

Source 

#include <stdio.h>

int num[1000000], n, m;

int search( int l ) {

	int rest = l, r;
	
	while( true ) {
		r = num[m++];
		if( r == l )
			return r;
		if( r > 0 )
			return 0;
		rest += r;
		if( rest <= 0 )
			return 0;
		if( search( -r ) == 0 )
			return 0;
	}
}

int main( ) {
	char c;
	while( (c=getchar())!=EOF ) {
		ungetc( c, stdin );
		for( n=0; (c=getchar())!='\n'; n++ ) {
			ungetc( c, stdin );
			scanf( "%d", num+n );
		}
		m = 1;
		if( num[0] < 0 && search( -num[0] ) && m == n )
			printf( ":-) Matrioshka!\n" );
		else
			printf( ":-( Try again.\n" );
	}
	return 0;
}