Start: Jun, 26, 2019 08:30:00
2019年度暑期短学期第一天
End: Jun, 26, 2019 11:30:00
Time elapsed:
Time remaining:

Problem_ID: A
Result: Accepted
Time: 5ms
Memory: 1716kB
Author: 2018212212136
In contest: 1273

#include<bits/stdc++.h>
using namespace std;
const int maxx = 110;
int main()
{
	int t;
	int n,m,k;
	int arr[maxx][maxx];
	scanf("%d",&t);
	int f=0;
	while(t--)
	{
		if(f++)	puts("");
		scanf("%d %d %d",&n,&m,&k);
		for(int i = 1;i <= n;i++)
		{
			for(int j = 1;j <= m;++j)
			{
				scanf("%d",&arr[i][j]);
			}
		}
		if(k%4 == 1)
		{
			for(int i = 1;i <= m;++i)
			{
				for(int j = n;j > 0;--j)
				{
					printf("%d",arr[j][i]);
					if(j > 1)
						printf(" ");
				}
					printf("\n");
			}
		}
		else if(k%4 == 2)
		{
			for(int i = n;i > 0;--i)
			{
				for(int j = m;j > 0;--j)
				{
					printf("%d",arr[i][j]);
					if(j > 1)
						printf(" ");
				}
				printf("\n");
			}
		}
		else if(k%4 == 3)
		{
			for(int i = m;i > 0;--i)
			{
				for(int j = 1;j <= n;++j)
				{
					printf("%d",arr[j][i]);
					if(j < n)
						printf(" ");
				}
				printf("\n");
			}
		}
		else
		{
			for(int i = 1;i <= n;++i)
			{
				for(int j = 1;j <= m;++j)
				{
					printf("%d",arr[i][j]);
					if(j < m)
						printf(" ");
				}
				printf("\n");
			}
		}
	}
	return 0;
}