计蒜客 矩阵翻转

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		
		Scanner scan = new Scanner(System.in);
		int M = scan.nextInt();
		int N = scan.nextInt();
		int T = scan.nextInt();
		int [][]a = new int [M][N];
		for(int i=0;i<M;i++) {
			for(int j=0;j<N;j++) {
				a[i][j] = scan.nextInt();
			}
		}
		if(T==1) {
			for(int i=0;i<M/2;i++) {
				for(int j=0;j<N;j++) {
					int b;
					b = a[i][j];
					a[i][j] = a[M-i-1][j];
					a[M-i-1][j] = b;
				}
			}
			for(int i=0;i<M;i++) {
				for(int j=0;j<N;j++) {
					System.out.print(a[i][j]+" ");
				}
				System.out.println();
			}
		}
		if(T==0) {
			for(int i=0;i<M;i++) {
				for(int j=0;j<N/2;j++) {
					int c;
					c = a[i][j];
					a[i][j] = a[i][N-j-1];
					a[i][N-j-1] = c;
				}
			}
			for(int i=0;i<M;i++) {
				for(int j=0;j<N;j++) {
					System.out.print(a[i][j]+" ");
				}
					System.out.println();
			}
		}
		
	}

}