#include <stdio.h>
#include <string.h>
#define MaxSize 10000
int n1, n2, i, k, times;
char symbol;
char data1[MaxSize], data2[MaxSize];
int max(int n1, int n2){
if(n1 > n2)
return n1;
else
return n2;
}
void getchars_two(char data_one[MaxSize], char data_two[MaxSize]) {
int n;
scanf("%s%s",data1, data2);
n1 = n = strlen(data1);
for(i = ; i < n; ++i){
data_one[i] = data1[n - i - ];
}
n2 = n = strlen(data2);
for(i = ; i < n; ++i){
data_two[i] = data2[n - i - ];
}
if(n1 > n2)
for(i = n2; i < n1; ++i){
data_two[i] = '';
}
else
for(i = n1; i < n2; ++i)
data_one[i] = '';
}
void getchars_one(char data_one[MaxSize], char data_two[MaxSize]) {
char data[MaxSize];
int n;
gets(data);
n1 = n = strlen(data);
for(i = ; i < n; ++i){
data_one[i] = data[n - i - ];
}
gets(data);
n2 = n = strlen(data);
for(i = ; i < n; ++i){
data_two[i] = data[n - i - ];
}
if(n1 > n2)
for(i = n2; i < n1; ++i){
data_two[i] = '';
}
else
for(i = n1; i < n2; ++i)
data_one[i] = '';
}
void big_data_jia(char data_one[MaxSize], char data_two[MaxSize], char data_three[MaxSize]){
char data_jin;
int Max, value;
data_jin = '';
Max = max(n1, n2);
for(i = ; i < Max; ++i){
value = (int)data_one[i] + (int)data_two[i] + (int)data_jin - ;
if(value < ){
data_three[i] = (char)(value + );
data_jin = '';
}
else{
data_three[i] = (char)(value % + );
data_jin = (char)(value / + );
}
}
if(data_jin != '')
data_three[i++] = data_jin;
}
void print_char(char data_three[MaxSize]){
int j;
printf("%s + %s = ", data1, data2);
j = i - ;
if(data_three[j] == '') {
printf("0\n");
return ;
}
for(; j >= ; j--){
printf("%c", data_three[j]);
}
printf("\n");
if(k != times)
printf("\n");
}
int main(int argc, char const *argv[])
{
scanf("%d\n", &times);
for(k = ; k <= times; ++k){
char data_one[MaxSize], data_two[MaxSize], data_three[MaxSize];
getchars_two(data_one, data_two);
big_data_jia(data_one, data_two, data_three);
printf("Case %d:\n", k);
print_char(data_three);
}
return ;
}

BigData_Jia的更多相关文章

随机推荐

  1. 将springboot打包成的jar文件做成windows服务,解决java程序自启动问题

    https://blog.csdn.net/weixin_40411331/article/details/80193376 https://blog.csdn.net/qq_33188180/art ...

  2. spring security 学习

    1.默认登录   user  /df1fc617-bb94-494e-8adb-0234046bf092 取消校验 在启动类上添加下面的注解 @EnableAutoConfiguration(excl ...

  3. ffmpeg使用示例

    /* 视频格式转换 ffmpeg -i "F:\Test\1.mp4" -y -vcodec copy -acodec copy "F:\Test\11.avi" ...

  4. clusterware启动顺序——CSS

    CSS层面 1.ocssd.bin守护进程 该层面最主要的工作就是启动ocssd.bin守护进程.使本地节点能够成功地加入集群.ocssd.bin守护进程的启动过程可以通过以下的图形进行描述. ::: ...

  5. Problem 7: 10001st prime

    By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. ...

  6. The Preliminary Contest for ICPC China Nanchang National Invitational I题

    Alice has a magic array. She suggests that the value of a interval is equal to the sum of the values ...

  7. L358 World Book Day

    World Book Day is celebrated by UNESCO and other related organisations every year on the 23rd of Apr ...

  8. HTML语言发展史

    .发展时间线 1982年,Tim Berners-Lee 建立 HTML 1993年,大學生的 Marc Andreessen 在他的 Mosaic 浏览器加入 标记,从此可以在Web頁面上浏览图片 ...

  9. linux查看日志文件命令

    转:https://www.cnblogs.com/zdz8207/p/linux-log-tail-cat-tac.html linux查看日志文件内容命令tail.cat.tac.head.ech ...

  10. 网易2019校招内推编程题-瞌睡-C++实现

    [编程题] 瞌睡 时间限制:1秒 空间限制:262144K 小易觉得高数课太无聊了,决定睡觉.不过他对课上的一些内容挺感兴趣,所以希望你在老师讲到有趣的部分的时候叫醒他一下.你知道了小易对一堂课每分钟 ...