#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 200 + 1;
const int inf = 1e18;
char mat[N][N];
int n;
int mi = inf;
int mx = -inf;
void check(int cur, int id, char f)
{
mat[cur + n][id] = f;
mi = min(mi, cur + n);
mx = max(mx, cur + n);
}
int32_t main()
{
cin >> n;
string s;
cin >> s;
int cur = 0;
int id = 0;
for (auto c : s)
{
if (c == '+')
{
check(cur, id, '/');
cur++;
}
if (c == '-')
{
cur--;
check(cur, id, '\\');
}
if (c == '=')
check(cur, id, '_');
id++;
}
for (int i = mx; i >= mi; i--)
{
for (int j = 0; j < n; j++)
if (!mat[i][j])
printf(".");
else
printf("%c", mat[i][j]);
printf("\n");
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |