80分救助大佬

#include<bits/stdc++.h>
using namespace std;
struct we{
	char a;
	long s,d,sum;
};
long zhuan(char as[100]){//将字符数组转换为long类型
	int t=1,i,s,qw;
long sum;
	s=strlen(as);
	for(i=s-1;i>=0;i--){
	qw=(as[i]-'0')*t;
		sum+=qw;
		t*=10;
	}
	return sum;
}
int shu(int a){//求数字的长度
	int sum=0;
	for(;a!=0;){
		a/=10;sum++;
	}
	return sum;
}

int main(){
	int i,w;
	cin>>w;
	we sd[w];
	char q[100];
	for(i=0;i<w;i++){
		cin>>q;
		if(q[0]>='1'&&q[0]<='9')
		{
			sd[i].a=sd[i-1].a;
			cin>>sd[i].d;
			sd[i].s=zhuan(q);
		}
		else {
		sd[i].a=q[0];cin>>sd[i].s>>sd[i].d;		
	}}
		for(i=0;i<w;i++){
			if(sd[i].a=='a'){
				sd[i].sum=sd[i].s+sd[i].d;
				cout<<sd[i].s<<"+"<<sd[i].d<<"="<<sd[i].sum<<endl;
			}
			if(sd[i].a=='b'){
				sd[i].sum=sd[i].s-sd[i].d;
				cout<<sd[i].s<<"-"<<sd[i].d<<"="<<sd[i].sum<<endl;
			}
			if(sd[i].a=='c') {
				sd[i].sum=sd[i].s*sd[i].d;
				cout<<sd[i].s<<"*"<<sd[i].d<<"="<<sd[i].sum<<endl;
			}
			
			if(sd[i].sum<0)
			cout<<shu(sd[i].s)+shu(sd[i].d)+shu(fabs(sd[i].sum))+3<<endl;
			else cout<<shu(sd[i].s)+shu(sd[i].d)+shu(fabs(sd[i].sum))+2<<endl;}

	return 0;
}