0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-14 16:38:46 +00:00
OI-codes/Luogu/problem/P1241/P1241.cpp
2021-01-02 15:30:52 +08:00

48 lines
968 B
C++

#include <bits/stdc++.h>
using namespace std;
char b[105];
int n;
string s;
stack<int> st;
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
st.push(i);
b[i] = ')';
}
if (s[i] == '[') {
st.push(i);
b[i] = ']';
}
if (s[i] == ')' || s[i] == ']') {
if (st.empty() || b[st.top()] != s[i]) {
if (s[i] == ')') {
b[i] = '(';
}
else {
b[i] = '[';
}
}
else {
b[st.top()] = ' ';
st.pop();
}
}
}
for (int i = 0; i < s.size(); i++) {
if (b[i] == '(' || b[i] == '[') {
cout << b[i];
}
cout << s[i];
if (b[i] == ')' || b[i] == ']') {
cout << b[i];
}
}
cout << endl;
return 0;
}