因为高精度算法是解决数太大计算时会爆掉类型的问题
所以输入用string,计算时分位计算(有点模拟的味道,也有些技巧性,锻炼对数字的感觉和编码能力)
这一版更准确更清晰
1.高精度加法
#include <iostream>
using namespace std;
int a[203]={0},b[203]={0};
int length;
void fanzhuan(string s,int a[]){
for(int i=1;i<=s.size();i++)a[i]=s[s.size()-i]-'0';
}
void jia(){
for(int i=1;i<=length;i++){
a[i]+=b[i];
a[i+1]+=a[i]/10;
a[i]%=10;
}
}
int main() {
string s1;
string s2;
cin >> s1 >> s2;
length=s1.size()>=s2.size()?s1.size():s2.size()+1;
fanzhuan(s1,a);
fanzhuan(s2,b);
jia();
while (a[length]==0)length--;
for(int i=length;i>=1;i--)cout << a[i];
return 0;
}
2.高精度乘法
#include <iostream>
using namespace std;
int a[203]={0},b[203]={0};
int c[408]={0};
int length;
void fanzhuan(string s,int f[]){
for(int i=1;i<=s.size();i++)f[i]=s[s.size()-i]-'0';
}
void cheng(int l1,int l2){
for(int i=1;i<=l1;i++){
for(int j=1;j<=l2;j++){
c[i+j-1]+=a[i]*b[j];
c[i+j]+=c[i+j-1]/10;
c[i+j-1]%=10;
}
}
}
int main() {
string s1;
string s2;
cin >> s1 >> s2;
length=s1.size()+s2.size();
fanzhuan(s1,a);
fanzhuan(s2,b);
cheng(s1.size(),s2.size());
while (c[length]==0&&length>=2)length--;
for(int i=length;i>=1;i--)cout << c[i];
return 0;
}
3.高精度减法
#include <iostream>
using namespace std;
int a[203]={0},b[203]={0};
int c[408]={0};
int length;
void fanzhuan(string s,int f[]){
for(int i=1;i<=s.size();i++)f[i]=s[s.size()-i]-'0';
}
void jian(int l1){
for(int i=1;i<=l1;i++){
if(a[i]<b[i]){
a[i+1]--;
a[i]+=10;
}
a[i]-=b[i];
}
}
int main() {
string s1;
string s2;
cin >> s1 >> s2;
length=s1.size();
fanzhuan(s1,a);
fanzhuan(s2,b);
jian(s1.size());
while (a[length]==0&&length>=2)length--;
for(int i=length;i>=1;i--)cout << a[i];
return 0;
}
4.高精度除法(高精除高精)
分成减法
如798798468465468
78979879
变成[79879846][8][4][6][5][4][6][8]
再进行减法,减不了就拼接到下一位继续减,保留减的次数(结果),下一位重新计
#include <iostream>
using namespace std;
void fanzhuan(string s,int c[]){
for(int i=1;i<=s.size();i++)c[i]=s[s.size()-i]-'0';
}
string chu(string s1,string s2){
string s3;
int Max=max(s1.size(),s2.size());
int a[Max+1]={0};
int b[Max+1]={0};
fanzhuan(s1,a);
fanzhuan(s2,b);
for(int i=1;i<=Max;i++){
if(a[i]<b[i]){
a[i]+=10;
a[i+1]-=1;}
a[i]-=b[i];
}
while (a[Max]==0&&Max>=2)Max--;
for(int i=Max;i>=1;i--)s3+=(char)(a[i]+'0');
return s3;
}
int main() {
string s1;
string s2;
cin >> s1 >> s2;
int length;
string yv;
length=s1.size()-s2.size()+2;
string a[length+1];
for(int i=1;i<=s2.size();i++)a[1]+=s1[i-1];
for(int i=2;i<=length-1;i++)a[i]=s1[s2.size()-1+i-1];
for(int i=1;i<length;i++){
int ci=0;
while (a[i].size()>s2.size()||(a[i]>=s2&&a[i].size()==s2.size()))
{a[i]=chu(a[i],s2);
ci++;
}
yv=a[i];
if(a[i]!="0")a[i+1]=a[i]+a[i+1];
a[i]=(char)ci+'0';
}
int start=1;
while (a[start]=="0"&&start<length-1)start++;
for(int i=start;i<=length-1;i++)cout << a[i];
cout << endl;
cout << yv;
return 0;
}