#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. PAT甲级 1001 A+B Format

    题目链接:https://pintia.cn/problem-sets/994805342720868352/problems/994805528788582400 1001 A+B Format ( ...

  2. Problem 3: Largest prime factor

    The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 60085 ...

  3. mongo的runCommand与集合操作函数的关系

    除了特殊注释外,本文的测试结果均基于 spring-data-mongodb:1.10.6.RELEASE(spring-boot-starter:1.5.6.RELEASE),MongoDB 3.0 ...

  4. adaboost 参数选择

    先看下ababoost和决策树效果对比 import numpy as np import matplotlib.pyplot as plt from sklearn.model_selection ...

  5. jenkins git ftp 发布.net 项目

    一次搞这个,在其他文章的基础上 添加下自己的 笔记,方便自己查看, -------需要准备的东西--------------- 下载jenkins https://jenkins.io/downloa ...

  6. 连号区间数(2013年第四届c/c++ b组第10题)

    题目描述 标题:连号区间数 小明这些天一直在思考这样一个奇怪而有趣的问题: 在1~N的某个全排列中有多少个连号区间呢?这里所说的连号区间的定义是: 如果区间[L, R] 里的所有元素(即此排列的第L个 ...

  7. 如何制作exe小程序

    1.构建maven项目 需要有一个main入口函数 添加M2_HOME及,java_home的环境变量 打开Preference->Java->Installed JREs->Edi ...

  8. re+正则01

    # 正则 # 正则 ''' 正则就是带语法的字符串, 用来匹配目标字符串得到想要得字符串结果 ''' # 部分语法: # 1.单独字符 # \d 范围 [0-9] # \D 范围刨除 [^0-9] # ...

  9. failed to start process with commandline '%LAUNCHER_PATH% %LAUNCHER_ARGS%', ErrorCode = '0x80070002

    在dotnet core进行开发的时候,需要开发目录直接iis进行部署,然而启动的时候,报异常,我们查看windows下的应用日志发现有个这样的错误信息 Application 'MACHINE/WE ...

  10. Android选择多图上传

    大概是这么个效果,类似与微信朋友圈选择图片的效果,如下图所示 首先,图片预览的这个界面我用的是GridView,当然也可以使用GridLayout,根据需求制定行列即可.同时重写适配器实现末尾是添加图 ...