uva 424 - Integer Inquiry

大数加法

#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;
int main()
{
#ifdef LOCAL
freopen("in.txt","r",stdin);
#endif // LOCAL
char str_1[105][105];
int len[105],i,j,k,maxn = 0;
char str_2[105][105],s[105];
memset(str_1,0,sizeof(str_1));
memset(str_2,0,sizeof(str_2));
for(i = 0; ; i++)
{
gets(str_1[i]);
maxn=max(len[i] = strlen(str_1[i]),maxn);
if(str_1[i][0]=='0'&&str_1[i][1]=='\0')break;
int t = 0;
for(j = len[i]-1; j >= 0; j--)
str_2[i][t++] = str_1[i][j];
}
int N = i;
int c = 0;
for(i = 0; i < maxn; i++)
{
for(j = 0; j < N; j++)
c +=str_2[j][i]-'0';
s[i] = c%10 + '0';
c /=10;
}
while(c>0)
{
s[i++] = c%10 + '0';
c /=10;
}
int len_s = i;
for(i = len_s-1; i >= 0; i--)
printf("%c",s[i]);
printf("\n");
return 0;
}