难度:3
递归的应用,
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
string solve() {
string s = "", x;
char c;
int t;
while (cin >> c) {
if (c == '[') {
cin >> t;
x = solve();
while (t--) s += x;
} else if (c == ']') {
return s;
} else {
s += c;
}
}
return s;
}
int main() {
cout << solve();
return 0;
}