旋转n*n方阵（C语言）

#include<stdio.h>
#include<string.h>
#define N 100

int a[N][N],b[N][N],c[N][N];

int main()
{
	int n,i,j,tot=1;
	
	printf("输入方阵的规模n:\n");
	
	scanf("%d",&n);
	
	for(i = 0; i < n; i ++)
		for(j = 0; j < n;j ++)
		{
			a[i][j] = tot++;
			b[n-j-1][i] = a[i][j];
			c[j][n-i-1] = a[i][j];
		}
	
	printf("原始n*n方阵：\n");
	for(i = 0; i < n; i ++){
		for(j = 0; j < n;j ++)
			printf("%3d",a[i][j]);
		printf("\n");
	}
	printf("\n");
	
	printf("原方阵逆时针旋转90度后：\n"); 
	for(i = 0; i < n; i++){
		for(j = 0;j < n; j ++)
			printf("%3d",b[i][j]);
		printf("\n");
	}
	printf("\n");
	
	printf("原方阵顺时针旋转90度后：\n");
	for(i = 0; i < n; i ++){
		for(j = 0; j < n; j ++)
			printf("%3d",c[i][j]);
		printf("\n");
	}
	return 0;	
}