#include<stdio.h>
#include<string.h>
#define size 101
int main(void)
{
char bigda[101] = { 0 };
int i, j, k, n,len;
int sum[size];
while (scanf("%d", &n) != EOF)
{
getchar();
for (i = 0; i < n; i++)
{
getchar();
int max = 0;
for (k = 0; k<size;k++)
sum[k] = 0;
do //读取全部数据;
{
gets(bigda); //读入单个数据;
if (strcmp(bigda, "0") == 0) break;
len = strlen(bigda);
if (len>max) max = len; //记录最长数据长度;
for (j = size-1; len>0; j--)
{
sum[j] += bigda[--len] - '0'; //将该数据反转为整数,加到sum上;
} //数据右对齐(将该数据从各位处理);
for (j = size-1; j>size -1 - max; j--) //数据满10进位;
{
sum[j - 1] += sum[j] / 10;
sum[j] %= 10;
}
} while (1);
for (j = 0; j < size; j++) //去0;
{
if (sum[j] != 0) break;
}
for (k = j; k < size; k++) //输出结果;
{
printf("%d", sum[k]);
}
printf("\n");
if (i != n - 1) printf("\n");
}
}
return 0;
}
zoj 1292 Integer Inquiry
最新推荐文章于 2019-09-23 21:41:07 发布