高精度(杨氏模板)

#include<bits/stdc++.h>
using namespace std;
string str(string s1,string s2){ //高精度减法 
	bool flag=0;
	if((s1.size()==s2.size()&&s1<s2)||s1.size()<s2.size()){
		swap(s1,s2);
		flag=1;
	}
	reverse(s1.begin(),s1.end());
	reverse(s2.begin(),s2.end());
	int cnt=0;
	string str="";
	int k=s2.size();
	for(int i=0;i<s1.size();i++){
		cnt+=(s1[i]-'0');
		if(i<k){
			cnt-=(s2[i]-'0');
		}
		if(cnt<0){
			s1[i+1]--;
			cnt+=10;
		}
		str=char(cnt%10+'0')+str;
		cnt/=10;
	}
	str.erase(0,str.find_first_not_of('0'));
	if(flag==1)str="-"+str;
	if(str.size()==0)str="0";
	return str;
}

void str(string s1,string s2){ //高精度加法 
	if(s1.size()<s2.size())swap(s1,s2);
	reverse(s1.begin(),s1.end());
	reverse(s2.begin(),s2.end());
	int cnt=0;
	string str="";
	int k=s2.size();
	for(int i=0;i<s1.size();i++){
		if(i>=k){
			cnt+=(s1[i]-'0');
		}else{
			cnt+=((s1[i]-'0')+(s2[i]-'0'));
		}
		str=char(cnt%10+'0')+str;
		cnt/=10;
	} 
	if(cnt!=0){
		cout<<cnt;
	}
	cout<<str<<endl;
} 
 
void str(string s1,string s2){//高精度乘法 
	int a[5000],b[5000],c[5000];
	int len1=s1.size(),len2=s2.size();
	for(int i=1;i<=len1;i++)a[i]=s1[len1-i]-'0';
	for(int i=1;i<=len2;i++)b[i]=s2[len2-i]-'0';
	for(int i=1;i<=len1;i++){
		for(int j=1;j<=len2;j++){
			c[i+j-1]+=a[i]*b[j];
		}
	}
	int len=len1+len2;
	int k=1;
	for(int i=1;i<=len;i++){
		if(c[i]>9){
			c[i+1]+=c[i]/10;
			c[i]%=10;
		}
		if(c[i]!=0){
			k=max(k,i);
		}
	}
	if(k==0)cout<<0<<endl;
	for (int i=k;i>=1;--i)cout <<c[i];//输出
}

int main(){
	string s1,s2;
	cin>>s1>>s2;
	cout<<str(s1,s2)<<endl;
	return 0;
}

#include<bits/stdc++.h>//高精度除以单精度
using namespace std;
string st1;
long long s,i,x,n,a[10001],l1,b[10001];
int main(){
    cin >> st1 >> s ;
    l1=st1.size();
    for (i=1;i<=l1;i++)a[i]=int(st1[i-1])-48;
    for (i=1; i<=l1; i++){
        x=x*10+a[i];
        b[i]=x / s;
        x=x % s;
    }
    n=1;
    while (b[n]==0 && n<l1) n++;
    for (i=n; i<=l1; ++i)    cout << b[i] ;
    cout << endl ;
    return 0;
}