Submission #2529095

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long ll;

using namespace std;

int main(){
    int N;
    cin >> N;
    vector<string> s(N);
    for (int i = 0; i < N; i++){
	cin >> s[i];
    }

    vector<vector<char>> res(N, vector<char>(N));
    for (int i = 0; i < N; i++){
	for (int j = 0; j < N; j++){
	    res[j][N-1-i] = s[i][j];
	}
    }

    for (int i = 0; i < N; i++){
	for (int j = 0; j < N; j++){
	    cout << res[i][j];
	}
	cout << endl;
    }
    
    return 0;
}

Submission Info

Judge Result