PKUKY150 浮点数加法

PKUKY150 浮点数加法

⭐️难度：简单
⭐️类型：字符串，基础数学

📖题目：题目链接

📚题解：

#include<stdio.h>#include<iostream>#include<string>usingnamespacestd;stringGetInteger(string a){returna.substr(0,a.find('.'));}stringGetFraction(string a){returna.substr(a.find('.')+1,a.size()-a.find('.'));}// 使用引用参数 返回信息voidFractionPlus(string&res,int&carry,string fa,string fb){intsize=max(fa.size(),fb.size());while(fa.size()<size){fa.push_back('0');}while(fb.size()<size){fb.push_back('0');}res.resize(size);//给res申请内存空间carry=0;for(inti=size-1;i>=0;--i){// '0' = '0'// '3' = '0' + 3if(fa[i]+fb[i]+carry-'0'>'9'){res[i]=fa[i]+fb[i]+carry-'0'-10;carry=1;}else{res[i]=fa[i]+fb[i]+carry-'0';carry=0;}}return;}voidIntegerPlus(string&res,intcarry,string ia,string ib){res.clear();for(inti=ia.size()-1,j=ib.size()-1;i>=0||j>=0||carry==1;--i,--j){if(i>=0&&j>=0){if(ia[i]+ib[j]+carry-'0'>'9'){res.insert(res.begin(),ia[i]+ib[j]+carry-'0'-10);carry=1;}else{res.insert(res.begin(),ia[i]+ib[j]+carry-'0');carry=0;}}elseif(i>=0&&j<0){if(ia[i]+carry>'9'){res.insert(res.begin(),ia[i]+carry-10);carry=1;}else{res.insert(res.begin(),ia[i]+carry);carry=0;}}elseif(i<0&&j>=0){if(ib[j]+carry>'9'){res.insert(res.begin(),ib[j]+carry-10);carry=1;}else{res.insert(res.begin(),ib[j]+carry);carry=0;}}else{res.insert(res.begin(),'1');carry=0;}}return;}intmain(){//string a = "12345.6789"; // "11"//string b = "333.33333"; // "99"chararra[1000]={0};chararrb[1000]={0};while(scanf("%s%s",arra,arrb)!=EOF){string a=arra;string b=arrb;string ia=GetInteger(a);string ib=GetInteger(b);string fa=GetFraction(a);string fb=GetFraction(b);string fres;intcarry;FractionPlus(fres,carry,fa,fb);string ires;IntegerPlus(ires,carry,ia,ib);printf("%s.%s\n",ires.c_str(),fres.c_str());}return0;}