Submission #56548771

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll=long long;

int main() {
	int n;
	cin >> n;
  
	vector<string> h(n);
	int m = 0;
	for(int i = 0; i < n; ++i) {
		cin >> h[i];
		m = max(m, (int)h[i].size());
	}

	vector<string> v(m, string(n, '*'));

	for(int i = 0; i < n; ++i){
		int len = h[i].size();
		for(int j = 0; j < len; ++j){
			v[j][n - 1 - i] = h[i][j];
		}
	}

	for(int i = 0; i < m; ++i){
		while(!v[i].empty() && v[i].back() == '*') {
			v[i].pop_back();
		}
	}

	for(int i = 0; i < m; ++i){
		cout << v[i] << endl;
	}

	return 0;
}

Submission Info

Judge Result