hdu1230-火星A+B

http://acm.hdu.edu.cn/showproblem.php?pid=1230

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>

using namespace std ;

int prime[ 30 ] ;
int num[ 30 ];

void Prime()
{
	memset( num , 0 , sizeof( num ) );
	int i  , j ; 
	int t = 1 ;
	for( i = 2 ; i < 100 ; i++ )
	{
		if( !num[ i ] && t < 30 )
		{
			prime[ t++ ] = i ;
			for( j = i ; j < 100 ; j += i )
			{
				if( !num[ j ] )
					num[ j ] = 1 ;
			} 	
		}
	}
}

int a[ 100 ] , b[ 100 ] , ans[ 100 ] ;
int main()
{
	Prime();
	while( true )
	{
		memset( a , 0 , sizeof( a ) ) ;
		memset( b , 0 , sizeof( b ) ) ;
		int l1 = 0 ;
		char c ;
		while( true )
		{
			scanf( "%d%c" , &a[ ++l1 ] , &c ) ;
			if( c == ' ' )
				break ;
		}
		int l2 = 0 ;
		while( true )
		{
			scanf( "%d%c" , &b[ ++l2 ] , &c ) ;
			if( c == '\n' )
				break ;
		}
		if( ( a[ 1 ] + b[ 1 ] ) == 0 )
			break;
		int i , j ;
		int len = l1 > l2 ? l1 : l2 ;
		for( i = 1 ; i <= l1 / 2 ; i++ )
			swap( a[ i ] , a[ l1 - i + 1 ] ) ;
		for( i = 1 ; i <= l2 / 2 ; i++ )
			swap( b[ i ] , b[ l2 - i + 1 ] ) ;
		int temp = 0 , k = 0 ;
		for( i = 1 ; i <= len ; ++i )
		{
			k++ ;
			ans[ k ] = temp + a[ i ] + b[ i ] ;
			temp = ans[ k ] / prime[ i ] ;
			ans[ k ] %= prime[ i ] ;
		}
		while( temp )
		{
			k++ ;
			ans[ k ] = temp % prime[ k ] ;
			temp = temp / prime[ k ] ;
			
		}
		for( i = k ; i > 1 ; --i )
			printf( "%d," ,ans[ i ] ) ;
		printf( "%d\n" , ans[ 1 ] ) ;
	}	
	return 0 ;

}