高精度总结，具体细节可以运行看看

#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
string add(string s1,string s2){//高精度加法  
	if(s1.length()<s2.length())return add(s2,s1);
	string s;
	reverse(s1.begin(),s1.end());
	reverse(s2.begin(),s2.end());
	int t=0;
	for(int i=0;i<s1.length();++i){
		t+=s1[i]-'0';
		if(i<s2.length()){
			t+=s2[i]-'0';
		}
		s.push_back(t%10+'0');
		t/=10;
	}
	if(t>0)s.push_back(t+'0');
	while(s.back()=='0')s.pop_back();
	reverse(s.begin(),s.end());
	return s;
}
string _add(string s1,string s2){//高精度减法  
	string s;
	int f=1;
	if(s1==s2)return "0";
	if(s1.length()<s2.length()){
		swap(s1,s2);
		f=0;
	}
	int t=0;
	reverse(s1.begin(),s1.end());
	reverse(s2.begin(),s2.end());
	for(int i=0;i<s1.length();++i){
		t=s1[i]-'0'-t;
		if(i<s2.length()){
			t=t-(s2[i]-'0');
		}
		s.push_back((t+10)%10+'0');
		if(t<0)t=1;
		else t=0;
	}
	int i=0;
	int len=s.length();
	while(s.back()=='0')s.pop_back();
	if(f==0||t==1)s.push_back('-');
	reverse(s.begin(),s.end());
	return s;
}
string mulmi(string s1,ll s2){//高精度与低精度乘法  
	string s="0";
	ll t=0;
	reverse(s1.begin(),s1.end());
	for(int i=0;i<s1.length()||t>0;++i){
		if(i<s1.length())t=t+(s1[i]-'0')*s2;
		s.push_back(t%10+'0');
		t/=10;
	}
	while(s.length()>1&&s.back()=='0')s.pop_back();
	reverse(s.begin(),s.end());
	return s;
}
string mul(string s1,string s2){//高精度与高精度乘法  
	int a[100000]={0};
	reverse(s1.begin(),s1.end());
	reverse(s2.begin(),s2.end());
	for(int i=0;i<s1.length();++i)
	{
		for(int j=0;j<s2.length();++j)
		{
			int d=(s1[i]-'0')*(s2[j]-'0');
			a[i+1+j]+=d;
		}
	}
	string s;
	for(int i=1;i<=99999;++i){
		int d=a[i];
		a[i+1]+=d/10;
		s.push_back(d%10+'0');
	}
	while(s.back()=='0'&&s.length()>1)s.pop_back();
	reverse(s.begin(),s.end());
	return s;
}
string div(string s1,string s2){//高精度与高精度除法  
	int a[100000]={0};
	string s="0",ss="0";
	if(s1.length()<s2.length()||(s1.length()==s2.length()&&s1<s2)){
		return s1;
	}
	for(int i=0;i<s1.length();++i){
		ss=add(ss+'0',to_string(s1[i]-'0')); 
		if(i<s2.length()-1)continue;
		while(1){
			if(ss.length()<s2.length()||(ss.length()==s2.length()&&ss<s2))break;
			ss=_add(ss,s2);
			++a[i];
		}
	}
	int i=0;
	while(a[i]==0)i++;
	while(i<100000){
		s.push_back(a[i]%10+'0');
		if(a[i]>=10)a[i+1]+=a[i]/10;
		i++;
	}
	while(s.back()=='0'&&s.length()>1)s.pop_back();
	if(ss!="0"){
		s+="......"; 
		return s+ss;
	}
	return s;
}
string divmi(string s1,ll s2){//高精度与低精度除法 
	string s="0";
	ll t=0;
	for(int i=0;i<s1.length();++i){
		t=t*10+(s1[i]-'0');
		s.push_back(t/s2+'0');
		t%=s2;
	}
	reverse(s.begin(),s.end());
	while(s.length()>1&&s.back()=='0')s.pop_back();
	reverse(s.begin(),s.end());
	if(t>0)s+="......",s+=to_string(t);
	return s;
}
int main()
{
	string s1,s2;
	cin>>s1>>s2;
	string ss;
	ll d;
	cin>>ss>>d;
	cout<<add(s1,s2)<<endl;
	cout<<_add(s1,s2)<<endl;
	cout<<mul(s1,s2)<<endl;
	cout<<div(s1,s2)<<endl;
	cout<<mulmi(ss,d)<<endl;
	cout<<divmi(ss,d)<<endl;
}