1002/大数加法

最新推荐文章于 2020-02-02 15:34:19 发布

xicq

最新推荐文章于 2020-02-02 15:34:19 发布

阅读量383

点赞数

分类专栏： ACM/HDOJ 文章标签： ACM HDOJ 1002

本文链接：https://blog.csdn.net/xiongchuquan/article/details/22308847

版权

ACM/HDOJ 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

对比别人写的代码他人代码

以下是自己写的

# include <iostream>
# include <malloc.h>
# include <string.h>
using namespace std;

# define TASE_NUM 20
# define STR_LEN 1005
char * res[TASE_NUM];
void f(char * a,char * b,int i)
{
	int len_a,len_b,len_big,len_small;
	res[i] = (char *)malloc(sizeof(char) * STR_LEN);
	int   j,n=0;
	char flag = '0';
	char * big;
	char * small;
	len_a = strlen(a);
	len_b = strlen(b);

	if(len_a >= len_b )
	{
		len_big = len_a;
		len_small = len_b;
		big = a;
		small = b;
	}
	else
	{
		len_big = len_b;
		len_small = len_a;
		big = b;
		small = a;
	}


	for(j = len_big;j > 0; --j )
	{
		--len_big;
		--len_small;
		if(len_small >= 0)
		{
		(*(res+i))[n] = ( *(big+len_big) - '0' + *(small + len_small) - '0' + flag -'0' ) % 10 + '0';
		flag = ( *(big+len_big) - '0' + *(small + len_small) - '0' + flag-'0') / 10 +'0' ;
		n++;
		}
		else
		{
			(*(res+i))[n] = ( *(big+len_big) - '0' +  flag -'0') % 10 +'0';
			flag = ( *(big+len_big) - '0' + flag-'0') / 10+'0';
			n++;
		}
	}
	if(flag-'0' > 0)
		(*(res+i))[n] = flag;
	else
		--n;
	if(i>0)
		cout<<endl;
	cout<<"Case "<<(i+1)<<":"<<endl;
	cout<<a<<" + "<<b<<" = ";
	for( ;n >= 0;--n)
		cout<<( (*(res+i))[n]);
	cout<<endl;
	
	
	
}
int main()
{
	int tase_num;
	int i;
	char * str_a[TASE_NUM];
	char * str_b[TASE_NUM];

	cin>>tase_num;
	for(i = 0; i < tase_num; ++i)
	{
		str_a[i] = (char*)malloc(sizeof(char) * STR_LEN);
		str_b[i] = (char*)malloc(sizeof(char) * STR_LEN);
		cin>>str_a[i]>>str_b[i];


	}
	for(i = 0; i < tase_num; ++i)
	{
		f(str_a[i],str_b[i],i);
	}


	return 0;
}