#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define tof_io ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0);
#define double long double
#define int long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define endl '\n'
#define sz(x) x.size()
const int mod = 1e9 + 7; //998244353 1e9+7 1e9+9
const int N = 200 + 1;
const int lg = 23;
const int inf = 1e18;
int fac[N];
int inv[N];
char mat[N][N];
int n ;
int add = 0;
int dnt_pow (int a, int b, int md = mod){int ans = 1; while(b){if(b&1){ans = (a*ans)%md;}a = (a*a)%md;b >>= 1;}return ans ;}
void dnt_bld (){fac[0] = 1; inv[0] = dnt_pow(fac[0],mod-2) ;for(int i = 1 ; i < N ; i++) {fac[i] = (fac[i-1] * i) % mod;inv[i] = dnt_pow( fac[i] , mod-2);}}
int dnt_ncr (int r,int n){if(r>n) return 0; return fac[n] * inv[r] % mod * inv[n-r] % mod;}
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])
{
cout << '.';
}
else
{
cout << mat[i][j];
}
}
cout << endl;
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
440 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
440 KB |
Output is correct |
