Calculus
试了很多很多次,高数还是忘光了,没想到全部都是收敛的,知道这个就简单了
#include<bits/stdc++.h>
using namespace std;
#define int long long
string split="+";
string s[100];
int pos,k;
signed main() {
int t;
scanf("%lld",&t);
while(t--) {
string strs;
cin>>strs;
strs+=split;
k=0;
int flag=0;
pos = strs.find(split);
while (pos != string::npos) {
string temp = strs.substr(0, pos);
s[k++]=temp;
strs = strs.substr(pos + 1, strs.size());
pos = strs.find(split);
}
for(int i=0; i<k; i++) {
if(s[i][0]!='0') {
cout<<"NO"<<endl;
flag=1;
break;
}
}
if(!flag)cout<<"YES"<<endl;
}
}