2572.txt

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

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

Source 

#include"stdio.h"
#include"string.h"
#include"stdlib.h"

char w1[10],w2[10],w3[10];

void rev( char *w )
{
	char *q = w,t;

	while( *q )
		q++;
	q--;
	
	while( w < q )
	{
		t = *w;
		*w = *q;
		*q = t;
		w++,q--;
	}
}


int main()
{
	int a,b,c;
	while( 1 )
	{
		scanf( "%[^+]+%[^=]=%s", w1, w2, w3 ) ;
		rev( w1 );
		rev( w2 );
		rev( w3 );
		a = atoi( w1 );
		b = atoi( w2 );
		c = atoi( w3 );

		if( a + b == c )
			printf( "True\n" );
		else printf( "False\n" );

		if( c == 0 && a == 0 && b == 0 )
			return 0;
	}
	return 0;
}