题目描述
求2个浮点数相加的和
题目中输入输出中出现浮点数都有如下的形式:
P1P2...Pi.Q1Q2...Qj
对于整数部分,P1P2...Pi是一个非负整数
对于小数部分,Qj不等于0
输入
对于每组案例,第1行是测试数据的组数n,每组测试数据占2行,分别是两个加数。
每组测试数据之间有一个空行,每行数据不超过100个字符
输出
每组案例是n行,每组测试数据有一行输出是相应的和。
输出保证一定是一个小数部分不为0的浮点数
样例输入 Copy
2 3.756 90.564 4543.5435 43.25
样例输出 Copy
94.32 4586.7935
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <cmath>
#include <vector>
#include <string.h>
using namespace std;
struct bign{
int d[1000];
int len;
bign(){
memset(d, 0, sizeof(d));
len = 0;
}
};
bign add(bign a, bign b, int &flag){//小数部分相加
if(a.len < b.len){//a是长度比较长的
bign temp = a;
a = b;
b = temp;
}
bign c;
int carry = 0, ans = a.len - b.len;
while(c.len < ans){
c.d[c.len] = a.d[c.len];
c.len++;
}
for(int i = 0; i < b.len; i++){
int temp = a.d[i + ans] + b.d[i] + carry;
c.d[c.len++] = temp % 10;
carry = temp / 10;
}
if(carry != 0) flag = 1;//有进位
//要去除后面的零
int pos = 0, cnt = 0;
while(c.d[pos] == 0) pos++;
int flen = c.len - pos;//最后的长度
while(pos < c.len) c.d[cnt++] = c.d[pos++];
c.len = flen;
return c;
}
bign addint(bign a, bign b){//整数部分相加
bign c;
int carry = 0;
for(int i = 0; i < b.len || i < a.len; i++){
int temp = a.d[i] + b.d[i] + carry;
c.d[c.len++] = temp % 10;
carry = temp / 10;
}
if(carry != 0) c.d[c.len++] = carry;
return c;
}
bign change(string s){
bign c;
int len = s.length();
for(int i = len - 1; i >= 0; i--){
c.d[c.len++] = s[i] - '0';
}
return c;
}
void output(bign a){
for(int i = a.len - 1; i >= 0; i--){
cout << a.d[i];
}
}
int main(int argc, char** argv) {
int n;
string s1, s2;
while(cin >> n){
for(int i = 0; i < n; i++){
cin >> s1 >> s2;
int pos1 = 0, pos2 = 0;
while(s1[pos1] != '.') pos1++;//找.位置
while(s2[pos2] != '.') pos2++;
string s1_int, s2_int, s1_double, s2_double;
s1_int = s1.substr(0, pos1);//求出整数部分
s1_double = s1.substr(pos1 + 1, s1.length() - 1 - pos1);//小数部分
s2_int = s2.substr(0, pos2);
s2_double = s2.substr(pos2 + 1, s2.length() - 1 - pos2);
bign int1 = change(s1_int);
bign int2 = change(s2_int);
bign double1 = change(s1_double);
bign double2 = change(s2_double);
int flag = 0;//标记小数最高位是否进位
bign xiaoshu = add(double1, double2, flag);//小数部分相加
bign zhengshu = addint(int1, int2);//整数部分相加
if(flag){//小数部分有进位
bign x;
x.d[0] = 1;
x.len = 1;
zhengshu = addint(zhengshu, x);//整数部分加1
}
output(zhengshu);
cout << ".";
output(xiaoshu);
cout << endl;
}
}
return 0;
}