Submission #806747

#TimeUsernameProblemLanguageResultExecution timeMemory
806747tlnk07Crtanje (COCI20_crtanje)C++17
40 / 50
2 ms724 KiB
#include<bits/stdc++.h> using namespace std; long long n, pos = 0, maxx = 0, minx = 0; string s; map<int, int> a[101]; int main() { cin >> n >> s; for(int i = 0; i < n; ++i) { if(s[i] == '+') { a[i + 1][pos] = 2; ++pos; } else if(s[i] == '-') { --pos; a[i + 1][pos] = 1; } else if(s[i] == '=') a[i + 1][pos] = 3; maxx = max(pos, maxx); minx = min(pos, minx); } for(int i = maxx - 1; i >= minx; --i) { for(int j = 1; j <= n; ++j) { if(!a[j][i]) cout << "."; else if(a[j][i] == 1) cout << char(92); else if(a[j][i] == 2) cout << "/"; else cout << "_"; } cout << "\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...