Parentheses（模拟）

F - Parentheses

题意

查看一个字符串是否合法，有三种情况，依次判断

#include <string>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <bitset>
#include <cstring>
#include<stack>
#include <algorithm>

using namespace std;
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f

char a[1100];

bool iserror() {
    string s;
    for(int i=0;a[i]!='\0';i++){
        if(a[i]!=' '){
            s+=a[i];
        }
    }
    int num=0;
    int len=s.length();
    for(int i=0;i<len;i++){
        if(s[i]=='('){
            num++;
        } else if(s[i]==')'){
            num--;
        }
        if(num<0){
            return true;
        }
    }
    if(num!=0){
        return true;
    }
    for(int i=1;i<len;i++){
        if(s[i-1]=='*'||s[i-1]=='+'||s[i-1]=='-'||s[i-1]=='/'||s[i-1]=='%'){
            if (s[i]=='*'||s[i]=='+'||s[i]=='-'||s[i]=='/'||s[i]=='%'){
                return true;
            }
        }
        if(s[i-1]<='z'&&s[i-1]>='a'){
            if(s[i]<='z'&&s[i]>='a'){
                return true;
            }
        }
        if(s[i-1]=='('){
            if (s[i]=='*'||s[i]=='+'||s[i]=='-'||s[i]=='/'||s[i]=='%'){
                return true;
            }
        }
        if(s[i-1]=='*'||s[i-1]=='+'||s[i-1]=='-'||s[i-1]=='/'||s[i-1]=='%'){
            if (s[i]==')'){
                return true;
            }
        }
        if(s[i-1]==')'&&s[i]=='('){
            return true;
        }
        if(s[i-1]=='('){
            if(s[i]==')'){
                return true;
            }
        }
    }
    if(s[len-1]=='*'||s[len-1]=='+'||s[len-1]=='-'||s[len-1]=='/'||s[len-1]=='%'){
        return true;
    }
    if(s[0]=='*'||s[0]=='+'||s[0]=='-'||s[0]=='/'||s[0]=='%'){
        return true;
    }
    return false;
}

bool istrue() {
    stack<char> snum;
    int nunm = 0;
    for (int i = 0; a[i] != '\0'; i++) {
        if (a[i] == ' ')continue;
        if (a[i] != ')')snum.push(a[i]);
        else {
            nunm = 0;
            while (snum.top() != '(') {
                nunm++;
                snum.pop();
            }
            snum.pop();
            snum.push('x');
            if (nunm != 3)return false;
        }
    }
    if (snum.size() == 3)return true;
    return false;
}

int main() {
//    while (true) {
        gets(a);
        if (iserror()) {
            cout << "error\n";
        } else if (istrue()) {
            cout << "proper\n";
        } else cout << "improper\n";
//    }
    return 0;
}