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: 6ms
Memory: 1092kB
Author: 2018212212119
In contest: 1273

#include<stdio.h>
int main(){
	int T,n,m,k,i,j;
	scanf("%d",&T);
	while(T--){
		scanf("%d %d %d",&n,&m,&k);
		int a[n][m];
		for(i = 0; i < n; i ++)
		{
			for(j = 0; j < m; j ++)
			{
		    	scanf("%d", *(a + i) + j);
			}
		}
		if(k%4==1){
		for(i=0;i<m;i++)
	    {
		 for(j=n-1;j>=0;j--){
		 
			printf("%d",a[j][i]);
			 if(j!=0){
			   	printf(" ");
			   }
		}
		 printf("\n");
	    }
        }
        if(k%4==2){
        	for(i=n-1;i>=0;i--)
	        {
		      for(j=m-1;j>=0;j--){
			   printf("%d",a[i][j]);
			   if(j!=0){
			   	printf(" ");
			   }
			   }
		       printf("\n");
	        }
	    }
	    if(k%4==3){
	    	for(i=m-1;i>=0;i--)
	        {
		      for(j=0;j<n;j++){
		
			  printf("%d",a[j][i]);
			   if(j!=n){
			   printf(" ");
			   }
		}
		      printf("\n");
	        }
		}
		if(k%4==0){
			for(i = 0; i < n; i ++)
		{
			for(j = 0; j < m; j ++)
			{
				 printf("%d",a[i][j]);
				  if(j!=m){
			   	printf(" ");
			   }
		       
			}
			  printf("\n");
		}
	  
        	
		}

	printf("\n");
	}
	
  return 0;	
}