Submission #2972997

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <climits>
#include <algorithm>
#include <set>
#include <unordered_map>
#include <queue>
#include <iomanip>
#include <map>
#include <utility>

#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define ll long long
#define P pair<int, int>

using namespace std;
int mod = 1000000007;

int n;

int main() {
  cin >> n;
  char mat[n][n];
  rep(i, n) {
    rep(j, n) {
      cin >> mat[i][j];
    }
  }

  rep(i, n) {
    rep(j, n) {
      cout << mat[n-1-j][i];
    }
    cout << endl;
  }
}

Submission Info

Judge Result