ACM-I'll play a trick on you

最新推荐文章于 2022-03-22 17:45:48 发布

原创最新推荐文章于 2022-03-22 17:45:48 发布 · 739 阅读

0 ·

CC 4.0 BY-SA版权

ACM 专栏收录该内容

87 篇文章

订阅专栏

本文介绍了一个关于处理大数加法的编程挑战，通过字符串形式的两个整数A和B，实现它们的相加并输出结果。文章提供了一段C++代码示例，展示了如何逐位读取字符并转换为整数进行求和。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

描述

Please look the picture carefully. Then I'll give you two integers and your task is output the third one.
Please never doubt the picture.

输入

The first line is a number T(1<=T<=30), represents the number of case. The next T blocks follow each indicates a case.
Each case contains two integers A,B (1<=B<=A<=10^100)

输出

For each case, output the number of case and the third integer.

样例输入

样例输出

27
18
21

代码：

#include<iostream>
#include<string>
using
namespace std;
int
main()
{
int
t;
cin>>t;
while(t--)
{
string a,b;
int
i,sum=0;
cin>>a>>b;
for(i =0;i <a.length();i++)
sum += a[i] -'0';
for(i = 0;i < b.length();i++)
sum += b[i] -'0';
cout<<sum<<endl;
}
return
0;
}