1009.cpp

自己在nankai上面做的一部分题

#include <cstring>
#include <cstdio>
int max(int a,int b)
{
	return a>b? a:b;
}

int main()
{
	int i,length,sign1,sign2,x,y;
	char a[20],b[20];
	int c[21];
	while(scanf("%s%s",&a,&b)!=EOF)
	{
		x=strlen(a);y=strlen(b);
		for (i=0;i<=20;i++) c[i]=0;
		length=max(x,y);
		for (i=0;i<length;i++) 
		{
		
		if (i<x) c[i]+=a[i]-'0';
		if (i<y) c[i]+=b[i]-'0';
		}
		for (i=0;i<length-1;i++) 
		{if (c[i]>=10) {c[i]=c[i]-10;c[i+1]++;}}
		if (c[length-1]>=10) {c[length-1]-=10;c[length]=1;length++;}
		for (i=0;i<length;i++) if (c[i]!=0) {sign1=i;break;}
		//for (i=length-1;i>=sign1;i--) if (c[i]!=0) {sign2=i;break;}
		for (i=sign1;i<length;i++) printf("%d",c[i]);
		printf("\n");
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
	}
	return 1;
}