Matrix flip (array simulation)

problem

Xiaomeng is currently working on an application for flipping pictures , You may also know , The picture is actually made up of dots . therefore , Xiaomeng wants to make a program that can flip the matrix first , To solve the core of his problem .

Input format

The first line of input includes integers separated by spaces  M,N,T(0 < N,M < 200)M,N,T(0<N,M<200),TT  The value of is  00  or  11. among  MM  and  NN  Respectively represent the number of rows and columns of the matrix to be processed ,TT  by  00  Hour means turning left and right , by  11  Hour means to flip up and down .

After that  MM  That's ok , Each line includes  NN  It's an integer , Input the data of each row of the matrix in turn .

Output format

The output includes  MM  That's ok  NN  Column , Each number is separated by a space , There is a space at the end of each line , It represents the matrix after turning as required .

The sample input

4 4 1
1 2 3 4
5 6 7 8
9 0 1 2
3 4 5 6

Sample output

3 4 5 6 
9 0 1 2 
5 6 7 8 
1 2 3 4 

Directly simulate with array .

#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN = 210;
int mp[MAXN][MAXN];
int main() {
    int m, n, t;
    scanf("%d %d %d", &m, &n, &t);
    for(int i = 0; i < m; i++) {
        for(int j = 0; j < n; j++) {
            scanf("%d", &mp[i][j]);
        }
    }
    if(t == 1) {
        for(int i = m - 1; i >= 0; i--) {
            for(int j = 0; j < n; j++) {
                printf("%d ", mp[i][j]);
            }
            printf("\n");
        }
    } else {
        for(int i = 0; i < m; i++) {
            for(int j = n - 1; j >= 0; j--) {
                printf("%d ", mp[i][j]);
            }
            printf("\n");
        }
    }
    return 0;
}