题解 | #单组_二维字符数组#

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main(void)
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n,m;
	cin>>n>>m;
	vector<string> a(n);
	for(auto &e:a)
		cin>>e;
	reverse(a.begin(),a.end());
	for(auto &s:a)
		reverse(s.begin(),s.end());
	for(auto &s:a)
		cout<<s<<'\n';
	return 0;
}

import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int n,m,i,j;
        n=sc.nextInt();
        m=sc.nextInt();
        String[] a=new String[n+5];
        for(i=0;i<n;++i)
            a[i]=sc.next();
        for(i=0;i<n/2;++i)
        {
            String tmp=a[i];
            a[i]=a[n-i-1];
            a[n-i-1]=tmp;
        }
        for(i=0;i<n;++i)
            a[i]=new StringBuilder(a[i]).reverse().toString();
        for(i=0;i<n;++i)
            System.out.println(a[i]);
    }
}

n,m=map(int,input().split())
a=[input() for i in range(0,n)]
a.reverse()
for i in range(0,n):
    a[i]=a[i][::-1]
for i in a:
    print(i)