计蒜客-矩阵翻转

import java.util.Scanner;


public class Main {

    /**
     * @param args
     */
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int x,y,t,j,i;
        x=input.nextInt();

        y=input.nextInt();

        t=input.nextInt();
        int[][] arr = new int[x][y];

        for(i=0;i<x;i++)

            for( j=0;j<y;j++)

                arr[i][j]=input.nextInt();
        if(t==1)
        {
            for( i=x-1;i>=0;i--){

            for( j=0;j<y;j++){

                System.out.print(arr[i][j]+" ");
//              if(j!=y-1)
//                  System.out.print(" ");

            }
            if(i != 0)
            System.out.println();
            }

        }
        else{
            for(i=0;i<x;i++){
                for(j=y-1;j>=0;j--){
                    System.out.print(arr[i][j]+" ");
//                  if(j!=0)
//                      System.out.print(" ");
                }
                if(i!=y-1)
                    System.out.println();

            }
        }


    }

}