Result: Accepted
Time: 5ms
Memory: 1752kB
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
int T;
scanf("%d", &T);
while (T--)
{
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
int mapp[200][200];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
scanf("%d", &mapp[i][j]);
}
}
k %= 4;
if (k == 1)
{
for (int j = 0; j < m; j++)
{
for (int i = n-1; i >= 0; i--)
{
printf("%d", mapp[i][j]);
if (i == 0) printf("\n");
else printf(" ");
}
}
}
else if (k == 2)
{
for (int i = n - 1; i >= 0; i--)
{
for (int j = m - 1; j >= 0; j--)
{
printf("%d", mapp[i][j]);
if (j == 0) printf("\n");
else printf(" ");
}
}
}
else if (k == 3)
{
for (int j = m - 1; j >= 0; j--)
{
for (int i = 0; i < n; i++)
{
printf("%d", mapp[i][j]);
if (i == n-1) printf("\n");
else printf(" ");
}
}
}
else
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
printf("%d", mapp[i][j]);
if (j == m-1) printf("\n");
else printf(" ");
}
}
}
if (T > 0) printf("\n");
}
}
/*
1 2 3
4 5 6
*/