Result: Accepted
Time: 5ms
Memory: 1092kB
#include<stdio.h>
int main() {
int T;
int n, m, k;
int num[100][100];
scanf("%d", &T);
while (T--) {
scanf("%d %d %d", &n, &m, &k);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &num[i][j]);
}
}
if (k % 4 == 1) {
for (int i = 0; i<m; i++) {
for (int j = n-1; j >=0; j--) {
printf("%d", num[j][i]);
if (j != 0)
printf(" ");
}
if(i!=m-1||T!=0)
printf("\n");
}
}
else if (k % 4 == 2) {
for (int i = n - 1; i >= 0; i--) {
for (int j = m-1; j >=0; j--) {
printf("%d", num[i][j]);
if (j != 0)
printf(" ");
}
if (i != 0 ||T !=0)
printf("\n");
}
}
else if (k % 4 == 3) {
for (int i = m-1; i>=0; i--) {
for (int j = 0; j < n; j++) {
printf("%d", num[j][i]);
if (j != n- 1)
printf(" ");
}
if (i !=0 || T !=0)
printf("\n");
}
}
else {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
printf("%d", num[i][j]);
if (j != m - 1)
printf(" ");
}
if (i!= n-1|| T !=0)
printf("\n");
}
}
if (T > 0)
printf("\n");
}
}