本地能过，

交了RE；

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
string a[105];
int p[105][10];
int s_i(string ah);
int wei(int u);
int main(){
	int n;
	string x,y;
	cin>>n;
	getchar();
	for(int i=1;i<=n;i++){
		getline(cin,a[i]);
	}

	char c;
	bool f;
	for(int i=1;i<=n;i++){
		x="";
		y="";
		if(a[i][0]>='a'&&a[i][0]<='c'){
			c=a[i][0];
			f=1;
		}
		else{
			f=0;
		}
		if(f==1){
			p[i][1]=c-'a'+1;
			for(int j=2;j<a[i].find(' ',2+1);j++){
				x+=a[i][j];
			}
			for(int j=a[i].find(' ',2+1)+1;j<a[i].size();j++){
				y+=a[i][j];
			}
			p[i][2]=s_i(x);
			p[i][3]=s_i(y);
		}
		if(f==0){
			p[i][1]=c-96;
			for(int j=0;j<a[i].find(' ',0);j++){
				x+=a[i][j];
			}
			for(int j=a[i].find(' ',0)+1;j<a[i].size();j++){
				y+=a[i][j];
			}
			p[i][2]=s_i(x);
			p[i][3]=s_i(y);
		}
	}
	for(int i=1;i<=n;i++){
		if(p[i][1]==1){
			printf("%d+%d=%d\n",p[i][2],p[i][3],p[i][2]+p[i][3]);
			printf("%d\n",wei(p[i][2])+wei(p[i][3])+wei(p[i][2]+p[i][3])+2);
		}
		if(p[i][1]==2){
			printf("%d-%d=%d\n",p[i][2],p[i][3],p[i][2]-p[i][3]);
			printf("%d\n",wei(p[i][2])+wei(p[i][3])+wei(p[i][2]-p[i][3])+2);
		}
		if(p[i][1]==3){
			printf("%d*%d=%d\n",p[i][2],p[i][3],p[i][2]*p[i][3]);
			printf("%d\n",wei(p[i][2])+wei(p[i][3])+wei(p[i][2]*p[i][3])+2);
		}
	}
	return 0;
}

int s_i(string ah){
	int b=0;
	for(int i=0;i<ah.size();i++){
		b=b*10+(ah[i]-'0');
	}
	return b;
}
int wei(int u){
	int num=0;
	if(u==0) return 1;
	if(u<0) num++;
	while(u!=0){
		u=u/10;
		num++;
	}
	return num;
}