简单题：一元一次方程（2025年贵州工程应用技术学院团体天梯赛）

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
void solve();
signed main(){
// 	ios::sync_with_stdio(0);
// 	cin.tie(0),cout.tie(0);
//	int t;
//	cin>>t;
//	while(t--)
		solve();
	return 0;
}
ll st(string s) {
    ll res=0,f=1;
    int i=0;
    if (s[i]=='-') f=-1,i++;
    else if (s[i]=='+') i++;
    for (;i<s.size();++i) {
        res*=10;
        res+=(int)(s[i]-'0');
    }
    return res*f;
}
void solve(){
	string s;
	cin>>s;
	string z,y;
	int f=0;
	s=" "+s;
	for (int i=1;i<=s.size();++i) {
		if (s[i]=='=') {
			f=1;
			continue;
		}
		if (s[i]=='x'&&!(s[i-1]>='0'&&s[i-1]<='9')) {
			if (!f) z+='1';
			else y+='1';
		}
		if (!f) z+=s[i];
		else y+=s[i];
	}
	int zuo=0,you=0,zs=0,ys=0;
	z+='+';y+='+';
//     cout<<z<<'\n';
	for (int i=0;i<z.size()-1;) {
		string tmp;
		tmp+=z[i];i++;
		while(!(z[i]=='+'||z[i]=='-')) tmp+=z[i],i++;
//         cout<<tmp<<'\n';
        while(tmp.back()!='x'&&!(tmp.back()>='0'&&tmp.back()<='9')) tmp.pop_back();
		if (tmp.back()=='x') {
			tmp.pop_back();
			zuo+=st(tmp);
		}else {
			zs+=st(tmp);
		}
    }
    for (int i=0;i<y.size()-1;) {
		string tmp;
		tmp+=y[i];i++;
		while(!(y[i]=='+'||y[i]=='-')) tmp+=y[i],i++;
        while(tmp.back()!='x'&&!(tmp.back()>='0'&&tmp.back()<='9')) tmp.pop_back();
		if (tmp.back()=='x') {
			tmp.pop_back();
			you+=st(tmp);
		}else {
			ys+=st(tmp);
		}
	}
	zuo-=you;ys-=zs;
    double ans=(1.0*ys)/(1.0*zuo);
    if (ans<=0&&ans>=-0.005) printf("x = 0.00\n");
    else printf("x = %.2lf\n",ans);
}